Deflated block Krylov subspace methods for large scale eigenvalue problems
The aim of the paper is to study a class of deflated block Krylov subspace methods, for solving large scale matrix eigenvalue problems, techniques which are different from conventional block Krylov subspace methods in the way of generating the approximate subspaces. The first section is of introductory nature. The second section briefly recalls the concept of block Krylov subspace and related procedures for solving large scale eigenvalue problems, giving then a brief introduction of the deflated block Krylov subspace. The authors also present an Arnoldi-type algorithm which can accomplished the orthogonalization procedure presented above. The third section deals with some deflated Krylov subspace methods for solving large scale eigenvalue problems; particularly, an Arnoldi-type method and its refined variant will be outlined and compared. The authors prove in this section that due to deflation, approximate subspaces constructed by the new method have similar properties to ones constructed by the implicitly restarted Arnoldi method, or the restarted Arnoldi methods augmented with approximate eigenvectors. The new methods preserve the superiorities of regular block Krylov subspace methods and regular Krylov subspace methods augmented with approximate eigenvectors. In the fourth section, the authors present seven numerical examples computed by the Arnoldi-type method and its refined variant. These examples demonstrate the efficiency of the presented methods for computing partial or nearly clustered eigenvalues of large matrices. Also, the test results show that the refined variant can improve the performance of the Arnoldi-type method in computing partial eigenvalues of large matrices.
- Block Krylov-Schur method for large symmetric eigenvalue problems
- A refined Arnoldi type method for large scale eigenvalue problems
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
- A Krylov--Schur algorithm for large eigenproblems
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Lanczos-type method for multiple starting vectors
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- A symmetric band Lanczos process based on coupled recurrences and some applications
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
- ARPACK Users' Guide
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Generalized block Lanczos methods for large unsymmetric eigenproblems
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 5232223 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Krylov-subspace methods for reduced-order modeling in circuit simulation
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Restarted block-GMRES with deflation of eigenvalues
- Sparse matrix test problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- The block grade of a block Krylov space
- The Lanczos Algorithm With Partial Reorthogonalization
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Deflation in Krylov subspace methods and distance to uncontrollability
- Extracting partial canonical structure for large scale eigenvalue problems
- A method of indefinite Krylov subspace for eigenvalue problem
- scientific article; zbMATH DE number 5772902 (Why is no real title available?)
- Block eigenvectors obtained by block Hotelling deflation
- Deflated Krylov Iterations in Domain Decomposition Methods
- Implicitly restarted refined partially orthogonal projection method with deflation
- A refined shifted block inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- Block Krylov-Schur method for large symmetric eigenvalue problems
Uses Software
This page was built for publication: Deflated block Krylov subspace methods for large scale eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966072)
