Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Anderson-Björck for linear sequences
HTML articles powered by AMS MathViewer

by Richard F. King PDF
Math. Comp. 41 (1983), 591-596 Request permission

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 $\sqrt 2$ for the well-known Aitken-Steffensen ${\delta ^2}$-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.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65B99
  • Retrieve articles in all journals with MSC: 65B99
Additional Information
  • © Copyright 1983 American Mathematical Society
  • Journal: Math. Comp. 41 (1983), 591-596
  • MSC: Primary 65B99
  • DOI: https://doi.org/10.1090/S0025-5718-1983-0717729-6
  • MathSciNet review: 717729