Best k-digit rational bounds for irrational numbers: pre- and super-computer era
From MaRDI portal
Publication:2390176
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
Cites work
- scientific article; zbMATH DE number 2184875 (Why is no real title available?)
- scientific article; zbMATH DE number 2130172 (Why is no real title available?)
- scientific article; zbMATH DE number 3115468 (Why is no real title available?)
- scientific article; zbMATH DE number 3874496 (Why is no real title available?)
- scientific article; zbMATH DE number 4146016 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3501240 (Why is no real title available?)
- scientific article; zbMATH DE number 596022 (Why is no real title available?)
- scientific article; zbMATH DE number 1998962 (Why is no real title available?)
- scientific article; zbMATH DE number 2169896 (Why is no real title available?)
- scientific article; zbMATH DE number 6438440 (Why is no real title available?)
- scientific article; zbMATH DE number 3331337 (Why is no real title available?)
- scientific article; zbMATH DE number 3349749 (Why is no real title available?)
- scientific article; zbMATH DE number 3083462 (Why is no real title available?)
- A Spigot Algorithm for the Digits of π
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
- Calculation of π to 100,000 Decimals
- Computation of π Using Arithmetic-Geometric Mean
- Computational error and complexity in science and engineering
- Explicit Ramanujan-type approximations to pi of higher order
- Fast Multiple-Precision Evaluation of Elementary Functions
- Golden ratio versus pi as random sequence sources for Monte Carlo integration
- Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions
- On the rapid computation of various polylogarithmic constants
- Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
- Solving linear programming problems exactly
- The Arithmetic of the Digital Computer: A New Approach
- The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
- The origin and history of mathematics
- The quest for pi
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
Cited in
(4)- 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
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
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)
