Pages that link to "Item:Q1326400"
From MaRDI portal
The following pages link to A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices (Q1326400):
Displayed 14 items.
- Block Krylov-Schur method for large symmetric eigenvalue problems (Q925250) (← links)
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems (Q1299851) (← links)
- On the stability of large matrices (Q1300772) (← links)
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems (Q1326401) (← links)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems (Q1377506) (← links)
- A priori error bounds on invariant subspace approximations by block Krylov subspaces (Q1611877) (← links)
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems (Q1827036) (← links)
- A block incomplete orthogonalization method for large nonsymmetric eigenproblems (Q1907872) (← links)
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems (Q1916981) (← links)
- Ritz and pseudo-Ritz values using matrix polynomials (Q1923177) (← links)
- Arnoldi-Riccati method for large eigenvalue problems (Q1923879) (← links)
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems (Q2372934) (← links)
- A sparse nonsymmetric eigensolver for distributed memory architectures (Q3499023) (← links)