Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
type: Item
instance of: scholarly article
title: Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
zbMATH Open document ID: 1143.65022
author: Ravi P. Agarwal
author: Syamal K. Sen
published in: Applied Mathematics and Computation
publication date: 2008-06-11T00:00:00Z
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 11Y60
Mathematics Subject Classification ID: 33B10
Mathematics Subject Classification ID: 65-03
Mathematics Subject Classification ID: 65G50
Mathematics Subject Classification ID: 33F05
zbMATH DE Number: 5286443
zbMATH Keywords: error-free computation
zbMATH Keywords: exponential function
zbMATH Keywords: golden ratio
zbMATH Keywords: irrational numbers
zbMATH Keywords: pi
zbMATH Keywords: pre-computer era
MaRDI profile type: Publication
full work available at URL: j.amc.2007.10.039
OpenAlex ID: W1970495400
cites work: Q5569410
cites work: Computational error and complexity in science and engineering
cites work: Q4296992
cites work: The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
cites work: On the rapid computation of various polylogarithmic constants
cites work: Q5625099
cites work: Q4348641
cites work: Q3476890
cites work: Explicit Ramanujan-type approximations to pi of higher order
cites work: Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
cites work: Fast Multiple-Precision Evaluation of Elementary Functions
cites work: A Spigot Algorithm for the Digits of &#960
cites work: Computation of π Using Arithmetic-Geometric Mean
cites work: Calculation of π to 100,000 Decimals
cites work: Is \(\pi\) normal ?
cites work: Q5483838
cites work: The quest for pi
cites work: Q4433575
cites work: Q3856819
cites work: Golden ratio versus pi as random sequence sources for Monte Carlo integration
cites work: A new polynomial-time algorithm for linear programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: A variation on Karmarkar’s algorithm for solving linear programming problems
cites work: Q4039868
cites work: Q3844775
cites work: Q3229788
cites work: Q5610172
cites work: Q4082544
cites work: Q3022992
cites work: Q3340031
cites work: Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions
DOI: 10.1016/J.AMC.2007.10.039
description: scientific article; zbMATH DE number 5286443