On Chebyshev Polynomials of Matrices

The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A. We study general properties of Chebyshev polynomials of matrices, which in some cases turn out to be generalizations of well known properties of Chebyshev polynomials of compact sets in the complex plane. We also derive explicit formulas of the Chebyshev polynomials of certain classes of matrices, and explore the relation between Chebyshev polynomials of one of these matrix classes and Chebyshev polynomials of lemniscatic regions in the complex plane. Key words. matrix approximation problems, Chebyshev polynomials, complex approximation theory, Krylov subspace methods, Arnoldi's method AMS subject classifications. 41A10, 15A60, 65F10

• Type: Journal
• Year: 2010
• Where: SIAMMAX
• Authors: Vance Faber, Jörg Liesen, Petr Tichý
• Keywords: Chebyshev Polynomials, Monic Polynomials, Mth Chebyshev Polynomial, SIAMMAX 2010