TOPICS
Search

Search Results for ""


211 - 220 of 1293 for Euler Forward MethodSearch Results
Cauchy's integral formula states that f(z_0)=1/(2pii)∮_gamma(f(z)dz)/(z-z_0), (1) where the integral is a contour integral along the contour gamma enclosing the point z_0. It ...
A permutation problem invented by Cayley. Let the numbers 1, 2, ..., n be written on a set of cards, and shuffle this deck of cards. Now, start counting using the top card. ...
Series reversion is the computation of the coefficients of the inverse function given those of the forward function. For a function expressed in a series with no constant ...
The polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...
The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.
A compact manifold admits a Lorentzian structure iff its Euler characteristic vanishes. Therefore, every noncompact manifold admits a Lorentzian structure.
The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.
The intersection Ev of the Gergonne line and the Euler line. It has triangle center function alpha=(b(a-b+c)cosB+c(a+b-c)cosC-2a^2cosA)/(2a) and is Kimberling center X_(1375).
An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).
A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.
1 ... 19|20|21|22|23|24|25 ... 130 Previous Next

...