Abstract：
In this paper, we consider a fast and high-precision algorithm of the basic elementary functions. Firstly, we discuss the power series expansion of functions which are related to the Bernoulli number B2n or Euler number E2n, such as tan x, sec x, tanh x and so on, and study the corresponding fast computation. For the basic elementary functions, hyperbolic functions and inverse hyperbolic functions, we derive a fast and arbitrarily accurate algorithm based on the power series expansion in the complex domain. The algorithm proposed in this paper is suitable for all elementary functions due to that the exponential and logarithm functions can be expressed by the power series. The feature of this algorithm is that it can be easily coded and it is self-contained for the computation of the elementary functions.
. FAST CALCULATION AND HIGH PRECISION OF BASIC ELEMENTARY FUNCTION BASED ON POWER SERIES EXPANSIONS[J]. Journal of Numerical Methods and Computer Applicat, 2015, 36(1): 1-11.
[1]
Brent R. The Complexity of Multiple-Precision Arithmetic, In Complexity of Computational Problem Solving, R. Anderssen and R. Brent, E.U. of Queensland Press, Brisbane, 1976, 126-165.
[2]
Brent R. Fast algorithms for high-precision computation of elementary functions (invited talk), Seventh Conference on Real Numbers and Computers (RNC7). Nancy. France. 10-12 July 2006, 7-8(extended abstract).
[3]
Brent R. A Fortran Multiple-Precision Arithmetic Package[J]. ACM Trans. Math. Software, 1978, 4: 57-70.
[4]
Reyna J, Brent R and Lune J. A note on the real part of the Riemann zeta-function. in Herman J.J.te Riele Liber Amicorum. CWI, Amsterdam, Dec. 2011. arXiv: 1112.4910v1.
[5]
Ziv A and Israel I, H Israel. Fast evaluation of elementary mathematical functions with correctly rounded last bit[J]. ACM Transactions on Mathematical Software, 1991, 17(3): 410-423.
[6]
Paszkowski S. Fast Convergent Quasipower Series for Some Elementary and Special Functions[j]. Computers Math. Applic. 1997, 33(1-2): 181-191.
[7]
Brent R. Fast Multiple-Precision Evaluation of Elementary Functions[J]. Journal of the Aaaociation for Computing Machmery, 1976, 23(2).
[8]
Tsumura H. An elementary proof of Euler's formula for, Amer. Math. Monthly, 2004, 111: 430-431
[9]
Deeba E and Rodriguez D. Stirling's Series and Bernoulli Numbers[J]. Amer. Math. Monthly, 1991, 98: 423-426.
[10]
Kaneko M. A Recurrence Formula for the Bernoulli Numbers[J]. Proc. Japan Acad., 1995, 71, Ser. A: 192-193.
[11]
Zèkir A, Bencherif F. A new recursion relationship for Bernoulli Numbers[J]. Annales Mathematicae et Informaticae, 2011, 38: 123-126.
[12]
Howard F. Applications of a Recurrence for the Bernoulli Numbers[J]. J. Number Theory, 1995, 52: 157-172.
[13]
Tuenter H. The Frobenius problem, sums of powers of integers, and recurrences for the Bernoulli numbers[J]. Journal of Number Theory, 2006, 117: 376-386.
[14]
Gradshteyn I and Ryzhik I. Table of Integrals Series and Products, Seventh Ediyion, Academic Press is an imprint of Elsevier, 1043-1044.
[15]
Qin H, Shang N and Li A. Some identities on the Hurwitz zeta function and the extended Euler sums. Version of record first published: 05 Oct 2012.
[16]
Kim T. Euler Numbers and Polynomials Associated with Zeta Functions. Abstract and Applied Analysis, Volume 2008 (2008), Article ID 581582, 11 pages.
[17]
Adamchik V. On the Hurwitz function for rational arguments[J]. Applied Mathematics and Computation, 2007, 187: 3-12.
|
