About the Project

simple

AdvancedHelp

(0.001 seconds)

21—30 of 72 matching pages

21: 1.6 Vectors and Vector-Valued Functions
The geometrical image C of a path 𝐜 is called a simple closed curve if 𝐜 is one-to-one, with the exception 𝐜 ( a ) = 𝐜 ( b ) . … … and S be the closed and bounded point set in the ( x , y ) plane having a simple closed curve C as boundary. …
22: 3.3 Interpolation
3.3.6 R n ( z ) = ω n + 1 ( z ) 2 π i C f ( ζ ) ( ζ z ) ω n + 1 ( ζ ) d ζ ,
where C is a simple closed contour in D described in the positive rotational sense and enclosing the points z , z 1 , z 2 , , z n . … where ω n + 1 ( ζ ) is given by (3.3.3), and C is a simple closed contour in D described in the positive rotational sense and enclosing z 0 , z 1 , , z n . …
23: 20.13 Physical Applications
Theta-function solutions to the heat diffusion equation with simple boundary conditions are discussed in Lawden (1989, pp. 1–3), and with more general boundary conditions in Körner (1989, pp. 274–281). …
24: 28.7 Analytic Continuation of Eigenvalues
The normal values are simple roots of the corresponding equations (28.2.21) and (28.2.22). …
25: 2.8 Differential Equations with a Parameter
In Case II f ( z ) has a simple zero at z 0 and g ( z ) is analytic at z 0 . …
§2.8(iii) Case II: Simple Turning Point
§2.8(iv) Case III: Simple Pole
More generally, g ( z ) can have a simple or double pole at z 0 . … For a coalescing turning point and simple pole see Nestor (1984) and Dunster (1994b); in this case the uniform approximants are Whittaker functions (§13.14(i)) with a fixed value of the second parameter. …
26: 7.13 Zeros
erf z has a simple zero at z = 0 , and in the first quadrant of there is an infinite set of zeros z n = x n + i y n , n = 1 , 2 , 3 , , arranged in order of increasing absolute value. … At z = 0 , C ( z ) has a simple zero and S ( z ) has a triple zero. …
27: 18.40 Methods of Computation
In what follows we consider only the simple, illustrative, case that μ ( x ) is continuously differentiable so that d μ ( x ) = w ( x ) d x , with w ( x ) real, positive, and continuous on a real interval [ a , b ] . The strategy will be to: 1) use the moments to determine the recursion coefficients α n , β n of equations (18.2.11_5) and (18.2.11_8); then, 2) to construct the quadrature abscissas x i and weights (or Christoffel numbers) w i from the J-matrix of §3.5(vi), equations (3.5.31) and(3.5.32). … A simple set of choices is spelled out in Gordon (1968) which gives a numerically stable algorithm for direct computation of the recursion coefficients in terms of the moments, followed by construction of the J-matrix and quadrature weights and abscissas, and we will follow this approach: Let N be a positive integer and define …
28: 22.2 Definitions
Each is meromorphic in z for fixed k , with simple poles and simple zeros, and each is meromorphic in k for fixed z . …
29: 25.2 Definition and Expansions
It is a meromorphic function whose only singularity in is a simple pole at s = 1 , with residue 1. …
25.2.4 ζ ( s ) = 1 s 1 + n = 0 ( 1 ) n n ! γ n ( s 1 ) n ,
30: 28.12 Definitions and Basic Properties
When q = 0 Equation (28.2.16) has simple roots, given by … As in §28.7 values of q for which (28.2.16) has simple roots λ are called normal values with respect to ν . …