Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems

DOI10.1007/BF02425912zbMath0859.65031MaRDI QIDQ1916981

Miloud Sadkane, Vincent Heuveline

Publication date: 14 July 1996

Published in: Reliable Computing (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesRitz valuesblock Arnoldi algorithmRitz vectorsChebyshev accelerationlarge non-Hermitian matrixOrr-Sommerfeld operatorHarwell-Boeing collection

Mathematics Subject Classification ID

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

Related Items (2)

Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ On the stability of large matrices

Cites Work

• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• Chebyshev polynomials are not always optimal
• The Tchebychev iteration for nonsymmetric linear systems
• Large-scale complex eigenvalue problems
• A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
• Tchebychev acceleration technique for large scale nonsymmetric matrices
• Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
• Sparse matrix test problems
• Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Unnamed Item

This page was built for publication: Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems