Deflated block Krylov subspace methods for large scale eigenvalue problems
From MaRDI portal
Publication:966072
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 5232223 (Why is no real title available?)
- 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 Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- A symmetric band Lanczos process based on coupled recurrences and some applications
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- ARPACK Users' Guide
- An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
- An analysis of the Rayleigh-Ritz method for approximating eigenspaces
- 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
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- 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 Lanczos Algorithm With Partial Reorthogonalization
- The block grade of a block Krylov space
- 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
Cited in
(9)- A refined shifted block inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- scientific article; zbMATH DE number 5772902 (Why is no real title available?)
- Implicitly restarted refined partially orthogonal projection method with deflation
- Deflated Krylov Iterations in Domain Decomposition Methods
- Deflation in Krylov subspace methods and distance to uncontrollability
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Block eigenvectors obtained by block Hotelling deflation
- Extracting partial canonical structure for large scale eigenvalue problems
- A method of indefinite Krylov subspace for eigenvalue problem
Describes a project that uses
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)
