FEE method
In mathematics, the FEE method, or fast E-function evaluation method, is the method of fast summation of series of a special form. It was constructed in 1990 by and is so-named because it makes fast computations of the Siegel E-functions possible, in particular of . A class of functions, which are "similar to the exponential function," was given the name "E-functions" by Carl Ludwig Siegel. Among these functions are such special functions as the hypergeometric function, cylinder, spherical functions and so on. Using the FEE, it is possible to prove the following theorem:
- Comment
- enIn mathematics, the FEE method, or fast E-function evaluation method, is the method of fast summation of series of a special form. It was constructed in 1990 by and is so-named because it makes fast computations of the Siegel E-functions possible, in particular of . A class of functions, which are "similar to the exponential function," was given the name "E-functions" by Carl Ludwig Siegel. Among these functions are such special functions as the hypergeometric function, cylinder, spherical functions and so on. Using the FEE, it is possible to prove the following theorem:
- Has abstract
- enIn mathematics, the FEE method, or fast E-function evaluation method, is the method of fast summation of series of a special form. It was constructed in 1990 by and is so-named because it makes fast computations of the Siegel E-functions possible, in particular of . A class of functions, which are "similar to the exponential function," was given the name "E-functions" by Carl Ludwig Siegel. Among these functions are such special functions as the hypergeometric function, cylinder, spherical functions and so on. Using the FEE, it is possible to prove the following theorem: Theorem: Let be an elementary transcendental function, that is the exponential function, or a trigonometric function, or an elementary algebraic function, or their superposition, or their inverse, or a superposition of the inverses. Then Here is the complexity of computation (bit) of the function with accuracy up to digits, is the complexity of multiplication of two -digit integers. The algorithms based on the method FEE include the algorithms for fast calculation of any elementary transcendental function for any value of the argument, the classical constants e, the Euler constant the Catalan and the Apéry constants, such higher transcendental functions as the Euler gamma function and its derivatives, the hypergeometric, spherical, cylinder (including the Bessel) functions and some other functions foralgebraic values of the argument and parameters, the Riemann zeta function for integer values of the argument and the Hurwitz zeta function for integer argument and algebraic values of the parameter, and also such special integrals as the integral of probability, the Fresnel integrals, the integral exponential function, the trigonometric integrals, and some other integrals for algebraic values of the argument with the complexity bound which is close to the optimal one, namely At present, only the FEE makes it possible to calculate fast the values of the functions from the class of higher transcendental functions, certain special integrals of mathematical physics and such classical constants as Euler's, Catalan's and Apéry's constants. An additional advantage of the method FEE is the possibility of parallelizing the algorithms based on the FEE.
- Is primary topic of
- FEE method
- Label
- enFEE method
- Link from a Wikipage to an external page
- www.ccas.ru/personal/karatsuba/algen.htm
- www.ccas.ru/personal/karatsuba/divcen.htm
- Link from a Wikipage to another Wikipage
- AGM method
- Algebraic function
- Algebraic number
- Analysis of algorithms
- Apéry's constant
- Bessel function
- Carl Ludwig Siegel
- Catalan's constant
- Category:Computer arithmetic algorithms
- Category:Numerical analysis
- Category:Pi algorithms
- Complexity of computation (bit)
- E (mathematical constant)
- E-function
- Ekaterina Karatsuba
- Error function
- Euler–Mascheroni constant
- Exponential function
- Exponential integral
- Fast algorithms
- Fresnel integral
- Gamma function
- Hurwitz zeta function
- Hypergeometric function
- Inverse function
- Pi
- Riemann zeta function
- Special functions
- Spherical harmonics
- Transcendental function
- Trigonometric functions
- Trigonometric integral
- SameAs
- 3yLhE
- FEE method
- m.05mv1zs
- Q4291816
- Метод БВЕ
- روش FEE
- Subject
- Category:Computer arithmetic algorithms
- Category:Numerical analysis
- Category:Pi algorithms
- WasDerivedFrom
- FEE method?oldid=1118433972&ns=0
- WikiPageLength
- 11029
- Wikipage page ID
- 21674054
- Wikipage revision ID
- 1118433972
- WikiPageUsesTemplate
- Template:Math
- Template:Reflist
- Template:When