Best k-digit rational bounds for irrational numbers: pre- and super-computer era
DOI10.1016/J.MCM.2008.04.009zbMATH Open1165.68300OpenAlexW2079513943MaRDI QIDQ2390176FDOQ2390176
Syamal K. Sen, Ravi P. Agarwal, 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
Recommendations
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
- A fast computation of the best \(k\)-digit rational approximation to a real number
- Some numerical results on best uniform rational approximation of \(x^ \alpha\) on [0,1]
- Approximating Rational Numbers by Fractions
- scientific article; zbMATH DE number 3992807
History of numerical analysis (65-03) Error analysis and interval analysis (65G99) History of computer science (68-03) Continued fraction calculations (number-theoretic aspects) (11Y65)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
- Title not available (Why is that?)
- The quest for pi
- The Arithmetic of the Digital Computer: A New Approach
- Title not available (Why is that?)
- Fast Multiple-Precision Evaluation of Elementary Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the rapid computation of various polylogarithmic constants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
- Solving linear programming problems exactly
- Computational error and complexity in science and engineering
- Title not available (Why is that?)
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Computation of π Using Arithmetic-Geometric Mean
- Title not available (Why is that?)
- Title not available (Why is that?)
- Explicit Ramanujan-type approximations to pi of higher order
- Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions
- Title not available (Why is that?)
- Calculation of π to 100,000 Decimals
- Title not available (Why is that?)
- A Spigot Algorithm for the Digits of π
- The origin and history of mathematics
- 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
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
- Zero-clusters of polynomials: best approach in supercomputing era
- A fast computation of the best \(k\)-digit rational approximation to a real number
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
- Birth, growth and computation of pi to ten trillion digits
This page was built for publication: Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390176)
