Structured backward errors in linearizations
From MaRDI portal
Publication:822680
DOI10.1553/etna_vol54s420zbMath1470.65093arXiv1912.04157OpenAlexW3171272432MaRDI QIDQ822680
Leonardo Robol, Vanni Noferini, Raf Vandebril
Publication date: 23 September 2021
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.04157
Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of roots of polynomial equations (65H04)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on companion matrices
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Stability of rootfinding for barycentric Lagrange interpolants
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization
- Backward stability of polynomial root-finding using Fiedler companion matrices
- On the stability of computing polynomial roots via confederate linearizations
- Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- MPFR
- Core-Chasing Algorithms for the Eigenvalue Problem
- Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- Polynomial Roots from Companion Matrix Eigenvalues
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast Hessenberg Reduction of Some Rank Structured Matrices
- Vector Spaces of Linearizations for Matrix Polynomials
- The Matrix Eigenvalue Problem
This page was built for publication: Structured backward errors in linearizations
