Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era

DOI10.1016/j.mcm.2008.04.009zbMath1165.68300OpenAlexW2079513943MaRDI QIDQ2390176

Ravi P. Agarwal, Syamal K. Sen, Raffaella Pavani

Publication date: 21 July 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2008.04.009

zbMATH Keywords

supercomputerirrational numbersrational boundserror-free applicationpre-historic computing

Mathematics Subject Classification ID

Continued fraction calculations (number-theoretic aspects) (11Y65) History of numerical analysis (65-03) History of computer science (68-03) Error analysis and interval analysis (65G99)

Related Items (3)

A fast computation of the best \(k\)-digit rational approximation to a real number ⋮ Birth, growth and computation of pi to ten trillion digits ⋮ Zero-clusters of polynomials: best approach in supercomputing era

Cites Work

• A new polynomial-time algorithm for linear programming
• Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
• Golden ratio versus pi as random sequence sources for Monte Carlo integration
• Explicit Ramanujan-type approximations to pi of higher order
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Solving linear programming problems exactly
• The quest for pi
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
• Computational error and complexity in science and engineering
• Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions
• A variation on Karmarkar’s algorithm for solving linear programming problems
• On the rapid computation of various polylogarithmic constants
• Calculation of π to 100,000 Decimals
• The Arithmetic of the Digital Computer: A New Approach
• The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
• Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
• Fast Multiple-Precision Evaluation of Elementary Functions
• Computation of π Using Arithmetic-Geometric Mean
• A Spigot Algorithm for the Digits of &#960
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era