Scribd
Upload
13 views10 pages

Gram Schmidt Presentation

The document explains the Gram-Schmidt orthogonalization process, which converts a set of linearly independent vectors into an orthogonal or orthonormal set while spanning the same subspace. It outlines the algorithm, including projection formulas and examples, and discusses applications in linear algebra, QR decomposition, and numerical stability. The importance of orthonormal bases in simplifying calculations and their relevance in various mathematical fields is also highlighted.

Uploaded by

Sandipan Das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views10 pages

Gram Schmidt Presentation

The document explains the Gram-Schmidt orthogonalization process, which converts a set of linearly independent vectors into an orthogonal or orthonormal set while spanning the same subspace. It outlines the algorithm, including projection formulas and examples, and discusses applications in linear algebra, QR decomposition, and numerical stability. The importance of orthonormal bases in simplifying calculations and their relevance in various mathematical fields is also highlighted.

Uploaded by

Sandipan Das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Gram-Schmidt Orthogonalization

Process
Overview
• What is orthogonalization?
• Why do we need orthogonal or orthonormal
bases?
• Introduction to the Gram-Schmidt process
• Applications in linear algebra and beyond
Definitions Recap
• Inner Product Space: A vector space with a dot
product or general inner product.
• Orthogonal Vectors: u ⋅ v = 0
• Orthonormal Vectors: Orthogonal vectors with
unit length.
• Basis: A set of linearly independent vectors
that span a space.
Goal of the Gram-Schmidt Process
• Convert a set of linearly independent vectors
{v₁, v₂, ..., vₙ}
• Into an orthogonal (or orthonormal) set {u₁,
u₂, ..., uₙ}
• Such that both sets span the same subspace of
ℝⁿ
The Gram-Schmidt Algorithm
• Given a basis {v₁, v₂, ..., vₙ}:
• 1. u₁ = v₁
• 2. u₂ = v₂ − projᵤ₁(v₂)
• 3. u₃ = v₃ − projᵤ₁(v₃) − projᵤ₂(v₃)
• 4. ...
• Normalize each uᵢ to get orthonormal vectors
eᵢ = uᵢ / ||uᵢ||
Projection Formula
• projᵤ(v) = [(v ⋅ u) / (u ⋅ u)] * u
Example (2D Case)
• Given: v₁ = [1, 1], v₂ = [1, 0]
• 1. u₁ = v₁
• 2. u₂ = v₂ − projᵤ₁(v₂)
• Compute step-by-step to show orthogonal
basis
Applications
• QR Decomposition: A = QR, where Q is
orthonormal, R is upper triangular
• Least Squares Solutions for inconsistent linear
systems
• Numerical stability in algorithms
• Fourier series, signal processing, data
compression
• Orthogonalization in function spaces
Advantages of Orthonormal Bases
• Simplify calculations: uᵢ ⋅ uⱼ = δᵢⱼ
• Easy projections: proj_U(v) = Σ (v ⋅ uᵢ)uᵢ
• Essential in solving differential equations,
optimization, and spectral theory
Conclusion
• Gram-Schmidt converts any basis into an
orthogonal one
• Critical in theoretical and applied linear
algebra
• Foundation for many algorithms in numerical
linear algebra

You might also like