On the application of orthogonal polynomials to the iterative solution of linear systems of equations with indefinite or non-Hermitian matrices

DOI10.1016/0024-3795(87)90116-9zbMath0621.65018MaRDI QIDQ1090062

Lothar Reichel, William B. Gragg

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90116-9

zbMATH Keywords

rate of convergence; orthogonal polynomials; relaxation methods; Numerical examples; large linear systems

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

Related Items

The application of Leja points to Richardson iteration and polynomial preconditioning, Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces, An optimum iterative method for solving any linear system with a square matrix, On semiiterative methods generated by Faber polynomials, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Richardson's iteration for nonsymmetric matrices
• The analysis of k-step iterative methods for linear systems from summability theory
• The Tchebychev iteration for nonsymmetric linear systems
• Matrix eigensystem routines - EISPACK guide
• Extremal polynomials associated with a system of curves in the complex plane
• Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals
• On the Construction of Semi-Iterative Methods
• Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
• On Generating Orthogonal Polynomials
• FUNDAMENTAL PROPERTIES OF POLYNOMIALS ORTHOGONAL ON A CONTOUR