Search Results for ""
191 - 200 of 729 for modular sieve methodSearch Results
The solution u(x,y)=int_0^xdxiint_1^yR(xi,eta;x,y)f(xi,eta)deta, where R(x,y;xieta) is the Riemann function of the linear Goursat problem with characteristics phi=psi=0 ...
The truth of an infinite sequence of propositions P_i for i=1, ..., infty is established if (1) P_1 is true, and (2) P_k implies P_(k+1) for all k. This principle is ...
Marsaglia (1972) has given a simple method for selecting points with a uniform distribution on the surface of a 4-sphere. This is accomplished by picking two pairs of points ...
Ueberhuber (1997, p. 71) and Krommer and Ueberhuber (1998, pp. 49 and 155-165) use the word "quadrature" to mean numerical computation of a univariate integral, and ...
The Ablowitz-Ramani-Segur conjecture states that a nonlinear partial differential equation is solvable by the inverse scattering method only if every nonlinear ordinary ...
Wallis's constant is the real solution (x^3-2x-5)_1=2.0945514815... (OEIS A007493) to the cubic equation x^3-2x-5=0. It was solved by Wallis to illustrate Newton's method for ...
An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...
Ellipsoidal calculus is a method for solving problems in control and estimation theory having unknown but bounded errors in terms of sets of approximating ellipsoidal-value ...
A method for testing nested hypotheses. To apply the procedure, given a specific model, calculate the likelihood of observing the actual data. Then compare this likelihood to ...
Model completion is a term employed when existential closure is successful. The formation of the complex numbers, and the move from affine to projective geometry, are ...
...
View search results from all Wolfram sites (18470 matches)

