Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems
From MaRDI portal
Publication:727890
DOI10.1007/s10543-016-0601-5zbMath1355.65057OpenAlexW2265325209MaRDI QIDQ727890
Publication date: 21 December 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/81254
numerical examplesquadratic eigenvalue problemindefinite Gram-Schmidtpseudo-LanczosQ-Arnoldithick-restart
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (3)
Refined isogeometric analysis of quadratic eigenvalue problems ⋮ Thick-restarted joint Lanczos bidiagonalization for the GSVD ⋮ Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
Uses Software
Cites Work
- Unnamed Item
- An indefinite variant of LOBPCG for definite matrix pencils
- Solving large-scale quadratic eigenvalue problems with Hamiltonian eigenstructure using a structure-preserving Krylov subspace method
- Nested Lanczos: Implicitly restarting an unsymmetric Lanczos algorithm
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- SHIRRA: a refined variant of SHIRA for the skew-Hamiltonian/Hamiltonian (SHH) pencil eigenvalue problem
- Use of indefinite pencils for computing damped natural modes
- Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils
- The Quadratic Eigenvalue Problem
- A Krylov--Schur Algorithm for Large Eigenproblems
- Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc
- NLEVP
- Linearization of regular matrix polynomials
- SLEPc
- The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
- Templates for the Solution of Algebraic Eigenvalue Problems
- Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- The Matrix Eigenvalue Problem
- Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis
This page was built for publication: Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems