Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems

DOI10.1007/BF01388687zbMath0791.65021MaRDI QIDQ1326401

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/133703

zbMATH Keywords

convergencenumerical testsDavidson methodblock-Arnoldi methodChebyshev iterationsrestartinglarge sparse unsymmetric matricesleading eigenpairs

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

On block minimal residual methods ⋮ A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ A block incomplete orthogonalization method for large nonsymmetric eigenproblems ⋮ BACKWARD PERTURBATION ANALYSIS AND RELATIVE ALGORITHMS FOR NONSYMMETRIC LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES ⋮ A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems ⋮ Arnoldi-Riccati method for large eigenvalue problems ⋮ Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems ⋮ A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems ⋮ Stein implicit Runge-Kutta methods with high stage order for large-scale ordinary differential equations ⋮ Low complexity matrix projections preserving actions on vectors ⋮ GMRES with multiple preconditioners ⋮ Block Krylov-Schur method for large symmetric eigenvalue problems ⋮ A fully adaptive rational global Arnoldi method for the model-order reduction of second-order MIMO systems with proportional damping ⋮ A subspace preconditioning algorithm for eigenvector/eigenvalue computation ⋮ Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations ⋮ Deflated block Krylov subspace methods for large scale eigenvalue problems ⋮ Projection methods for large Lyapunov matrix equations ⋮ Convergence properties of some block Krylov subspace methods for multiple linear systems ⋮ Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems ⋮ Efficient solution of the simplified \(P_N\) equations ⋮ Shape optimization towards stability in constrained hydrodynamic systems ⋮ An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Convergence properties of block GMRES and matrix polynomials ⋮ Smoothing iterative block methods for linear systems with multiple right-hand sides ⋮ A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems ⋮ A block varaint of the GMRES method for unsymmetric linear systems ⋮ The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action

Uses Software

• eigs
• Harwell-Boeing sparse matrix collection
• IRAM

Cites Work

• Unnamed Item
• Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
• Tchebychev acceleration technique for large scale nonsymmetric matrices
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Sparse matrix test problems
• The Davidson Method
• On the Automatic Scaling of Matrices for Gaussian Elimination