|
Gauss–Legendre Algorithm
The Gauss–Legendre algorithm is an algorithm to compute the digits of . It is notable for being rapidly convergent, with only 25 iterations producing 45 million correct digits of . However, it has some drawbacks (for example, it is computer memory-intensive) and therefore all record-breaking calculations for many years have used other methods, almost always the Chudnovsky algorithm. For details, see Chronology of computation of . The method is based on the individual work of Carl Friedrich Gauss (1777–1855) and Adrien-Marie Legendre (1752–1833) combined with modern algorithms for multiplication and square roots. It repeatedly replaces two numbers by their arithmetic and geometric mean, in order to approximate their arithmetic-geometric mean. The version presented below is also known as the Gauss–Euler, Brent–Salamin (or Salamin–Brent) algorithm; it was independently discovered in 1975 by Richard Brent and Eugene Salamin. It was used to compute the first 206, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of Rigour#Mathematics, mathematically rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use Conditional (computer programming), conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning). In contrast, a Heuristic (computer science), heuristic is an approach to solving problems without well-defined correct or optimal results.David A. Grossman, Ophir Frieder, ''Information Retrieval: Algorithms and Heuristics'', 2nd edition, 2004, For example, although social media recommender systems are commonly called "algorithms", they actually rely on heuristics as there is no truly "correct" recommendation. As an e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Richard Brent (scientist)
Richard Peirce Brent is an Australian mathematician and computer scientist. He is an emeritus professor at the Australian National University. From March 2005 to March 2010 he was a Federation Fellow at the Australian National University. His research interests include number theory (in particular factorisation), random number generators, computer architecture, and analysis of algorithms. In 1973, he published a root-finding algorithm (an algorithm for solving equations numerically) which is now known as Brent's method. In 1975 he and Eugene Salamin independently conceived the Salamin–Brent algorithm, used in high-precision calculation of \pi. At the same time, he showed that all the elementary functions (such as log(''x''), sin(''x'') etc.) can be evaluated to high precision in the same time as \pi (apart from a small constant factor) using the arithmetic-geometric mean of Carl Friedrich Gauss. In 1979 he showed that the first 75 million complex zeros of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Elliptic Integral
In integral calculus, an elliptic integral is one of a number of related functions defined as the value of certain integrals, which were first studied by Giulio Fagnano and Leonhard Euler (). Their name originates from their originally arising in connection with the problem of finding the arc length of an ellipse. Modern mathematics defines an "elliptic integral" as any function which can be expressed in the form f(x) = \int_^ R \, dt, where is a rational function of its two arguments, is a polynomial of degree 3 or 4 with no repeated roots, and is a constant. In general, integrals in this form cannot be expressed in terms of elementary functions. Exceptions to this general rule are when has repeated roots, or when contains no odd powers of or if the integral is pseudo-elliptic. However, with the appropriate reduction formula, every elliptic integral can be brought into a form that involves integrals over rational functions and the three Legendre canonical forms, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Arithmetic–geometric Mean
In mathematics, the arithmetic–geometric mean (AGM or agM) of two positive real numbers and is the mutual limit of a sequence of arithmetic means and a sequence of geometric means. The arithmetic–geometric mean is used in fast algorithms for exponential, trigonometric functions, and other special functions, as well as some mathematical constants, in particular, computing . The AGM is defined as the limit of the interdependent sequences a_i and g_i. Assuming x \geq y \geq 0, we write:\begin a_0 &= x,\\ g_0 &= y\\ a_ &= \tfrac12(a_n + g_n),\\ g_ &= \sqrt\, . \endThese two sequences converge to the same number, the arithmetic–geometric mean of and ; it is denoted by , or sometimes by or . The arithmetic–geometric mean can be extended to complex numbers and, when the branches of the square root are allowed to be taken inconsistently, it is a multivalued function. Example To find the arithmetic–geometric mean of and , iterate as follows:\begin a_1 & = & \tfr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Iteration
Iteration is the repetition of a process in order to generate a (possibly unbounded) sequence of outcomes. Each repetition of the process is a single iteration, and the outcome of each iteration is then the starting point of the next iteration. In mathematics and computer science, iteration (along with the related technique of recursion) is a standard element of algorithms. Mathematics In mathematics, iteration may refer to the process of iterated function, iterating a function, i.e. applying a function repeatedly, using the output from one iteration as the input to the next. Iteration of apparently simple functions can produce complex behaviors and difficult problems – for examples, see the Collatz conjecture and juggler sequences. Another use of iteration in mathematics is in iterative methods which are used to produce approximate numerical solutions to certain mathematical problems. Newton's method is an example of an iterative method. Manual calculation of a number's sq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Quadratic Convergence
In mathematical analysis, particularly numerical analysis, the rate of convergence and order of convergence of a sequence that converges to a limit are any of several characterizations of how quickly that sequence approaches its limit. These are broadly divided into rates and orders of convergence that describe how quickly a sequence further approaches its limit once it is already close to it, called asymptotic rates and orders of convergence, and those that describe how quickly sequences approach their limits from starting points that are not necessarily close to their limits, called non-asymptotic rates and orders of convergence. Asymptotic behavior is particularly useful for deciding when to stop a sequence of numerical computations, for instance once a target precision has been reached with an iterative root-finding algorithm, but pre-asymptotic behavior is often crucial for determining whether to begin a sequence of computations at all, since it may be impossible or imprac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Borwein's Algorithm
Borwein's algorithm was devised by Jonathan and Peter Borwein to calculate the value of 1 / \pi. This and other algorithms can be found in the book ''Pi and the AGM – A Study in Analytic Number Theory and Computational Complexity''. Ramanujan–Sato series These two are examples of a Ramanujan–Sato series. The related Chudnovsky algorithm uses a discriminant with class number 1. Class number 2 (1989) Start by setting : \begin A & = 212175710912 \sqrt + 1657145277365 \\ B & = 13773980892672 \sqrt + 107578229802750 \\ C & = \left(5280\left(236674+30303\sqrt\right)\right)^3 \end Then :\frac = 12\sum_^\infty \frac Each additional term of the partial sum yields approximately 25 digits. Class number 4 (1993) Start by setting : \begin A = & 63365028312971999585426220 \\ & + 28337702140800842046825600\sqrt \\ & + 384\sqrt \big(10891728551171178200467436212395209160385656017 \\ & + \left. 487092908657881022 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Eugene Salamin (mathematician)
Eugene Salamin is a mathematician who discovered (independently with Richard Brent (scientist), Richard Brent) the Salamin–Brent algorithm, used in high-precision calculation of pi. Eugene Salamin worked on alternatives to increase accuracy and minimize computational processes through the use of quaternions. Benefits may include: # the design of spatio-temporal databases; # numerical mathematical methods that traditionally prove unsuccessful due to the buildup of computational errors; # therefore, may be applied to applications involving genetic algorithms and evolutionary computation, in general. Publications See also * HAKMEM References [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Random-access Memory
Random-access memory (RAM; ) is a form of Computer memory, electronic computer memory that can be read and changed in any order, typically used to store working Data (computing), data and machine code. A random-access memory device allows data items to be read (computer), read or written in almost the same amount of time irrespective of the physical location of data inside the memory, in contrast with other direct-access data storage media (such as hard disks and Magnetic tape data storage, magnetic tape), where the time required to read and write data items varies significantly depending on their physical locations on the recording medium, due to mechanical limitations such as media rotation speeds and arm movement. In today's technology, random-access memory takes the form of integrated circuit (IC) chips with MOSFET, MOS (metal–oxide–semiconductor) Memory cell (computing), memory cells. RAM is normally associated with Volatile memory, volatile types of memory where s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Geometric Mean
In mathematics, the geometric mean is a mean or average which indicates a central tendency of a finite collection of positive real numbers by using the product of their values (as opposed to the arithmetic mean which uses their sum). The geometric mean of numbers is the Nth root, th root of their product (mathematics), product, i.e., for a collection of numbers , the geometric mean is defined as : \sqrt[n]. When the collection of numbers and their geometric mean are plotted in logarithmic scale, the geometric mean is transformed into an arithmetic mean, so the geometric mean can equivalently be calculated by taking the natural logarithm of each number, finding the arithmetic mean of the logarithms, and then returning the result to linear scale using the exponential function , :\sqrt[n] = \exp \left( \frac \right). The geometric mean of two numbers is the square root of their product, for example with numbers and the geometric mean is \textstyle \sqrt = The geometric mean o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Arithmetic Mean
In mathematics and statistics, the arithmetic mean ( ), arithmetic average, or just the ''mean'' or ''average'' is the sum of a collection of numbers divided by the count of numbers in the collection. The collection is often a set of results from an experiment, an observational study, or a Survey (statistics), survey. The term "arithmetic mean" is preferred in some contexts in mathematics and statistics because it helps to distinguish it from other types of means, such as geometric mean, geometric and harmonic mean, harmonic. Arithmetic means are also frequently used in economics, anthropology, history, and almost every other academic field to some extent. For example, per capita income is the arithmetic average of the income of a nation's Human population, population. While the arithmetic mean is often used to report central tendency, central tendencies, it is not a robust statistic: it is greatly influenced by outliers (Value (mathematics), values much larger or smaller than ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
