numerical use of

SearchAdvancedHelp

(0.002 seconds)

21—30 of 83 matching pages

21: 27.15 Chinese Remainder Theorem

… ►This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. … ►Even though the lengthy calculation is repeated four times, once for each modulus, most of it only uses five-digit integers and is accomplished quickly without overwhelming the machine’s memory. Details of a machine program describing the method together with typical numerical results can be found in Newman (1967). …

22: 36.15 Methods of Computation

… ►Close to the origin $𝐱=\mathrm{𝟎}$ of parameter space, the series in §36.8 can be used. … ►Close to the bifurcation set but far from $𝐱=\mathrm{𝟎}$, the uniform asymptotic approximations of §36.12 can be used. … ►Direct numerical evaluation can be carried out along a contour that runs along the segment of the real $t$-axis containing all real critical points of $\mathrm{\Phi }$ and is deformed outside this range so as to reach infinity along the asymptotic valleys of $\exp \left(\mathrm{i}\mathrm{\Phi }\right)$. (For the umbilics, representations as one-dimensional integrals (§36.2) are used.) … ►For numerical solution of partial differential equations satisfied by the canonical integrals see Connor et al. (1983).

23: 29.21 Tables

… ►

Arscott and Khabaza (1962) tabulates the coefficients of the polynomials $P$ in Table 29.12.1 (normalized so that the numerically largest coefficient is unity, i.e. monic polynomials), and the corresponding eigenvalues $h$ for $k^2=0.1(.1)0.9$, $n=1(1)30$. Equations from §29.6 can be used to transform to the normalization adopted in this chapter. Precision is 6S.

24: 19.36 Methods of Computation

… ►Numerical quadrature is slower than most methods for the standard integrals but can be useful for elliptic integrals that have complicated representations in terms of standard integrals. …

25: Bibliography

… ►

Arb: A C Library for Arbitrary Precision Ball Arithmetic.

ⓘ

Notes:

An extended-precision C code for special functions. The library uses arbitrary-precision ball arithmetic. Ball arithmetic is an efficient technique for performing numerical computations with automatic and rigorous tracking of error bounds. Arb is designed with computer algebra and computational number theory in mind, extending the principles behind FLINT to the domain of real and complex numbers.

Referenced by:

§ ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index.

Encodings:

BibTeX

…

26: 9.13 Generalized Airy Functions

… ►are used in approximating solutions to differential equations with multiple turning points; see §2.8(v). … ►In Olver (1977a, 1978) a different normalization is used. … ►In $ℂ$, the solutions of (9.13.13) used in Olver (1978) are …The function on the right-hand side is recessive in the sector $-(2j-1)\pi /m\le \mathrm{ph}z\le (2j+1)\pi /m$, and is therefore an essential member of any numerically satisfactory pair of solutions in this region. ►Another normalization of (9.13.17) is used in Smirnov (1960), given by …

27: 15.19 Methods of Computation

… ►In Colman et al. (2011) an algorithm is described that uses expansions in continued fractions for high-precision computation of the Gauss hypergeometric function, when the variable and parameters are real and one of the numerator parameters is a positive integer. …

28: 3.4 Differentiation

… ► ►

§3.4(ii) Analytic Functions

… ►

Laplacian

… ►

Biharmonic Operator

… ►

29: Software Index

… ►

This is software of narrow scope developed as a byproduct of a research project and subsequently made available at no cost to the public. The software is often meant to demonstrate new numerical methods or software engineering strategies which were the subject of a research project. When developed, the software typically contains capabilities unavailable elsewhere. While the software may be quite capable, it is typically not professionally packaged and its use may require some expertise. The software is typically provided as source code or via a web-based service, and no support is provided.

…

30: 8.25 Methods of Computation

… ►Although the series expansions in §§8.7, 8.19(iv), and 8.21(vi) converge for all finite values of $z$, they are cumbersome to use when $|z|$ is large owing to slowness of convergence and cancellation. For large $|z|$ the corresponding asymptotic expansions (generally divergent) are used instead. … ►See Allasia and Besenghi (1987b) for the numerical computation of $\mathrm{\Gamma }(a,z)$ from (8.6.4) by means of the trapezoidal rule. … ►A numerical inversion procedure is also given for calculating the value of $x$ (with 10S accuracy), when $a$ and $P(a,x)$ are specified, based on Newton’s rule (§3.8(ii)). …