On the backward error incurred by the compact rational Krylov linearization
From MaRDI portal
Publication:1983568
DOI10.1007/s10915-021-01625-6zbMath1473.65045OpenAlexW3194346009MaRDI QIDQ1983568
Publication date: 10 September 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-021-01625-6
Chebyshev polynomialsorthogonal polynomialslinearizationLagrange interpolationbackward errorpolynomial eigenvalue problemNewton basisTaylor basis
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Uses Software
Cites Work
- A framework for analyzing nonlinear eigenproblems and parametrized linear systems
- Chebyshev interpolation for nonlinear eigenvalue problems
- A note on companion matrices
- Backward error and condition of polynomial eigenvalue problems
- Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
- Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization
- NLEVP
- Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants
- Tropical Scaling of Polynomial Matrices
- Backward Error of Polynomial Eigenproblems Solved by Linearization
- Linearization of matrix polynomials expressed in polynomial bases
- Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
- The nonlinear eigenvalue problem
- A new family of companion forms of polynomial matrices
- NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
- Algorithms for Hessenberg-Triangular Reduction of Fiedler Linearization of Matrix Polynomials
- Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
- Matrix Polynomials
- Vector Spaces of Linearizations for Matrix Polynomials