Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals

DOI10.1137/0720052zbMath0547.65028MaRDI QIDQ3339175

Yousef Saad

Publication date: 1983

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0720052

zbMATH Keywords

comparison; convergence; Chebyshev polynomials; orthogonal polynomials; Numerical experiments; indefinite symmetric linear systems; Lanczos algorithm; conjugate gradient; Chebyshev semi-iterative method; SYMMLQ algorithm; adaptive parameter estimation; conjugate residual methods; large invertible symmetric matrix; Rayleigh-Ritz type estimates

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

33C45: Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.)

65F10: Iterative numerical methods for linear systems

Related Items

Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method, On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices, An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK, A hybrid iterative method for symmetric indefinite linear systems, An adaptive Richardson iteration method for indefinite linear systems, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils, Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm, Orthogonal Polynomials on Several Intervals Via a Polynomial Mapping