A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
From MaRDI portal
Publication:351474
DOI10.1007/s13160-013-0109-1zbMath1268.65050OpenAlexW1972459563MaRDI QIDQ351474
Qiang Niu, Xiang Wang, Yong-ming Nie, Lin-Zhang Lu
Publication date: 11 July 2013
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-013-0109-1
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (2)
Block subspace projection preconditioned conjugate gradient method in modal structural analysis ⋮ A modified second-order Arnoldi method for solving the quadratic eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- A refined Arnoldi type method for large scale eigenvalue problems
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Matrix Algorithms
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- ARPACK Users' Guide
- Templates for the Solution of Algebraic Eigenvalue Problems
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- Algorithm 827
- Algorithm 845
- The Rotation of Eigenvectors by a Perturbation. III
This page was built for publication: A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
