If apply classical Gram–Schmidt on a 2 by 2 matrix, and the $q_1$ and $q_2$ I found are not orthogonal. Does that mean I need to apply modified Gram–Schmidt on it? Or does modified Gram–Schmidt can only be applied on matrices which are bigger than 3 by 3?
2026-03-25 16:05:19.1774454719
Classical and modified Gram–Schmidt
2.4k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in NUMERICAL-METHODS
- The Runge-Kutta method for a system of equations
- How to solve the exponential equation $e^{a+bx}+e^{c+dx}=1$?
- Is the calculated solution, if it exists, unique?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Minimum of the 2-norm
- Is method of exhaustion the same as numerical integration?
- Prove that Newton's Method is invariant under invertible linear transformations
- Initial Value Problem into Euler and Runge-Kutta scheme
- What are the possible ways to write an equation in $x=\phi(x)$ form for Iteration method?
- Numerical solution for a two dimensional third order nonlinear differential equation
Related Questions in GRAM-SCHMIDT
- Finding the orthogonal projection of a vector on a subspace spanned by non-orthogonal vectors.
- Orthogonal Function Dirac Delta Series
- Legendre polynomials: show that two algorithms construct the same polynomials
- Is there a more convenient method for converting a base to be orthogonal than Gram Schmidt?
- Gram Schmidt Process with inner product $\langle z,w\rangle = 3(z_1)(\bar{w_1}) + 2(z_2)(\bar{w_2})+i(z_1)(\bar{w_2})-i(z_2)(\bar{w_1})$
- Gram-Schmidt orthonormal basis
- Modified Gram Schmidt
- Orthonormal Basis of Hyperplane
- History Question - QR Factorization
- Dimension of an orthonormal basis
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The classical Gram-Schmidt (CGS) and modified Gram-Schmidt (MGS) processes lead to the same result in exact precision arithmetic. In finite-precision arithmetic, MGS is more numerically stable than the classic process.
For a given square matrix $A$ of size $n$, with linearly independent columns $a_1, ..., a_n$, the algorithms can be written is pseudocode as:
CGS vs. MGS
Note that for $n=2$, the methods coincide even in finite-precision arithmetic. The error in enforcing orthogonality of vectors $q_i$ found by MGS depends not only on machine precision but also on the condition number $\kappa(A)$ of the matrix.
For ill-conditioned matrices other orthogonalization methods are recommended, such as the Householder of the Givens algorithm. These methods produce vectors that are orthogonal up to machine precision. For further information on error bounds of orthogonalization schemes, see The influence of orthogonality on the Arnoldi method by Braconnier, Langlois and Rioual (Linear Algebra and its Applications, 2000).