About the Project

calculation

AdvancedHelp

(0.001 seconds)

31—40 of 59 matching pages

31: Bibliography M
  • Fr. Mechel (1966) Calculation of the modified Bessel functions of the second kind with complex argument. Math. Comp. 20 (95), pp. 407–412.
  • P. Midy (1975) An improved calculation of the general elliptic integral of the second kind in the neighbourhood of x = 0 . Numer. Math. 25 (1), pp. 99–101.
  • V. P. Modenov and A. V. Filonov (1986) Calculation of zeros of cylindrical functions and their derivatives. Vestnik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet. (2), pp. 63–64, 71 (Russian).
  • T. Morita (1978) Calculation of the complete elliptic integrals with complex modulus. Numer. Math. 29 (2), pp. 233–236.
  • MuPAD (commercial interactive system and Matlab toolbox) SciFace Software, Paderborn, Germany.
  • 32: Bibliography G
  • W. Gautschi (1999) A note on the recursive calculation of incomplete gamma functions. ACM Trans. Math. Software 25 (1), pp. 101–107.
  • G. H. Golub and J. H. Welsch (1969) Calculation of Gauss quadrature rules. Math. Comp. 23 (106), pp. 221–230.
  • F. W. Grover (1946) Inductance Calculations. Van Nostrand, New York.
  • 33: 27.14 Unrestricted Partitions
    §27.14(iii) Asymptotic Formulas
    These recursions can be used to calculate p ( n ) , which grows very rapidly. …
    34: Bibliography H
  • E. J. Heller, W. P. Reinhardt, and H. A. Yamani (1973) On an “equivalent quadrature” calculation of matrix elements of ( z p 2 / 2 m ) 1 using an L 2 expansion technique. J. Comput. Phys. 13, pp. 536–550.
  • L. E. Hoisington and G. Breit (1938) Calculation of Coulomb wave functions for high energies. Phys. Rev. 54 (8), pp. 627–628.
  • 35: 3.1 Arithmetics and Error Measures
    Interval arithmetic is intended for bounding the total effect of rounding errors of calculations with machine numbers. … During the calculations common divisors are removed from the rational numbers, and the final results can be converted to decimal representations of arbitrary length. …
    36: 22.20 Methods of Computation
    §22.20(iv) Lattice Calculations
    37: Bibliography N
  • E. Neuman (1969b) On the calculation of elliptic integrals of the second and third kinds. Zastos. Mat. 11, pp. 91–94.
  • 38: 3.11 Approximation Techniques
    Moreover, the set of minimax approximations p 0 ( x ) , p 1 ( x ) , p 2 ( x ) , , p n ( x ) requires the calculation and storage of 1 2 ( n + 1 ) ( n + 2 ) coefficients, whereas the corresponding set of Chebyshev-series approximations requires only n + 1 coefficients.
    Calculation of Chebyshev Coefficients
    The c n in (3.11.11) can be calculated from (3.11.10), but in general it is more efficient to make use of the orthogonal property (3.11.9). … A widely implemented and used algorithm for calculating the coefficients p j and q j in (3.11.16) is Remez’s second algorithm. …
    39: 12.11 Zeros
    Numerical calculations in this case show that z 1 2 , s corresponds to the s th zero on the string; compare §7.13(ii). …
    40: 30.16 Methods of Computation
    The coefficients a n , k m ( γ 2 ) calculated in §30.16(ii) can be used to compute S n m ( j ) ( z , γ ) , j = 1 , 2 , 3 , 4 from (30.11.3) as well as the connection coefficients K n m ( γ ) from (30.11.10) and (30.11.11). …