Lower Bounds and Fast Algorithms for Sequence Acceleration

DOI10.1145/62.66zbMATH Open0628.65002OpenAlexW2070848133MaRDI QIDQ3765099FDOQ3765099

Authors: G. M. Trojan 

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/62.66

zbMATH Keywords

iterative methodsoptimal algorithmsupper and lower boundssequence accelerating

Mathematics Subject Classification ID

Extrapolation to the limit, deferred corrections (65B05)

Cited In (2)

• Asymptotic near optimality of the bisection method
• An acceleration property of the \(E\)-algorithm for alternate sequences

This page was built for publication: Lower Bounds and Fast Algorithms for Sequence Acceleration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765099)