{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:24:08Z","timestamp":1769315048825,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1023\/a:1019184908442","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"59-81","source":"Crossref","is-referenced-by-count":5,"title":["New formulas for approximation of \u03c0 and other transcendental numbers"],"prefix":"10.1007","volume":"24","author":[{"given":"Bahman","family":"Kalantari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329389_CR1","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530074","volume-title":"Pad\u00e9 Approximants","author":"G.A. Baker Jr.","year":"1996","unstructured":"G.A. Baker Jr. and P.R. Graves-Morris, Pad\u00e9 Approximants, 2nd ed., Encyclopedia of Mathematics and its Applications, Vol. 59 (Cambridge Univ. Press, Cambridge, 1996).","edition":"2nd ed."},{"key":"329389_CR2","doi-asserted-by":"crossref","unstructured":"D.H. Bailey, The computation of Pi to 29,360,000 decimal digits using Borwein's quadratically convergent algorithm, Math. Comp. (1988) 283\u2013296.","DOI":"10.1090\/S0025-5718-1988-0917836-3"},{"key":"329389_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF03024340","volume":"19","author":"D.H. Bailey","year":"1997","unstructured":"D.H. Bailey, J.M. Borwein, P.B. Borwein and S. Plouffe, The quest for ?, Math. Intelligencer 19 (1997) 50\u201357.","journal-title":"Math. Intelligencer"},{"key":"329389_CR4","volume-title":"History of ?","author":"P. Beckmann","year":"1971","unstructured":"P. Beckmann, History of ? (St. Martin's Press, New York, 1971)."},{"key":"329389_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2736-4","volume-title":"Pi: A Source Book","author":"L. Berggren","year":"1997","unstructured":"L. Berggren, J. Borwein and P. Borwein, Pi: A Source Book (Springer, New York, 1997)."},{"key":"329389_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0265-3","volume-title":"Polynomials and Matrix Computations, Vol. 1: Fundamental Algorithms","author":"D. Bini","year":"1994","unstructured":"D. Bini and V.Y. Pan, Polynomials and Matrix Computations, Vol. 1: Fundamental Algorithms (Birkh\u00e4user, Boston\/Cambridge, MA, 1994)."},{"key":"329389_CR7","doi-asserted-by":"crossref","unstructured":"J.M. Borwein, P.B. Borwein and H. Bailey, Ramanujan, modular equations, and approximation to ?, or how to compute one billion digits of ?, Amer. Math. Monthly (1989) 201\u2013219.","DOI":"10.1080\/00029890.1989.11972169"},{"key":"329389_CR8","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321941.321944","volume":"23","author":"R.P. Brent","year":"1976","unstructured":"R.P. Brent, Fast multiple-precision evaluation of elementary functions, J. Assoc. Comput. Mach. 23 (1976) 242\u2013251.","journal-title":"J. Assoc. Comput. Mach."},{"key":"329389_CR9","first-page":"375","volume-title":"Approximations and Complex Multiplication According to Ramanujan. Ramanujan revisited (Urbana-Champaign, IL, 1987)","author":"D.V. Chudnovsky","year":"1988","unstructured":"D.V. Chudnovsky and G.V. Chudnovsky, Approximations and Complex Multiplication According to Ramanujan. Ramanujan revisited (Urbana-Champaign, IL, 1987) (Academic Press, Boston, MA, 1988) 375\u2013472."},{"key":"329389_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1137\/0214007","volume":"14","author":"C.M. Fiduccia","year":"1985","unstructured":"C.M. Fiduccia, An efficient formula for linear recurrences, SIAM J. Comput. 14 (1985) 106\u2013112.","journal-title":"SIAM J. Comput."},{"key":"329389_CR11","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1098\/rstl.1694.0029","volume":"18","author":"E. Halley","year":"1694","unstructured":"E. Halley, A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction, Philos. Trans. Roy. Soc. London 18 (1694) 136\u2013145.","journal-title":"Philos. Trans. Roy. Soc. London"},{"key":"329389_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF01731991","volume":"36","author":"B. Kalantari","year":"1996","unstructured":"B. Kalantari and I. Kalantari, High order iterative methods for approximating square roots, BIT 36 (1996) 395\u2013399.","journal-title":"BIT"},{"key":"329389_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0377-0427(97)00014-9","volume":"80","author":"B. Kalantari","year":"1997","unstructured":"B. Kalantari, I. Kalantari and R. Zaare-Nahandi, A basic family of iteration functions for polynomial root finding and its characterizations, J. Comput. Appl. Math. 80 (1997) 209\u2013226.","journal-title":"J. Comput. Appl. Math."},{"key":"329389_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1023\/A:1022321325108","volume":"39","author":"B. Kalantari","year":"1999","unstructured":"B. Kalantari, On the order of a determinantal family of root-finding methods, BIT 39 (1999) 96\u2013109.","journal-title":"BIT"},{"key":"329389_CR15","series-title":"Technical Report DCS-TR","volume-title":"Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas","author":"B. Kalantari","year":"1997","unstructured":"B. Kalantari, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas, Technical Report DCS-TR 328, Department of Computer Science, Rutgers University, New Brunswick, NJ (1997), to appear in J. Comput. Appl. Math."},{"key":"329389_CR16","series-title":"Technical Report DCS-TR","volume-title":"A lower bound on determinants from linear programming","author":"B. Kalantar","year":"1997","unstructured":"B. Kalantar, A lower bound on determinants from linear programming, Technical Report DCS-TR 330, Department of Computer Science, Rutgers University, New Brunswick, NJ (1997)."},{"key":"329389_CR17","series-title":"Technical Report DCS-TR","volume-title":"Approximation of polynomial root using a single input and the corresponding derivative values","author":"B. Kalantari","year":"1998","unstructured":"B. Kalantari, Approximation of polynomial root using a single input and the corresponding derivative values, Technical Report DCS-TR 369, Department of Computer Science, Rutgers University, New Brunswick, NJ (1998)."},{"key":"329389_CR18","series-title":"Technical Report DCS-TR","volume-title":"Halley's method as the first member of an infinite family of cubic order rootfinding methods","author":"B. Kalantari","year":"1998","unstructured":"B. Kalantari, Halley's method as the first member of an infinite family of cubic order rootfinding methods, Technical Report DCS-TR 370, Department of Computer Science, Rutgers University, New Brunswick, NJ (1998)."},{"key":"329389_CR19","series-title":"Technical Report DCS-TR","volume-title":"Newton's method and generation of a determinantal family of iteration functions","author":"B. Kalantari","year":"1998","unstructured":"B. Kalantari and J. Gerlach, Newton's method and generation of a determinantal family of iteration functions, Technical Report DCS-TR 371, Department of Computer Science, Rutgers University, New Brunswick, NJ (1998), to appear in J. Comput. Appl. Math."},{"key":"329389_CR20","series-title":"Technical Report DCS-TR","volume-title":"A computational comparison of the first nine members of a determinantal family of rootfinding methods","author":"B. Kalantari","year":"1998","unstructured":"B. Kalantari and S. Park, A computational comparison of the first nine members of a determinantal family of rootfinding methods, Technical Report DCS-TR 375, Department of Computer Science, Rutgers University, New Brunswick, NJ (1998), to appear in J. Comput. Appl. Math."},{"key":"329389_CR21","volume-title":"A Survey of Matrix Theory and Matrix Inequalities","author":"M. Marcus","year":"1964","unstructured":"M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities (Allyn and Bacon, Boston, MA, 1964)."},{"key":"329389_CR22","doi-asserted-by":"publisher","first-page":"565","DOI":"10.2307\/2005327","volume":"30","author":"E. Salamin","year":"1976","unstructured":"E. Salamin, Computation of Pi using Arithmetic-geometric mean, Math. Comp. 30 (1976) 565\u2013570.","journal-title":"Math. Comp."},{"key":"329389_CR23","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2307\/2975033","volume":"102","author":"T.R. Scavo","year":"1995","unstructured":"T.R. Scavo and J.B. Thoo, On the geometry of Halley's method, Amer. Math. Monthly 102 (1995) 417\u2013426.","journal-title":"Amer. Math. Monthly"},{"key":"329389_CR24","first-page":"2074","volume":"39","author":"D. Takahashi","year":"1998","unstructured":"D. Takahashi and Y. Kanada, Calculation of ? to 51.5 billion decimal digits on distributed memory parallel processors (in Japanese) Trans. Inform. Process. Soc. Japan 39 (1998) 2074\u20132083.","journal-title":"Trans. Inform. Process. Soc. Japan"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019184908442.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019184908442\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019184908442.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:12:04Z","timestamp":1751872324000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019184908442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["329389"],"URL":"https:\/\/doi.org\/10.1023\/a:1019184908442","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}