Backward Error of Polynomial Eigenproblems Solved by Linearization
From MaRDI portal
Publication:3537445
DOI10.1137/060663738zbMath1159.65042OpenAlexW2022838696WikidataQ56998748 ScholiaQ56998748MaRDI QIDQ3537445
Françoise Tisseur, Ren-Cang Li, Nicholas J. Higham
Publication date: 6 November 2008
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://eprints.maths.manchester.ac.uk/996/1/hlt07.pdf
linearizationeigenvectorscalingquadratic eigenvalue problemmatrix polynomialbackward error analysismatrix pencilpolynomial eigenvalue problem
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12) Matrix pencils (15A22)
Related Items (46)
Block Kronecker linearizations of matrix polynomials and their backward errors ⋮ A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error ⋮ First order spectral perturbation theory of square singular matrix polynomials ⋮ An Algorithm for the Complete Solution of the Quartic Eigenvalue Problem ⋮ Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants ⋮ Linearizations of matrix polynomials in Newton bases ⋮ THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM ⋮ The inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergence ⋮ Unnamed Item ⋮ Structured perturbation analysis of sparse matrix pencils with \(s\)-specified eigenpairs ⋮ Constructing Strong Linearizations of Matrix Polynomials Expressed in Chebyshev Bases ⋮ Backward error bounds for polynomial eigenvalue problem solved by a Rayleigh-Ritz type contour integral-based eigensolver ⋮ The \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomials ⋮ A Padé approximate linearization algorithm for solving the quadratic eigenvalue problem with low-rank damping ⋮ Structured strong linearizations from Fiedler pencils with repetition. I. ⋮ Parallel iterative refinement in polynomial eigenvalue problems ⋮ Structural backward stability in rational eigenvalue problems solved via block Kronecker linearizations ⋮ On backward errors of structured polynomial eigenproblems solved by structure preserving linearizations ⋮ Fiedler companion linearizations for rectangular matrix polynomials ⋮ New backward error bounds of Rayleigh–Ritz projection methods for quadratic eigenvalue problem ⋮ Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree ⋮ Implicitly Restarted Refined Partially Orthogonal Projection Method with Deflation ⋮ Stability of rootfinding for barycentric Lagrange interpolants ⋮ Backward error analysis of linearizing-balancing strategies for heavily damped quadratic eigenvalue problem ⋮ On the backward error incurred by the compact rational Krylov linearization ⋮ Eigenvectors and minimal bases for some families of Fiedler-like linearizations ⋮ Polynomial eigenvalue solver based on tropically scaled Lagrange linearization ⋮ Sylvester-based preconditioning for the waveguide eigenvalue problem ⋮ Perturbation, extraction and refinement of invariant pairs for matrix polynomials ⋮ A framework for analyzing nonlinear eigenproblems and parametrized linear systems ⋮ Structured eigenvalue condition numbers and linearizations for matrix polynomials ⋮ Structured backward error analysis for sparse polynomial eigenvalue problems ⋮ Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization ⋮ Conditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformations ⋮ Localization Theorems for Nonlinear Eigenvalue Problems ⋮ Backward error and conditioning of Fiedler companion linearizations ⋮ Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc ⋮ A Fast Algorithm For Fast Train Palindromic Quadratic Eigenvalue Problems ⋮ On the conditioning for heavily damped quadratic eigenvalue problem solved by linearizations ⋮ A novel method to compute all eigenvalues of the polynomial eigenvalue problems in an open half plane ⋮ The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs ⋮ Backward errors for eigenvalues and eigenvectors of Hermitian, skew-Hermitian,H-even andH-odd matrix polynomials ⋮ Improving the numerical stability of the Sakurai-Sugiura method for quadratic eigenvalue problems ⋮ Tropical Roots as Approximations to Eigenvalues of Matrix Polynomials ⋮ Algorithms for Hessenberg-Triangular Reduction of Fiedler Linearization of Matrix Polynomials ⋮ On why using \(\mathbb{DL}(P)\) for the symmetric polynomial eigenvalue problem might need to be reconsidered
Uses Software
This page was built for publication: Backward Error of Polynomial Eigenproblems Solved by Linearization
