06.09.2021 Views

First Semester in Numerical Analysis with Julia, 2020a

First Semester in Numerical Analysis with Julia, 2020a

First Semester in Numerical Analysis with Julia, 2020a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

CHAPTER 5. APPROXIMATION THEORY 202<br />

We need some def<strong>in</strong>itions and theorems to cont<strong>in</strong>ue <strong>with</strong> our quest. Let’s start <strong>with</strong> a formal<br />

def<strong>in</strong>ition of orthogonal functions.<br />

Def<strong>in</strong>ition 88. Functions {φ 0 ,φ 1 , ..., φ n } are orthogonal for the <strong>in</strong>terval [a, b] and <strong>with</strong> respect<br />

to the weight function w(x) if<br />

〈φ j ,φ k 〉 =<br />

∫ b<br />

a<br />

⎧<br />

⎨0 if j ≠ k<br />

w(x)φ j (x)φ k (x)dx =<br />

⎩α j > 0 if j = k<br />

where α j is some constant. If, <strong>in</strong> addition, α j =1for all j, then the functions are called<br />

orthonormal.<br />

How can we f<strong>in</strong>d an orthogonal or orthonormal basis for our vector space? Gram-Schmidt<br />

process from l<strong>in</strong>ear algebra provides the answer.<br />

Theorem 89 (Gram-Schmidt process). Given a weight function w(x), the Gram-Schmidt<br />

process constructs a unique set of polynomials φ 0 (x),φ 1 (x), ..., φ n (x) where the degree of φ i (x)<br />

is i, such that<br />

⎧<br />

⎨0 if j ≠ k<br />

〈φ j ,φ k 〉 =<br />

⎩1 if j = k<br />

and the coefficient of x n <strong>in</strong> φ n (x) is positive.<br />

Let’s discuss two orthogonal polynomials that can be obta<strong>in</strong>ed from the Gram-Schmidt<br />

process us<strong>in</strong>g different weight functions.<br />

Example 90 (Legendre Polynomials). If w(x) ≡ 1 and [a, b] =[−1, 1], the first four polynomials<br />

obta<strong>in</strong>ed from the Gram-Schmidt process, when the process is applied to the monomials<br />

1,x,x 2 ,x 3 , ..., are:<br />

√<br />

1 3<br />

φ 0 (x) =√<br />

2 ,φ 1(x) =<br />

2 x, φ 2(x) = 1 √<br />

5<br />

2 2 (3x2 − 1),φ 3 (x) = 1 √<br />

7<br />

2 2 (5x3 − 3x).<br />

Often these polynomials are written <strong>in</strong> its orthogonal form; that is, we drop the requirement<br />

〈φ j ,φ j 〉 =1<strong>in</strong> the Gram-Schmidt process, and we scale the polynomials so that the value of<br />

each polynomial at 1 equals 1. The first four polynomials <strong>in</strong> that form are<br />

L 0 (x) =1,L 1 (x) =x, L 2 (x) = 3 2 x2 − 1 2 ,L 3(x) = 5 2 x3 − 3 2 x.<br />

These are the Legendre polynomials; polynomials we first discussed <strong>in</strong> Gaussian quadrature,

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!