A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
From MaRDI portal
Publication:611385
Recommendations
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- Multiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
- A refined Arnoldi type method for large scale eigenvalue problems
- Arnoldi-Riccati method for large eigenvalue problems
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- scientific article; zbMATH DE number 4070184
Cites work
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- 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
- A Power–Arnoldi algorithm for computing PageRank
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A refined subspace iteration algorithm for large sparse eigenproblems
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
- Adaptive projection subspace dimension for the thick-restart Lanczos method
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- Augmented block Householder Arnoldi method
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- GMRES with Deflated Restarting
- scientific article; zbMATH DE number 1507134 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Restarted block-GMRES with deflation of eigenvalues
- Templates for the Solution of Algebraic Eigenvalue Problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(16)- A shifted block FOM algorithm with deflated restarting for matrix exponential computations
- A refined Arnoldi type method for large scale eigenvalue problems
- A modified second-order Arnoldi method for solving the quadratic eigenvalue problems
- On a new variant of Arnoldi method for approximation of eigenpairs
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
- Rayleigh quotient minimization method for symmetric eigenvalue problems
- A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Block algorithms with augmented Rayleigh-Ritz projections for large-scale eigenpair computation
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- scientific article; zbMATH DE number 5232223 (Why is no real title available?)
- Multiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
- Deflated and restarted Krylov subspace methods for Sylvester tensor equations
- Deflated block Krylov subspace methods for large scale eigenvalue problems
This page was built for publication: A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611385)
