Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations

DOI10.1007/s00211-005-0595-4zbMath1072.65068OpenAlexW1976998625MaRDI QIDQ1780608

Luca Gemignani, Dario Andrea Bini, Pan, Victor Y.

Publication date: 13 June 2005

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-005-0595-4

zbMATH Keywords

algorithm eigenvalues companion matrices QR-factorization inverse power method polynomial and rational equations root-finder

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Inequalities involving derivatives and differential and integral operators (26D10)

Related Items

SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices, Computations with quasiseparable polynomials and matrices, A fast implicit QR eigenvalue algorithm for companion matrices, The amended DSeSC power method for polynomial root-finding, On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms, Fast algorithms for solving the inverse scattering problem for the Zakharov-Shabat system of equations and their applications, Some predictor-corrector-type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory, A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices, Singular matrices whose Moore-Penrose inverse is tridiagonal, Matrix computations and polynomial root-finding with preprocessing, Additive preconditioning and aggregation in matrix computations, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Matrix approach to solve polynomial equations, Polynomial algebra for Birkhoff interpolants, Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values, Low memory and low complexity iterative schemes for a nonsymmetric algebraic Riccati equation arising from transport theory, Computing the real roots of a Fourier series-plus-linear-polynomial: a Chebyshev companion matrix approach, Root-squaring with DPR1 matrices, Structured eigenvalue problems for rational Gauss quadrature, Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries, Fast QR factorization of Cauchy-like matrices, Neville elimination for rank-structured matrices, Eigen-solving via reduction to DPR1 matrices, Rational \(QR\)-iteration without inversion, Additive preconditioning, eigenspaces, and the inverse iteration, Solving secular and polynomial equations: a multiprecision algorithm, Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations, Randomized preprocessing of homogeneous linear systems of equations, New progress in real and complex polynomial root-finding, Implicit double shift \(QR\)-algorithm for companion matrices, Structured eigenvalue condition numbers for parameterized quasiseparable matrices, Fast QR iterations for unitary plus low rank matrices, A note on generalized companion pencils in the monomial basis, On the stability of computing polynomial roots via confederate linearizations, Fast algorithms for hierarchically semiseparable matrices, A multiple shift \(QR\)-step for structured rank matrices, A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices, The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs, Rank-Structured QR for Chebyshev Rootfinding, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems, An efficient method for computing the inverse of arrowhead matrices

Uses Software

Cites Work