Gram-Schmidt orthogonalization, also called the Gram-Schmidt process, is a procedure which takes a nonorthogonal set of linearly independent functions and constructs an orthogonal basis over an arbitrary interval with respect to an arbitrary weighting function .
Applying the Gram-Schmidt process to the functions 1, , , ... on the interval with the usual inner product gives the Legendre polynomials (up to constant multiples; Reed and Simon 1972, p. 47).
Given an original set of linearly independent functions , let denote the orthogonalized (but not normalized) functions, denote the orthonormalized functions, and define
(1)
| |||
(2)
|
Then take
(3)
|
where we require
(4)
| |||
(5)
|
By definition,
(6)
|
so
(7)
|
The first orthogonalized function is therefore
(8)
|
and the corresponding normalized function is
(9)
|
By mathematical induction, it follows that
(10)
|
where
(11)
|
and
(12)
|
If the functions are normalized to instead of 1, then
(13)
|
(14)
|
(15)
|
Orthogonal polynomials are especially easy to generate using Gram-Schmidt orthonormalization. Use the notation
(16)
| |||
(17)
|
where is a weighting function, and define the first few polynomials,
(18)
| |||
(19)
|
As defined, and are orthogonal polynomials, as can be seen from
(20)
| |||
(21)
| |||
(22)
| |||
(23)
|
Now use the recurrence relation
(24)
|
to construct all higher order polynomials.
To verify that this procedure does indeed produce orthogonal polynomials, examine
(25)
| |||
(26)
| |||
(27)
| |||
(28)
| |||
(29)
| |||
(30)
| |||
(31)
|
since . Therefore, all the polynomials are orthogonal.
Many common orthogonal polynomials of mathematical physics can be generated in this manner. Unfortunately, the process turns out to be numerically unstable (Golub and Van Loan 1996).