About the Project

finite

AdvancedHelp

(0.001 seconds)

21—30 of 111 matching pages

21: 24.17 Mathematical Applications
Calculus of Finite Differences
22: 28.7 Analytic Continuation of Eigenvalues
The only singularities are algebraic branch points, with a n ( q ) and b n ( q ) finite at these points. The number of branch points is infinite, but countable, and there are no finite limit points. …
23: 31.8 Solutions via Quadratures
The curve Γ reflects the finite-gap property of Equation (31.2.1) when the exponent parameters satisfy (31.8.1) for m j . … The solutions in this section are finite-term Liouvillean solutions which can be constructed via Kovacic’s algorithm; see §31.14(ii).
24: 4.30 Elementary Properties
Table 4.30.1: Hyperbolic functions: interrelations. All square roots have their principal values when the functions are real, nonnegative, and finite.
sinh θ = a cosh θ = a tanh θ = a csch θ = a sech θ = a coth θ = a
25: 6.6 Power Series
The series in this section converge for all finite values of x and | z | .
26: 9.17 Methods of Computation
Although the Maclaurin-series expansions of §§9.4 and 9.12(vi) converge for all finite values of z , they are cumbersome to use when | z | is large owing to slowness of convergence and cancellation. …
27: 11.13 Methods of Computation
Although the power-series expansions (11.2.1) and (11.2.2), and the Bessel-function expansions of §11.4(iv) converge for all finite values of z , they are cumbersome to use when | z | is large owing to slowness of convergence and cancellation. …
28: 20.14 Methods of Computation
In theory, starting from any value of τ , a finite number of applications of the transformations τ τ + 1 and τ 1 / τ will result in a value of τ with τ 3 / 2 ; see §23.18. …
29: 26.2 Basic Definitions
Given a finite set S with permutation σ , a cycle is an ordered equivalence class of elements of S where j is equivalent to k if there exists an = ( j , k ) such that j = σ ( k ) , where σ 1 = σ and σ is the composition of σ with σ 1 . …
30: 26.18 Counting Techniques
26.18.1 | S ( A 1 A 2 A n ) | = | S | + t = 1 n ( 1 ) t 1 j 1 < j 2 < < j t n | A j 1 A j 2 A j t | .