Multiple-correction and Faster Approximation
Xiaodong Cao, Hongmin Xu, Xu You
TL;DR
This paper introduces a multiple-correction method to enhance convergence speed, providing improved sequences for approximating Euler-Mascheroni and Landau constants over traditional methods.
Contribution
The paper presents a novel multiple-correction approach that accelerates convergence in approximating important mathematical constants.
Findings
Faster convergence sequences for Euler-Mascheroni constant
Improved approximation sequences for Landau constant
Demonstrated superiority over classical methods
Abstract
In this paper, we formulate a new \emph{multiple-correction method}. The goal is to accelerate the rate of convergence. In particular, we construct some sequences to approximate the Euler-Mascheroni and Landau constants, which are faster than the classical approximations in literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Mathematical Inequalities and Applications · Matrix Theory and Algorithms