Gram–Schmidt process – Wikipedia

Posted on July 27, 2016 by lordneo

Orthonormalization of a set of vectors

The first two steps of the Gram–Schmidt process

In mathematics, particularly linear algebra and numerical analysis, the Gram–Schmidt process is a method for orthonormalizing a set of vectors in an inner product space, most commonly the Euclidean space $R n$ equipped with the standard inner product. The Gram–Schmidt process takes a finite, linearly independent set of vectors $S = {v 1, \dots, v k}$ for $k \leq n$ and generates an orthogonal set $S' = {u 1, \dots, u k}$ that spans the same k-dimensional subspace of Rⁿ as S.

The method is named after Jørgen Pedersen Gram and Erhard Schmidt, but Pierre-Simon Laplace had been familiar with it before Gram and Schmidt.^[1] In the theory of Lie group decompositions, it is generalized by the Iwasawa decomposition.

The application of the Gram–Schmidt process to the column vectors of a full column rank matrix yields the QR decomposition (it is decomposed into an orthogonal and a triangular matrix).

Table of Contents

The Gram–Schmidt process[edit]

The modified Gram-Schmidt process being executed on three linearly independent, non-orthogonal vectors of a basis for R³. Click on image for details. Modification is explained in the Numerical Stability section of this article.

We define the projection operator by

{displaystyle operatorname {proj} _{mathbf {u} }(mathbf {v} )={frac {langle mathbf {v} ,mathbf {u} rangle }{langle mathbf {u} ,mathbf {u} rangle }}{mathbf {u} },}

where

{displaystyle langle mathbf {v} ,mathbf {u} rangle }

$langle mathbf {v} ,mathbf {u} rangle$ denotes the inner product of the vectors v and u. This operator projects the vector v orthogonally onto the line spanned by vector u. If u = 0, we define

{displaystyle operatorname {proj} _{mathbf {0} }(mathbf {v} ):=mathbf {0} }

${displaystyle operatorname {proj} _{mathbf {0} }(mathbf {v} ):=mathbf {0} }$ , i.e., the projection map

{displaystyle operatorname {proj} _{mathbf {0} }}

${displaystyle operatorname {proj} _{mathbf {0} }}$ is the zero map, sending every vector to the zero vector.

The Gram–Schmidt process then works as follows:

{displaystyle {begin{aligned}mathbf {u} _{1}&=mathbf {v} _{1},&!mathbf {e} _{1}&={frac {mathbf {u} _{1}}{|mathbf {u} _{1}|}}\mathbf {u} _{2}&=mathbf {v} _{2}-operatorname {proj} _{mathbf {u} _{1}}(mathbf {v} _{2}),&!mathbf {e} _{2}&={frac {mathbf {u} _{2}}{|mathbf {u} _{2}|}}\mathbf {u} _{3}&=mathbf {v} _{3}-operatorname {proj} _{mathbf {u} _{1}}(mathbf {v} _{3})-operatorname {proj} _{mathbf {u} _{2}}(mathbf {v} _{3}),&!mathbf {e} _{3}&={frac {mathbf {u} _{3}}{|mathbf {u} _{3}|}}\mathbf {u} _{4}&=mathbf {v} _{4}-operatorname {proj} _{mathbf {u} _{1}}(mathbf {v} _{4})-operatorname {proj} _{mathbf {u} _{2}}(mathbf {v} _{4})-operatorname {proj} _{mathbf {u} _{3}}(mathbf {v} _{4}),&!mathbf {e} _{4}&={mathbf {u} _{4} over |mathbf {u} _{4}|}\&{} vdots &&{} vdots \mathbf {u} _{k}&=mathbf {v} _{k}-sum _{j=1}^{k-1}operatorname {proj} _{mathbf {u} _{j}}(mathbf {v} _{k}),&!mathbf {e} _{k}&={frac {mathbf {u} _{k}}{|mathbf {u} _{k}|}}.end{aligned}}}

The sequence $u 1, \dots, u k$ is the required system of orthogonal vectors, and the normalized vectors $e 1, \dots, e k$ form an orthonormal set. The calculation of the sequence $u 1, \dots, u k$ is known as Gram–Schmidt orthogonalization, while the calculation of the sequence $e 1, \dots, e k$ is known as Gram–Schmidt orthonormalization as the vectors are normalized.

To check that these formulas yield an orthogonal sequence, first compute

{displaystyle langle mathbf {u} _{1},mathbf {u} _{2}rangle }

${displaystyle langle mathbf {u} _{1},mathbf {u} _{2}rangle }$ by substituting the above formula for u₂: we get zero. Then use this to compute

{displaystyle langle mathbf {u} _{1},mathbf {u} _{3}rangle }

${displaystyle langle mathbf {u} _{1},mathbf {u} _{3}rangle }$ again by substituting the formula for u₃: we get zero. The general proof proceeds by mathematical induction.

Geometrically, this method proceeds as follows: to compute u_i, it projects v_i orthogonally onto the subspace U generated by $u 1, \dots, u i -1$ , which is the same as the subspace generated by $v 1, \dots, v i -1$ . The vector u_i is then defined to be the difference between v_i and this projection, guaranteed to be orthogonal to all of the vectors in the subspace U.

The Gram–Schmidt process also applies to a linearly independent countably infinite sequence ${v i} i$ . The result is an orthogonal (or orthonormal) sequence ${u i} i$ such that for natural number $n$ :
the algebraic span of $v 1, \dots, v n$ is the same as that of $u 1, \dots, u n$ .

If the Gram–Schmidt process is applied to a linearly dependent sequence, it outputs the $0$ vector on the ith step, assuming that $v i$ is a linear combination of $v 1, \dots, v i -1$ . If an orthonormal basis is to be produced, then the algorithm should test for zero vectors in the output and discard them because no multiple of a zero vector can have a length of 1. The number of vectors output by the algorithm will then be the dimension of the space spanned by the original inputs.

A variant of the Gram–Schmidt process using transfinite recursion applied to a (possibly uncountably) infinite sequence of vectors

{displaystyle (v_{alpha })_{alpha

$(v_{alpha })_{alpha <lambda }$ yields a set of orthonormal vectors

{displaystyle (u_{alpha })_{alpha

$(u_{alpha })_{alpha <kappa }$ with

{displaystyle kappa leq lambda }

$kappa leq lambda$ such that for any

{displaystyle alpha leq lambda }

$alpha leq lambda$ , the completion of the span of

{displaystyle {u_{beta }:beta

${displaystyle {u_{beta }:beta <min(alpha ,kappa )}}$ is the same as that of

{displaystyle {v_{beta }:beta

${displaystyle {v_{beta }:beta <alpha }}$ . In particular, when applied to a (algebraic) basis of a Hilbert space (or, more generally, a basis of any dense subspace), it yields a (functional-analytic) orthonormal basis. Note that in the general case often the strict inequality

{displaystyle kappa

${displaystyle kappa <lambda }$ holds, even if the starting set was linearly independent, and the span of

{displaystyle (u_{alpha })_{alpha

$(u_{alpha })_{alpha <kappa }$ need not be a subspace of the span of

{displaystyle (v_{alpha })_{alpha

$(v_{alpha })_{alpha <lambda }$ (rather, it’s a subspace of its completion).

Example[edit]

Euclidean space[edit]

Consider the following set of vectors in $R 2$ (with the conventional inner product)

{displaystyle S=left{mathbf {v} _{1}={begin{bmatrix}3\1end{bmatrix}},mathbf {v} _{2}={begin{bmatrix}2\2end{bmatrix}}right}.}

Now, perform Gram–Schmidt, to obtain an orthogonal set of vectors:

{displaystyle mathbf {u} _{1}=mathbf {v} _{1}={begin{bmatrix}3\1end{bmatrix}}}

{displaystyle mathbf {u} _{2}=mathbf {v} _{2}-operatorname {proj} _{mathbf {u} _{1}}(mathbf {v} _{2})={begin{bmatrix}2\2end{bmatrix}}-operatorname {proj} _{left[{begin{smallmatrix}3\1end{smallmatrix}}right]}{begin{bmatrix}2\2end{bmatrix}}={begin{bmatrix}2\2end{bmatrix}}-{frac {8}{10}}{begin{bmatrix}3\1end{bmatrix}}={begin{bmatrix}-2/5\6/5end{bmatrix}}.}

We check that the vectors $u 1$ and $u 2$ are indeed orthogonal:

{displaystyle langle mathbf {u} _{1},mathbf {u} _{2}rangle =leftlangle {begin{bmatrix}3\1end{bmatrix}},{begin{bmatrix}-2/5\6/5end{bmatrix}}rightrangle =-{frac {6}{5}}+{frac {6}{5}}=0,}

noting that if the dot product of two vectors is 0 then they are orthogonal.

For non-zero vectors, we can then normalize the vectors by dividing out their sizes as shown above:

{displaystyle mathbf {e} _{1}={frac {1}{sqrt {10}}}{begin{bmatrix}3\1end{bmatrix}}}

{displaystyle mathbf {e} _{2}={frac {1}{sqrt {40 over 25}}}{begin{bmatrix}-2/5\6/5end{bmatrix}}={frac {1}{sqrt {10}}}{begin{bmatrix}-1\3end{bmatrix}}.}

Properties[edit]

Denote by

{displaystyle operatorname {GS} (mathbf {v} _{1},dots ,mathbf {v} _{k})}

${displaystyle operatorname {GS} (mathbf {v} _{1},dots ,mathbf {v} _{k})}$ the result of applying the Gram–Schmidt process to a collection of vectors

{displaystyle mathbf {v} _{1},dots ,mathbf {v} _{k}}

${displaystyle mathbf {v} _{1},dots ,mathbf {v} _{k}}$ . This yields a map

{displaystyle operatorname {GS} colon (mathbb {R} ^{n})^{k}to (mathbb {R} ^{n})^{k}}

${displaystyle operatorname {GS} colon (mathbb {R} ^{n})^{k}to (mathbb {R} ^{n})^{k}}$ .

It has the following properties:

It is continuous
It is orientation preserving in the sense that ${displaystyle operatorname {or} (mathbf {v} _{1},dots ,mathbf {v} _{k})=operatorname {or} (operatorname {GS} (mathbf {v} _{1},dots ,mathbf {v} _{k}))}$
It commutes with orthogonal maps:

Let

{displaystyle gcolon mathbb {R} ^{n}to mathbb {R} ^{n}}

${displaystyle gcolon mathbb {R} ^{n}to mathbb {R} ^{n}}$ be orthogonal (with respect to the given inner product). Then we have

{displaystyle operatorname {GS} (g(mathbf {v} _{1}),dots ,g(mathbf {v} _{k}))=left(g(operatorname {GS} (mathbf {v} _{1},dots ,mathbf {v} _{k})_{1}),dots ,g(operatorname {GS} (mathbf {v} _{1},dots ,mathbf {v} _{k})_{k})right)}

Further a parametrized version of the Gram–Schmidt process yields a (strong) deformation retraction of the general linear group

{displaystyle mathrm {GL} (mathbb {R} ^{n})}

${displaystyle mathrm {GL} (mathbb {R} ^{n})}$ onto the orthogonal group

{displaystyle O(mathbb {R} ^{n})}

${displaystyle O(mathbb {R} ^{n})}$ .

Numerical stability[edit]

When this process is implemented on a computer, the vectors

{displaystyle mathbf {u} _{k}}

$mathbf {u} _{k}$ are often not quite orthogonal, due to rounding errors. For the Gram–Schmidt process as described above (sometimes referred to as “classical Gram–Schmidt”) this loss of orthogonality is particularly bad; therefore, it is said that the (classical) Gram–Schmidt process is numerically unstable.

The Gram–Schmidt process can be stabilized by a small modification; this version is sometimes referred to as modified Gram-Schmidt or MGS. This approach gives the same result as the original formula in exact arithmetic and introduces smaller errors in finite-precision arithmetic.
Instead of computing the vector $u k$ as

{displaystyle mathbf {u} _{k}=mathbf {v} _{k}-operatorname {proj} _{mathbf {u} _{1}}(mathbf {v} _{k})-operatorname {proj} _{mathbf {u} _{2}}(mathbf {v} _{k})-cdots -operatorname {proj} _{mathbf {u} _{k-1}}(mathbf {v} _{k}),}

it is computed as

{displaystyle {begin{aligned}mathbf {u} _{k}^{(1)}&=mathbf {v} _{k}-operatorname {proj} _{mathbf {u} _{1}}(mathbf {v} _{k}),\mathbf {u} _{k}^{(2)}&=mathbf {u} _{k}^{(1)}-operatorname {proj} _{mathbf {u} _{2}}left(mathbf {u} _{k}^{(1)}right),\&;;vdots \mathbf {u} _{k}^{(k-2)}&=mathbf {u} _{k}^{(k-3)}-operatorname {proj} _{mathbf {u} _{k-2}}left(mathbf {u} _{k}^{(k-3)}right),\mathbf {u} _{k}^{(k-1)}&=mathbf {u} _{k}^{(k-2)}-operatorname {proj} _{mathbf {u} _{k-1}}left(mathbf {u} _{k}^{(k-2)}right),\mathbf {e} _{k}&={frac {mathbf {u} _{k}^{(k-1)}}{left|mathbf {u} _{k}^{(k-1)}right|}}end{aligned}}}

This method is used in the previous animation, when the intermediate $v ‘ 3$ vector is used when orthogonalizing the blue vector $v 3$ .

Here is another description of the modified algorithm. Given the vectors

{displaystyle v_{1},v_{2},dots ,v_{n}}

${displaystyle v_{1},v_{2},dots ,v_{n}}$ , in our first step we produce vectors

{displaystyle v_{1},v_{2}^{(1)},dots ,v_{n}^{(1)}}

${displaystyle v_{1},v_{2}^{(1)},dots ,v_{n}^{(1)}}$ by removing components along the direction of

{displaystyle v_{1}}

$v_{1}$ . In formulas,

{displaystyle v_{k}^{(1)}:=v_{k}-{frac {langle v_{k},v_{1}rangle }{langle v_{1},v_{1}rangle }}v_{1}}

${displaystyle v_{k}^{(1)}:=v_{k}-{frac {langle v_{k},v_{1}rangle }{langle v_{1},v_{1}rangle }}v_{1}}$ . After this step we already have two of our desired orthogonal vectors

{displaystyle u_{1},dots ,u_{n}}

${displaystyle u_{1},dots ,u_{n}}$ , namely

{displaystyle u_{1}=v_{1},u_{2}=v_{2}^{(1)}}

${displaystyle u_{1}=v_{1},u_{2}=v_{2}^{(1)}}$ , but we also made

{displaystyle v_{3}^{(1)},dots ,v_{n}^{(1)}}

${displaystyle v_{3}^{(1)},dots ,v_{n}^{(1)}}$ already orthogonal to

{displaystyle u_{1}}

$u_{1}$ . Next, we orthogonalize those remaining vectors against

{displaystyle u_{2}=v_{2}^{(1)}}

${displaystyle u_{2}=v_{2}^{(1)}}$ . This means we compute

{displaystyle v_{3}^{(2)},v_{4}^{(2)},dots ,v_{n}^{(2)}}

${displaystyle v_{3}^{(2)},v_{4}^{(2)},dots ,v_{n}^{(2)}}$ by subtraction

{displaystyle v_{k}^{(2)}:=v_{k}^{(1)}-{frac {langle v_{k}^{(1)},u_{2}rangle }{langle u_{2},u_{2}rangle }}u_{2}}

${displaystyle v_{k}^{(2)}:=v_{k}^{(1)}-{frac {langle v_{k}^{(1)},u_{2}rangle }{langle u_{2},u_{2}rangle }}u_{2}}$ . Now we have stored the vectors

{displaystyle v_{1},v_{2}^{(1)},v_{3}^{(2)},v_{4}^{(2)},dots ,v_{n}^{(2)}}

${displaystyle v_{1},v_{2}^{(1)},v_{3}^{(2)},v_{4}^{(2)},dots ,v_{n}^{(2)}}$ where the first three vectors are already

{displaystyle u_{1},u_{2},u_{3}}

${displaystyle u_{1},u_{2},u_{3}}$ and the remaining vectors are already orthogonal to

{displaystyle u_{1},u_{2}}

${displaystyle u_{1},u_{2}}$ . As should be clear now, the next step orthogonalizes

{displaystyle v_{4}^{(2)},dots ,v_{n}^{(2)}}

${displaystyle v_{4}^{(2)},dots ,v_{n}^{(2)}}$ against

{displaystyle u_{3}=v_{3}^{(2)}}

${displaystyle u_{3}=v_{3}^{(2)}}$ . Proceeding in this manner we find the full set of orthogonal vectors

{displaystyle u_{1},dots ,u_{n}}

${displaystyle u_{1},dots ,u_{n}}$ . If orthonormal vectors are desired, then we normalize as we go, so that the denominators in the subtraction formulas turn into ones.

Algorithm[edit]

The following MATLAB algorithm implements the Gram–Schmidt orthonormalization for Euclidean Vectors. The vectors $v 1, \dots, v k$ (columns of matrix V, so that V(:,j) is the jth vector) are replaced by orthonormal vectors (columns of U) which span the same subspace.

function U = gramschmidt(V)
    [n, k] = size(V);
    U = zeros(n,k);
    U(:,1) = V(:,1) / norm(V(:,1));
    for i = 2:k
        U(:,i) = V(:,i);
        for j = 1:i-1
            U(:,i) = U(:,i) - (U(:,j)'*U(:,i)) * U(:,j);
        end
        U(:,i) = U(:,i) / norm(U(:,i));
    end
end

The cost of this algorithm is asymptotically $O(nk 2)$ floating point operations, where $n$ is the dimensionality of the vectors.

Via Gaussian elimination[edit]

If the rows ${v 1, \dots, v k}$ are written as a matrix

{displaystyle A}

$A$ , then applying Gaussian elimination to the augmented matrix

{displaystyle left[AA^{mathsf {T}}|Aright]}

${displaystyle left[AA^{mathsf {T}}|Aright]}$ will produce the orthogonalized vectors in place of

{displaystyle A}

$A$ . However the matrix

{displaystyle AA^{mathsf {T}}}

${displaystyle AA^{mathsf {T}}}$ must be brought to row echelon form, using only the row operation of adding a scalar multiple of one row to another.^[3] For example, taking

{displaystyle mathbf {v} _{1}={begin{bmatrix}3&1end{bmatrix}},mathbf {v} _{2}={begin{bmatrix}2&2end{bmatrix}}}

${displaystyle mathbf {v} _{1}={begin{bmatrix}3&1end{bmatrix}},mathbf {v} _{2}={begin{bmatrix}2&2end{bmatrix}}}$ as above, we have

{displaystyle left[AA^{mathsf {T}}|Aright]=left[{begin{array}{rr|rr}10&8&3&1\8&8&2&2end{array}}right]}

And reducing this to row echelon form produces

{displaystyle left[{begin{array}{rr|rr}1&.8&.3&.1\0&1&-.25&.75end{array}}right]}

The normalized vectors are then

{displaystyle mathbf {e} _{1}={frac {1}{sqrt {.3^{2}+.1^{2}}}}{begin{bmatrix}.3&.1end{bmatrix}}={frac {1}{sqrt {10}}}{begin{bmatrix}3&1end{bmatrix}}}

{displaystyle mathbf {e} _{2}={frac {1}{sqrt {.25^{2}+.75^{2}}}}{begin{bmatrix}-.25&.75end{bmatrix}}={frac {1}{sqrt {10}}}{begin{bmatrix}-1&3end{bmatrix}},}

as in the example above.

Determinant formula[edit]

The result of the Gram–Schmidt process may be expressed in a non-recursive formula using determinants.

{displaystyle mathbf {e} _{j}={frac {1}{sqrt {D_{j-1}D_{j}}}}{begin{vmatrix}langle mathbf {v} _{1},mathbf {v} _{1}rangle &langle mathbf {v} _{2},mathbf {v} _{1}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{1}rangle \langle mathbf {v} _{1},mathbf {v} _{2}rangle &langle mathbf {v} _{2},mathbf {v} _{2}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{2}rangle \vdots &vdots &ddots &vdots \langle mathbf {v} _{1},mathbf {v} _{j-1}rangle &langle mathbf {v} _{2},mathbf {v} _{j-1}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{j-1}rangle \mathbf {v} _{1}&mathbf {v} _{2}&cdots &mathbf {v} _{j}end{vmatrix}}}

{displaystyle mathbf {u} _{j}={frac {1}{D_{j-1}}}{begin{vmatrix}langle mathbf {v} _{1},mathbf {v} _{1}rangle &langle mathbf {v} _{2},mathbf {v} _{1}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{1}rangle \langle mathbf {v} _{1},mathbf {v} _{2}rangle &langle mathbf {v} _{2},mathbf {v} _{2}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{2}rangle \vdots &vdots &ddots &vdots \langle mathbf {v} _{1},mathbf {v} _{j-1}rangle &langle mathbf {v} _{2},mathbf {v} _{j-1}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{j-1}rangle \mathbf {v} _{1}&mathbf {v} _{2}&cdots &mathbf {v} _{j}end{vmatrix}}}

where D₀=1 and, for j ≥ 1, D_j is the Gram determinant

{displaystyle D_{j}={begin{vmatrix}langle mathbf {v} _{1},mathbf {v} _{1}rangle &langle mathbf {v} _{2},mathbf {v} _{1}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{1}rangle \langle mathbf {v} _{1},mathbf {v} _{2}rangle &langle mathbf {v} _{2},mathbf {v} _{2}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{2}rangle \vdots &vdots &ddots &vdots \langle mathbf {v} _{1},mathbf {v} _{j}rangle &langle mathbf {v} _{2},mathbf {v} _{j}rangle &cdots &langle mathbf {v} _{j},mathbf {v} _{j}rangle end{vmatrix}}.}

Note that the expression for u_k is a “formal” determinant, i.e. the matrix contains both scalars
and vectors; the meaning of this expression is defined to be the result of a cofactor expansion along the row of vectors.

The determinant formula for the Gram-Schmidt is computationally slower (exponentially slower) than the recursive algorithms described above; it is mainly of theoretical interest.

Expressed using geometric algebra[edit]

Expressed using notation used in geometric algebra, the unnormalized results of the Gram–Schmidt process can be expressed as

{displaystyle mathbf {u} _{k}=mathbf {v} _{k}-sum _{j=1}^{k-1}(mathbf {v} _{k}cdot mathbf {u} _{j})mathbf {u} _{j}^{-1} ,}

which is equivalent to the expression using the

{displaystyle operatorname {proj} }

${displaystyle operatorname {proj} }$ operator defined above. The results can equivalently be expressed as^[4]

{displaystyle mathbf {u} _{k}=mathbf {v} _{k}wedge mathbf {v} _{k-1}wedge cdot cdot cdot wedge mathbf {v} _{1}(mathbf {v} _{k-1}wedge cdot cdot cdot wedge mathbf {v} _{1})^{-1},}

which is closely related to the expression using determinants above.

Alternatives[edit]

Other orthogonalization algorithms use Householder transformations or Givens rotations. The algorithms using Householder transformations are more stable than the stabilized Gram–Schmidt process. On the other hand, the Gram–Schmidt process produces the

{displaystyle j}

$j$ th orthogonalized vector after the

{displaystyle j}

$j$ th iteration, while orthogonalization using Householder reflections produces all the vectors only at the end. This makes only the Gram–Schmidt process applicable for iterative methods like the Arnoldi iteration.

Yet another alternative is motivated by the use of Cholesky decomposition for inverting the matrix of the normal equations in linear least squares. Let

{displaystyle V}

$V$ be a full column rank matrix, whose columns need to be orthogonalized. The matrix

{displaystyle V^{*}V}

${displaystyle V^{*}V}$ is Hermitian and positive definite, so it can be written as

{displaystyle V^{*}V=LL^{*},}

${displaystyle V^{*}V=LL^{*},}$ using the Cholesky decomposition. The lower triangular matrix

{displaystyle L}

$L$ with strictly positive diagonal entries is invertible. Then columns of the matrix

{displaystyle U=Vleft(L^{-1}right)^{*}}

${displaystyle U=Vleft(L^{-1}right)^{*}}$ are orthonormal and span the same subspace as the columns of the original matrix

{displaystyle V}

$V$ . The explicit use of the product

{displaystyle V^{*}V}

${displaystyle V^{*}V}$ makes the algorithm unstable, especially if the product’s condition number is large. Nevertheless, this algorithm is used in practice and implemented in some software packages because of its high efficiency and simplicity.

In quantum mechanics there are several orthogonalization schemes with characteristics better suited for certain applications than original Gram–Schmidt. Nevertheless, it remains a popular and effective algorithm for even the largest electronic structure calculations.^[5]

References[edit]

^ Cheney, Ward; Kincaid, David (2009). Linear Algebra: Theory and Applications. Sudbury, Ma: Jones and Bartlett. pp. 544, 558. ISBN 978-0-7637-5020-6.
^ Pursell, Lyle; Trimble, S. Y. (1 January 1991). “Gram-Schmidt Orthogonalization by Gauss Elimination”. The American Mathematical Monthly. 98 (6): 544–549. doi:10.2307/2324877. JSTOR 2324877.
^ Doran, Chris; Lasenby, Anthony (2007). Geometric Algebra for Physicists. Cambridge University Press. p. 124. ISBN 978-0-521-71595-9.
^ Pursell, Yukihiro; et al. (2011). “First-principles calculations of electron states of a silicon nanowire with 100,000 atoms on the K computer”. SC ’11 Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis: 1:1–1:11. doi:10.1145/2063384.2063386. ISBN 9781450307710. S2CID 14316074.

Sources[edit]

Bau III, David; Trefethen, Lloyd N. (1997), Numerical linear algebra, Philadelphia: Society for Industrial and Applied Mathematics, ISBN 978-0-89871-361-9.
Golub, Gene H.; Van Loan, Charles F. (1996), Matrix Computations (3rd ed.), Johns Hopkins, ISBN 978-0-8018-5414-9.
Greub, Werner (1975), Linear Algebra (4th ed.), Springer.
Soliverez, C. E.; Gagliano, E. (1985), “Orthonormalization on the plane: a geometric approach” (PDF), Mex. J. Phys., 31 (4): 743–758.

Gram–Schmidt process – Wikipedia

The Gram–Schmidt process[edit]

Example[edit]

Euclidean space[edit]

Properties[edit]

Numerical stability[edit]

Algorithm[edit]

Via Gaussian elimination[edit]

Determinant formula[edit]

Expressed using geometric algebra[edit]

Alternatives[edit]

References[edit]

Sources[edit]

External links[edit]

Recent Posts

Recent Comments

Archives

Categories

Meta