Revision as of 09:18, 13 February 2020 edit Fpacifica (talk \| contribs) 103 edits m →Algorithm: Insert blank lines between equations in step 2 to prevent the formulas running together. ← Previous edit		Revision as of 07:09, 15 November 2021 edit undo Citation bot (talk \| contribs) Bots 5,867,154 edits Alter: pages. Add: jstor. Removed parameters. Formatted dashes. \| Use this bot. Report bugs. \| Suggested by Abductive \| #UCB_toolbar Next edit →
Line 59: \| author-link=Richard Brent (scientist) \| publication-date= ~~\| date=~~ \| year=1975 \| title=Multiple-precision zero-finding methods and the complexity of elementary function evaluation Line 99 ⟶ 98: \| issn=0025-5718 \| doi=10.2307/2005327 \| jstor=2005327 \| oclc= \| accessdate= Line 110: === Elementary proof with integral calculus === The Gauss-Legendre algorithm can be proven without elliptic modular functions. This is done here<ref>{{citation\|title=Recent Calculations of π: The Gauss-Salamin Algorithm\|last1=Lord\|first1=Nick\|~~DOI~~doi=10.2307/3619132\|year=1992\|journal=The Mathematical Gazette\|volume=76\|issue=476\|pages=~~231-242~~231–242\|jstor=3619132}}</ref> and here<ref>{{citation\|title=Easy Proof of Three Recursive π-Algorithms\|last1=Milla\|first1=Lorenz\|arxiv=1907.04110\|year=2019}}</ref> using only integral calculus. == See also ==

Gauss–Legendre algorithm: Difference between revisions