The infinite Lanczos method for symmetric nonlinear eigenvalue problems
DOI10.1007/s10092-023-00511-xOpenAlexW2905178109MaRDI QIDQ2693970
Publication date: 24 March 2023
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.07557
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonlinear eigenvalue problems and nonlinear spectral theory for PDEs (35P30) Eigenvalues, singular values, and eigenvectors (15A18) Nonlinear spectral theory, nonlinear eigenvalue problems (47J10) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structured strong linearizations from Fiedler pencils with repetition. I.
- An integral method for solving nonlinear eigenvalue problems
- A linear eigenvalue algorithm for the nonlinear eigenvalue problem
- Restarting iterative projection methods for Hermitian nonlinear eigenvalue problems with minmax property
- Chebyshev interpolation for nonlinear eigenvalue problems
- Structured strong linearizations from Fiedler pencils with repetition. II
- A boundary element method for the Dirichlet eigenvalue problem of the Laplace operator
- Applications of the Lanczos method
- A fast eigenvalue algorithm for Hankel matrices
- A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
- An Arnoldi method for nonlinear eigenvalue problems
- Polynomial eigenvalue problems with Hamiltonian structure
- Block Kronecker ansatz spaces for matrix polynomials
- Use of indefinite pencils for computing damped natural modes
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils
- Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization
- Robust Successive Computation of Eigenpairs for Nonlinear Eigenvalue Problems
- Julia: A Fresh Approach to Numerical Computing
- Solving Rational Eigenvalue Problems via Linearization
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- Fiedler Companion Linearizations and the Recovery of Minimal Indices
- Deflated and Restarted Symmetric Lanczos Methods for Eigenvalues and Linear Equations with Multiple Right-Hand Sides
- Improving the numerical stability of the Sakurai-Sugiura method for quadratic eigenvalue problems
- Computational Methods for Linear Matrix Equations
- NLEVP
- The Lanczos Algorithm With Partial Reorthogonalization
- SLEPc
- Linearization of matrix polynomials expressed in polynomial bases
- The Lanczos Algorithm with Selective Orthogonalization
- Templates for the Solution of Algebraic Eigenvalue Problems
- A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems
- The nonlinear eigenvalue problem
- A new family of companion forms of polynomial matrices
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems
- NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
- Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
- The Waveguide Eigenvalue Problem and the Tensor Infinite Arnoldi Method
- Stability and Stabilization of Time-Delay Systems
- Matrix Polynomials
- A Framework for Structured Linearizations of Matrix Polynomials in Various Bases
- The Infinite Bi-Lanczos Method for Nonlinear Eigenvalue Problems
- Vector Spaces of Linearizations for Matrix Polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Symmetric Linearizations for Matrix Polynomials
This page was built for publication: The infinite Lanczos method for symmetric nonlinear eigenvalue problems
