The Chebyshev Polynomials of a Matrix

DOI10.1137/S0895479896303739zbMath0922.65019OpenAlexW1997225065MaRDI QIDQ4243511

Kim-Chuan Toh, Lloyd N. Threfethen

Publication date: 18 May 1999

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479896303739

zbMATH Keywords

algorithmsemidefinite programmingpseudospectramatrix polynomialprimal-dual interior point methodKrylov subspace iterationChebyshev polynomial of a matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Iterative numerical methods for linear systems (65F10)

Related Items (11)

Variational analysis of the Ky Fan \(k\)-norm ⋮ Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming ⋮ New bisoliton solutions in dispersion managed systems ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Spectral operators of matrices ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ Stability analysis of flow of active extensile fibers in confined domains ⋮ Chebyshev approximation of log-determinants of spatial weight matrices ⋮ A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ Generalizations of the field of values useful in the study of polynomial functions of a matrix

This page was built for publication: The Chebyshev Polynomials of a Matrix