Search Results for ""
1151 - 1160 of 1293 for Euler Forward MethodSearch Results
It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...
The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...
Given a Jacobi theta function, the nome is defined as q(k) = e^(piitau) (1) = e^(-piK^'(k)/K(k)) (2) = e^(-piK(sqrt(1-k^2))/K(k)) (3) (Borwein and Borwein 1987, pp. 41, 109 ...
Numerical integration is the approximate computation of an integral using numerical techniques. The numerical computation of an integral is sometimes called quadrature. ...
A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...
A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...
A rigorous mathematical argument which unequivocally demonstrates the truth of a given proposition. A mathematical statement that has been proven is called a theorem. ...
The Radon transform is an integral transform whose inverse is used to reconstruct images from medical CT scans. A technique for using Radon transforms to reconstruct a map of ...
The (first) rhombic dodecahedron is the dual polyhedron of the cuboctahedron A_1 (Holden 1971, p. 55) and Wenninger dual W_(11). Its sometimes also called the rhomboidal ...
An ordinary differential equation of the form y^('')+P(x)y^'+Q(x)y=0. (1) Such an equation has singularities for finite x=x_0 under the following conditions: (a) If either ...
...
View search results from all Wolfram sites (21560 matches)

