A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices

DOI10.1007/BF01388686zbMath0791.65020MaRDI QIDQ1326400

Miloud Sadkane

Publication date: 7 July 1994

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133702

zbMATH Keywords

numerical resultseigenvaluesparallel computationeigenvectorssparse matricesChebyshev iterationArnoldi's method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items

Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems ⋮ A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ A block incomplete orthogonalization method for large nonsymmetric eigenproblems ⋮ A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method ⋮ Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems ⋮ A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems ⋮ Ritz and pseudo-Ritz values using matrix polynomials ⋮ Arnoldi-Riccati method for large eigenvalue problems ⋮ A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems ⋮ A sparse nonsymmetric eigensolver for distributed memory architectures ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ GMRES with multiple preconditioners ⋮ Numerical solution of linear eigenvalue problems ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ Block Krylov-Schur method for large symmetric eigenvalue problems ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems ⋮ An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems ⋮ A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems ⋮ On the stability of large matrices ⋮ A priori error bounds on invariant subspace approximations by block Krylov subspaces

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• The Tchebychev iteration for nonsymmetric linear systems
• Large-scale complex eigenvalue problems
• Tchebychev acceleration technique for large scale nonsymmetric matrices
• Computational aspects of F. L. Bauer's simultaneous iteration method
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Sparse matrix test problems
• A Simultaneous Iteration Algorithm for Real Matrices
• The principle of minimized iterations in the solution of the matrix eigenvalue problem