Max-min properties of matrix factor norms
SIAM Journal on Scientific Computing
GMRES/CR and Arnoldi/Lanczos as matrix approximation problems
SIAM Journal on Scientific Computing
SIAM Journal on Matrix Analysis and Applications
The Chebyshev Polynomials of a Matrix
SIAM Journal on Matrix Analysis and Applications
On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
SIAM Journal on Matrix Analysis and Applications
| Hi-index | 0.00 |
The $m$th 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.