Measuring rates of convergence of numerical algorithms

DOI10.1007/BF00940703zbMath0790.65004OpenAlexW2035017188MaRDI QIDQ1321367

Jonathan Barzilai, Michael A. H. Dempster

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940703

zbMATH Keywords

convergence ratescomparison sequencesconsistent axiomatic structureconvergence rate measures

Mathematics Subject Classification ID

Convergence and divergence of series and sequences (40A05) Acceleration of convergence in numerical analysis (65B99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rates of convergence of a one-dimensional search based on interpolating polynomials
• Nonpolynomial and Inverse Interpolation for Line Search: Synthesis and Convergence Rates
• Line Search Techniques Based on Interpolating Polynomials using Function Values Only

This page was built for publication: Measuring rates of convergence of numerical algorithms