Brent, RichardBailey, DBorwein, NBrent, RBurachik, ROsborn, JSims, BZhu, Q2023-11-22978-3-030-36567-7http://hdl.handle.net/1885/307352We consider some of Jonathan and Peter Borweins contributions to the high-precision computation of ? and the elementary functions, with particular reference to their book Pi and the AGM (Wiley, 1987). Here AGM is the arithmeticgeometric mean of Gauss and Legendre. Because the AGM converges quadratically, it can be combined with fast multiplication algorithms to give fast algorithms for the n-bit computation of ?, and more generally the elementary functions. These algorithms run in almost linear time (Formula Presented), where M(n) is the time for n-bit multiplication. We outline some of the results and algorithms given in Pi and the AGM, and present some related (but new) results. In particular, we improve the published error bounds for some quadratically and quartically convergent algorithms for ?, such as the GaussLegendre algorithm. We show that an iteration of the Borwein-Borwein quartic algorithm for ? is equivalent to two iterations of the GaussLegendre quadratic algorithm for ?, in the sense that they produce exactly the same sequence of approximations to ? if performed using exact arithmetic.The author was supported in part by an Australian Research Council grant DP140101417. Jon Borwein was the Principal Investigator on this grant, which was held by Borwein, Brent and Baileyapplication/pdfen-AU© Springer Nature Switzerland AG 2020202010.1007/978-3-030-36568-4_212022-08-14