On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm

DOI10.1137/080728299zbMath1190.41011OpenAlexW2025708756MaRDI QIDQ3561187

Petr Tichý, Jörg Liesen

Publication date: 25 May 2010

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

Full work available at URL: https://depositonce.tu-berlin.de//handle/11303/7286

zbMATH Keywords

GMRESmatrix functionsArnoldi's methodmatrix approximation problemsmatrix 2-normpolynomials in matrices

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Uniqueness of best approximation (41A52)

Related Items (6)

On the Forsythe conjecture ⋮ GMRES algorithms over 35 years ⋮ Orthogonality to matrix subspaces, and a distance formula ⋮ On the convergence rate of DGMRES ⋮ Evaluating non-analytic functions of matrices ⋮ A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems

Uses Software

• Eigtool

This page was built for publication: On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm