Best k-digit rational approximation of irrational numbers: pre-computer versus computer era

DOI10.1016/J.AMC.2007.10.039zbMATH Open1143.65022OpenAlexW1970495400MaRDI QIDQ928099FDOQ928099

Authors: Ravi P. Agarwal, Syamal K. Sen 

Publication date: 11 June 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.10.039

Recommendations

• Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
• A fast computation of the best \(k\)-digit rational approximation to a real number
• An elementary remark on the accuracy of approximations by regular continued fractions
• scientific article; zbMATH DE number 3908521
• Approximating Rational Numbers by Fractions

zbMATH Keywords

exponential functiongolden ratiopiirrational numberserror-free computationpre-computer era

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Roundoff error (65G50) History of numerical analysis (65-03) Evaluation of number-theoretic constants (11Y60) Exponential and trigonometric functions (33B10) Numerical approximation and evaluation of special functions (33F05)

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
• 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?)
• Title not available (Why is that?)
• On the rapid computation of various polylogarithmic constants
• Title not available (Why is that?)
• The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
• 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
• Is \(\pi\) normal ?
• Title not available (Why is that?)
• 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 &#960
• The origin and history of mathematics
• Golden ratio versus pi as random sequence sources for Monte Carlo integration

Cited In (3)

• \(\pi, e, \varphi\) with MATLAB. Random and rational sequences with scope in supercomputing era
• Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
• Birth, growth and computation of pi to ten trillion digits

This page was built for publication: Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q928099)