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

DOI10.1002/NLA.1913MaRDI QIDQ5502428zbMATH OpenOpenAlexFDO

Authors Daniel Kressner, J. E. Roman

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

algorithmArnoldi methodChebyshev basiscompanion linearizationKrylov methodslinearizationpolynomial eigenvalue problem

Mathematics Subject Classification ID

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

Recommendations

• The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Arnoldi-Faber method for large non Hermitian eigenvalue problems
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Implicitly restarted two-level orthogonal Arnoldi algorithms

Cites work

• A block Newton method for nonlinear eigenvalue problems
• A boundary element method for the Dirichlet eigenvalue problem of the Laplace operator
• A framework for analyzing nonlinear eigenproblems and parametrized linear systems
• A Krylov--Schur algorithm for large eigenproblems
• A rational Krylov method based on Hermite interpolation for nonlinear eigenvalue problems
• An SVD-approach to Jacobi-Davidson solution of nonlinear Helmholtz eigenvalue problems
• Approximation theory and approximation practice
• ARPACK Users' Guide
• Chebyshev interpolation for nonlinear eigenvalue problems
• Continuation of invariant subspaces for parameterized quadratic eigenvalue problems
• scientific article; zbMATH DE number 3110365 (Why is no real title available?)
• Linearization of matrix polynomials expressed in polynomial bases
• Localization Theorems for Nonlinear Eigenvalue Problems
• Matrix algorithms. Vol. 2: Eigensystems
• Model-order reduction of large-scale kth-order linear dynamical systems via a kth-order Arnoldi method
• NLEVP, a collection of nonlinear eigenvalue problems
• Perturbation, extraction and refinement of invariant pairs for matrix polynomials
• SLEPc
• SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Structured eigenvalue condition numbers and linearizations for matrix polynomials
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• The Conditioning of Linearizations of Matrix Polynomials
• The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Vector Spaces of Linearizations for Matrix Polynomials

Cited in

(21)

• 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
• On restarting the tensor infinite Arnoldi method
• A survey on variational characterizations for nonlinear eigenvalue problems
• A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation
• Krylov type methods for linear systems exploiting properties of the quadratic numerical range
• Resolvent sampling based Rayleigh-Ritz method for large-scale nonlinear eigenvalue problems
• Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis
• Eigenvalue embedding problem for quadratic regular matrix polynomials with symmetry structures
• Stability analysis of the two-level orthogonal Arnoldi procedure
• Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
• Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
• The nonlinear eigenvalue problem
• Infinite GMRES for parameterized linear systems
• Compact rational Krylov methods for nonlinear eigenvalue problems
• The waveguide eigenvalue problem and the tensor infinite Arnoldi method
• The infinite bi-Lanczos method for nonlinear eigenvalue problems
• Preconditioned Chebyshev BiCG method for parameterized linear systems
• Chebyshev HOPGD with sparse grid sampling for parameterized linear systems
• Improving performance of contour integral-based nonlinear eigensolvers with infinite GMRES
• Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems

Describes a project that uses

Uses Software

• Matlab
• NLEVP
• ARPACK
• SLEPc

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502428)