A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
From MaRDI portal
Publication:611385
DOI10.1016/j.camwa.2010.05.034zbMath1201.65053OpenAlexW2037517972MaRDI QIDQ611385
Publication date: 14 December 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.05.034
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (11)
A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ A shifted block FOM algorithm with deflated restarting for matrix exponential computations ⋮ Deflated and restarted Krylov subspace methods for Sylvester tensor equations ⋮ A refined Arnoldi type method for large scale eigenvalue problems ⋮ On a new variant of Arnoldi method for approximation of eigenpairs ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ A modified second-order Arnoldi method for solving the quadratic eigenvalue problems ⋮ Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations ⋮ Rayleigh quotient minimization method for symmetric eigenvalue problems ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restarted block-GMRES with deflation of eigenvalues
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Augmented block Householder Arnoldi method
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- A refined subspace iteration algorithm for large sparse eigenproblems
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Matrix Algorithms
- Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method
- A Power–Arnoldi algorithm for computing PageRank
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Templates for the Solution of Algebraic Eigenvalue Problems
- GMRES with Deflated Restarting
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
