Multiplicatively closed set: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Ebony Jackson
It is standard not to exclude 0: see Talk page. Added references. Krull's lemma was removed because it is contained in the statement about unions of prime ideals.
en>Trappist the monk
m References: replace mr template with mr parameter in CS1 templates; using AWB
 
Line 1: Line 1:
{{mergeto|arithmetic–geometric mean|date=September 2012}}
Hello from Italy. I'm glad to came here. My first name is June. <br>I live in a small city called Poggio San Francesco in east Italy.<br>I was also born in Poggio San Francesco 24 years ago. Married in March 2009. I'm working at the college.<br><br>Here is my page - [http://www.calscottages.com/uggboots.asp UGG Boots USA]
In [[mathematics]], the '''AGM method''' (for [[arithmetic–geometric mean]]) makes it possible to construct fast [[algorithm]]s for calculation of [[exponential function|exponential]] and [[trigonometric functions]], and some [[mathematical constant]]s and in particular, to quickly [[computing π|compute <math>\pi</math>]].
 
==Method==
[[Gauss]] noticed<ref>{{cite journal |author=B. C. Carlson |title=Algorithms involving arithmetic and geometric means |journal=Amer. Math. Monthly |volume=78 |year=1971 |pages=496–505 |doi=10.2307/2317754 |mr=0283246}}</ref><ref>{{cite journal |author=B. C. Carlson |title=An algorithm for computing logarithms and arctangents |journal=Math.Comp. |volume=26 |issue=118 |year=1972 |pages=543–549 |doi=10.2307/2005182 |mr=0307438}}</ref> that the sequences
 
: <math>
\begin{align}
a_0 & & b_0 \\
a_1 & = \frac{a_0+b_0}{2}, & b_1 & = \sqrt{a_0 b_0} \\
a_2 & = \frac{a_1+b_1}{2}, & b_2 & = \sqrt{a_1 b_1} \\
    & {}\  \  \vdots & & {}\  \  \vdots \\
a_{N+1} & = \frac{a_N + b_N}{2}, & b_{N+1} & = \sqrt{a_N b_N}
\end{align}
</math>
 
as
: <math>N\to +\infty, \, </math>
 
have the same limit:
: <math>
\lim_{N\to\infty}a_N = \lim_{N\to\infty}b_N = M(a,b), \,
</math>
 
the [[arithmetic–geometric mean]].
 
It is possible to use this fact to construct [[fast algorithms]] for calculating [[elementary function|elementary]] [[transcendental function]]s and some classical constants, in particular, the constant [[pi|{{pi}}]].
 
==Applications==
===The number ''π''===
For example, according to the Gauss–[[Eugene Salamin (mathematician)|Salamin]] formula:<ref>{{cite journal |author=[[Eugene Salamin (mathematician)|E. Salamin]] |title=Computation of <math>\pi</math> using arithmetic-geometric mean |journal=Math. Comp. |volume=30 |issue=135 |year=1976 |pages=565–570 |doi=10.2307/2005327 |mr=0404124}}</ref>
 
: <math>
\pi = \frac{4 \left( M(1; \frac{1}{\sqrt{2}}) \right)^2} {\displaystyle 1 - \sum_{j=1}^\infty 2^{j+1} c_j^2}
,
</math>
 
where
 
: <math>c_j = \frac 12\left(a_{j-1}-b_{j-1}\right).</math>
 
===Complete elliptic integral ''K''(''α'')===
At the same time, if we take
 
: <math>
a_0 = 1,  \quad b_0 = \cos\alpha,
</math>
 
then
 
: <math>
\lim_{N\to\infty}a_N = \frac{\pi}{2K(\alpha)},
</math>
 
where ''K''(''α'') is a complete [[elliptic integral]]
 
: <math>
K(\alpha) = \int_0^{\pi/2}(1 - \alpha \sin^2\theta)^{-1/2} \, d\theta .
</math>
 
===Other applications===
Using this property of the AGM and also the ascending transformations of Landen,<ref>{{cite journal |author=J. Landen |title=An investigation of a general theorem for finding the length of any arc of any conic hyperbola, by means of two elliptic arcs, with some other new and useful theorems deduced therefrom |journal=Philosophical Transactions of the Royal Society |volume=65 |year=1775 |pages=283–289}}</ref> [[Richard Brent (scientist)|Richard Brent]]<ref>{{cite journal |author=[[Richard Brent (scientist)|R.P. Brent]] |title=Fast Multiple-Precision Evaluation of Elementary Functions |journal=J. Assoc. Comput. Mach. |volume=23 |issue=2 |year=1976 |pages=242–251 |doi=10.1145/321941.321944 |mr=0395314}}</ref> suggested the first AGM algorithms for fast evaluation of elementary transcendental functions (''e''<sup>''x''</sup>, cos&nbsp;''x'', sin&nbsp;''x''). Later many authors have been going on to study and use the AGM algorithms, see, for example, the book ''Pi and the AGM'' by [[Jonathan Borwein|Jonathan]] and [[Peter Borwein]].<ref>{{cite book |author1-link=Jonathan Borwein |first1=J.M. |last1=Borwein| author2-link=Peter Borwein |first2=P.B. |last2=Borwein |title=Pi and the AGM |publisher=Wiley |place=New York |year=1987 |isbn=0-471-83138-7 |mr=0877728}}</ref>
 
==See also==
*[[Gauss–Legendre algorithm]]
 
==References==
{{reflist|2}}
 
{{DEFAULTSORT:AGM method}}
[[Category:Computer arithmetic algorithms]]

Latest revision as of 13:31, 25 September 2014

Hello from Italy. I'm glad to came here. My first name is June.
I live in a small city called Poggio San Francesco in east Italy.
I was also born in Poggio San Francesco 24 years ago. Married in March 2009. I'm working at the college.

Here is my page - UGG Boots USA