Anderson-Björck for linear sequences

Author:
Richard F. King

Journal:
Math. Comp. **41** (1983), 591-596

MSC:
Primary 65B99

DOI:
https://doi.org/10.1090/S0025-5718-1983-0717729-6

MathSciNet review:
717729

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: The proposed one-point method for finding the limit of a slowly converging linear sequence features an Anderson-Björck extrapolation step that had previously been applied to the Regula Falsi problem. Convergence is of order 1.839 as compared to for the well-known Aitken-Steffensen -process, and to 1.618 for another one-point extrapolation procedure of King. There are examples for computing a polynomial's mutiple root with Newton's method and for finding a fixed point of a nonlinear function.

**[1]**A. C. Aitken, "On Bernoulli's numerical solution of algebraic equations,"*Proc. Roy. Soc. Edinburgh*, v. 46, 1926, pp. 289-305.**[2]**N. Anderson & A. Björck, "A new high order method of Regula Falsi type for computing a root of an equation,"*BIT*, v. 13, 1973, pp. 253-264. MR**0339474 (49:4233)****[3]**H. Esser, "Eine stets quadratisch konvergente Modifikation des Steffensen-Verfahrens."*Computing*, v. 14, 1975, pp. 367-369. MR**0413468 (54:1582)****[4]**A. S. Householder,*The Numerical Treatment of a Single Nonlinear Equation*, McGraw-Hill, New York, 1970. MR**0388759 (52:9593)****[5]**R. F. King, "A secant method for multiple roots,"*BIT*, v. 17, 1977, pp. 321-328. MR**0488699 (58:8217)****[6]**R. F. King, "An extrapolation method of order four for linear sequences,"*SIAM J. Numer. Anal.*, v. 16, 1979, pp. 719-725. MR**543964 (80f:65051)****[7]**R. F. King, "An efficient one-point extrapolation method for linear convergence,"*Math. Comp.*, v. 35, 1980, pp. 1285-1290. MR**583505 (82b:65004)****[8]**D. E. Muller, "A method for solving algebraic equations using an automatic computer,"*Math. Comp.*, v. 10, 1956, pp. 208-215. MR**0083822 (18:766e)****[9]**A. M. Ostrowski,*Solution of Equations and Systems of Equations*, 2nd ed., Academic Press, New York, 1966. MR**0216746 (35:7575)****[10]**J. F. Steffensen, "Remarks on iteration,"*Skandinavisk Aktuarietidskrift*, v. 16, 1933, pp. 64-72.**[11]**J. F. Traub,*Iterative Methods for the Solution of Equations*, Prentice-Hall, Englewood Cliffs, N. J., 1964. MR**0169356 (29:6607)****[12]**H. Van de Vel, "A method for computing a root of a single nonlinear equation, including its multiplicity,"*Computing*, v. 14, 1975, pp. 167-171. MR**0403205 (53:7017)**

Retrieve articles in *Mathematics of Computation*
with MSC:
65B99

Retrieve articles in all journals with MSC: 65B99

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1983-0717729-6

Keywords:
Linear convergence,
extrapolation,
Aitken's -process,
Steffensen,
Anderson-Björck,
efficiency,
nonlinear equation,
order of convergence,
Regula Falsi,
linear sequence

Article copyright:
© Copyright 1983
American Mathematical Society