Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

DOI10.1002/NLA.1913zbMath1340.65059OpenAlexW1679305771MaRDI QIDQ5502428

Jose E. Roman, Daniel Kressner

Publication date: 26 August 2015

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/48638

zbMATH Keywords

algorithmlinearizationKrylov methodsArnoldi methodpolynomial eigenvalue problemChebyshev basiscompanion linearization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Matrix pencils (15A22)

Related Items (19)

A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error ⋮ Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems ⋮ Eigenvalue embedding problem for quadratic regular matrix polynomials with symmetry structures ⋮ A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation ⋮ Infinite GMRES for Parameterized Linear Systems ⋮ Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis ⋮ The nonlinear eigenvalue problem ⋮ Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach ⋮ Preconditioned Chebyshev BiCG method for parameterized linear systems ⋮ The Infinite Bi-Lanczos Method for Nonlinear Eigenvalue Problems ⋮ Krylov type methods for linear systems exploiting properties of the quadratic numerical range ⋮ On restarting the tensor infinite Arnoldi method ⋮ Stability Analysis of the Two-level Orthogonal Arnoldi Procedure ⋮ Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ Resolvent sampling based Rayleigh-Ritz method for large-scale nonlinear eigenvalue problems ⋮ Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc ⋮ Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems ⋮ The Waveguide Eigenvalue Problem and the Tensor Infinite Arnoldi Method

Uses Software

• NLEVP
• ARPACK
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Chebyshev interpolation for nonlinear eigenvalue problems
• A boundary element method for the Dirichlet eigenvalue problem of the Laplace operator
• A block Newton method for nonlinear eigenvalue problems
• An SVD-approach to Jacobi-Davidson solution of nonlinear Helmholtz eigenvalue problems
• Matrix Algorithms
• A Krylov--Schur Algorithm for Large Eigenproblems
• NLEVP
• SLEPc
• Continuation of Invariant Subspaces for Parameterized Quadratic Eigenvalue Problems
• Linearization of matrix polynomials expressed in polynomial bases
• The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• ARPACK Users' Guide
• A Rational Krylov Method Based on Hermite Interpolation for Nonlinear Eigenvalue Problems
• SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Localization Theorems for Nonlinear Eigenvalue Problems
• Vector Spaces of Linearizations for Matrix Polynomials
• The Conditioning of Linearizations of Matrix Polynomials
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• Model-order reduction of large-scalekth-order linear dynamical systems via akth-order Arnoldi method

This page was built for publication: Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis