Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
Authors:
- Carl de BoorCBCarl de Boor
- John R. RiceJRJohn R. Rice
- 1 March 1982
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 3 (1) , 47-57
Abstract
The application of Richardson iteration to a symmetric, but indefinite linear system requires certain parameters which can be determined from the zeros in the error of a certain best polynomial approximant on some set S known to contain the spectrum of the coefficient matrix. It is pointed out that this error can also be obtained as a multiple of the extremal polynomial for the linear functional $p \mapsto p(0)$, and this leads to an efficient Remes type algorithm for its determination. A program incorporating this algorithm for the case that S consists of two or more intervals bracketing zero is available.
Keywords
This publication has 4 references indexed in Scilit:
- Solution of Sparse Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1975
- Extremal polynomials associated with a system of curves in the complex planeAdvances in Mathematics, 1969
- Convergence Problems in Maehly's Second Method: Part IIJournal of the ACM, 1966
- Methods for Fitting Rational Approximations, Parts II and IIIJournal of the ACM, 1963