O'Reilly logo

Numerical Linear Algebra with Applications by William Ford

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Appendix C

Chebyshev Polynomials

Chebyshev polynomials have important uses in developing convergence results for algorithms; for instance, the analysis for the convergence of the conjugate gradient method in Chapter 21 can be done using these polynomials (see Ref. [1, pp. 312-316]). They also play a large role in convergence results for methods that compute eigenvalues of large sparse matrices (see Ref. [3, pp. 151-159]). There are additional applications to least-squares and interpolation. The book does not actually use Chebyshev polynomials in proofs, but the statement of certain theorems involve Chebyshev polynomials, and so we will give a brief overview of their definition and properties.

C.1 Definition

The definition begins with the form ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required