Tchebychev acceleration technique for large scale nonsymmetric matrices
From MaRDI portal
Publication:1825594
DOI10.1007/BF01405199zbMath0684.65032MaRDI QIDQ1825594
Publication date: 1990
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133424
convergence accelerationChebyshev iterationselected eigenvaluesnon- symmetric matricesoptimal Chebyshev parameters
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items
A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices, Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, A block incomplete orthogonalization method for large nonsymmetric eigenproblems, 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, Arnoldi-Riccati method for large eigenvalue problems
Cites Work
- Unnamed Item
- 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
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
- The Tchebychev iteration for nonsymmetric linear systems
- Computational aspects of F. L. Bauer's simultaneous iteration method
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
- Lanczos versus subspace iteration for solution of eigenvalue problems
- Simultaneous Iteration for Partial Eigensolution of Real Matrices
- Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- A Simultaneous Iteration Method for the Unsymmetric Eigenvalue Problem