Mercurial > octave-nkf

comparison liboctave/numeric/lo-specfun.cc @ 18712:6113e0c6920b

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
maint: Clean up extra spaces before/after parentheses.
author Rik <rik@octave.org>
date Fri, 25 Apr 2014 13:25:25 -0700
parents 5bd1ca29c5f0
children 161ebb78ac1b
comparison
equal deleted inserted replaced
18711:f684f7075aee 18712:6113e0c6920b
3631 } 3631 }
3632 3632
3633 double sqrt_eps = sqrt (std::numeric_limits<double>::epsilon ()); 3633 double sqrt_eps = sqrt (std::numeric_limits<double>::epsilon ());
3634 if (m < sqrt_eps) 3634 if (m < sqrt_eps)
3635 { 3635 {
3636 // For small m, ( Abramowitz and Stegun, Section 16.13 ) 3636 // For small m, (Abramowitz and Stegun, Section 16.13)
3637 si_u = sin (u); 3637 si_u = sin (u);
3638 co_u = cos (u); 3638 co_u = cos (u);
3639 t = 0.25*m*(u - si_u*co_u); 3639 t = 0.25*m*(u - si_u*co_u);
3640 sn = si_u - t * co_u; 3640 sn = si_u - t * co_u;
3641 cn = co_u + t * si_u; 3641 cn = co_u + t * si_u;
3642 dn = 1 - 0.5*m*si_u*si_u; 3642 dn = 1 - 0.5*m*si_u*si_u;
3643 } 3643 }
3644 else if ((1 - m) < sqrt_eps) 3644 else if ((1 - m) < sqrt_eps)
3645 { 3645 {
3646 // For m1 = (1-m) small ( Abramowitz and Stegun, Section 16.15 ) 3646 // For m1 = (1-m) small (Abramowitz and Stegun, Section 16.15)
3647 m1 = 1 - m; 3647 m1 = 1 - m;
3648 si_u = sinh (u); 3648 si_u = sinh (u);
3649 co_u = cosh (u); 3649 co_u = cosh (u);
3650 ta_u = tanh (u); 3650 ta_u = tanh (u);
3651 se_u = 1/co_u; 3651 se_u = 1/co_u;
3653 cn = se_u - 0.25*m1*(si_u*co_u - u)*ta_u*se_u; 3653 cn = se_u - 0.25*m1*(si_u*co_u - u)*ta_u*se_u;
3654 dn = se_u + 0.25*m1*(si_u*co_u + u)*ta_u*se_u; 3654 dn = se_u + 0.25*m1*(si_u*co_u + u)*ta_u*se_u;
3655 } 3655 }
3656 else 3656 else
3657 { 3657 {
3658 // Arithmetic-Geometric Mean (AGM) algorithm 3658 // Arithmetic-Geometric Mean (AGM) algorithm
3659 // ( Abramowitz and Stegun, Section 16.4 ) 3659 // (Abramowitz and Stegun, Section 16.4)
3660 a[0] = 1; 3660 a[0] = 1;
3661 b = sqrt (1 - m); 3661 b = sqrt (1 - m);
3662 c[0] = sqrt (m); 3662 c[0] = sqrt (m);
3663 for (n = 1; n < Nmax; ++n) 3663 for (n = 1; n < Nmax; ++n)
3664 { 3664 {