euler method
31Dixon's factorization method — In number theory, Dixon s factorization method (also Dixon s random squares method[1] or Dixon s algorithm) is a general purpose integer factorization algorithm; it is the prototypical factor base method, and the only factor base method for which …
32Prony's method — Prony analysis (Prony s method) was developed by Gaspard Riche de Prony in 1795. However, practical use of the method awaited the digital computer [1] . Similar to the Fourier transform, Prony s method extracts valuable information from a… …
33MacCormack method — In computational fluid dynamics, the MacCormack method is a widely used discretization scheme for the numerical solution of hyperbolic partial differential equations (hyperbolic PDEs). This second order finite difference method is introduced by R …
34Annihilator method — In mathematics, the annihilator method is a procedure used to find a particular solution to certain types of inhomogeneous ordinary differential equations. It is equivalent to the method of undetermined coefficients, and the two names are… …
35Proof of the Euler product formula for the Riemann zeta function — We will prove that the following formula holds::egin{align} zeta(s) = 1+frac{1}{2^s}+frac{1}{3^s}+frac{1}{4^s}+frac{1}{5^s}+ cdots = prod {p} frac{1}{1 p^{ s end{align}where zeta; denotes the Riemann zeta function and the product extends over… …
36Horn–Schunck method — The Horn–Schunck method of estimating optical flow is a global method which introduces a global constraint of smoothness to solve the aperture problem (see Lucas–Kanade method for further description).A global energy function is sought to be… …
37Discharging method (discrete mathematics) — The discharging method is a technique used to prove lemmas in structural graph theory. Discharging is most well known for its central role in the proof of the Four Color Theorem. The discharging method is used to prove that every graph in a… …
38Milstein method — In mathematics, the Milstein method, named after Grigori N. Milstein, is a technique for the approximate numerical solution of a stochastic differential equation. Consider the Itō stochastic differential equation with initial condition… …
39Numerical ordinary differential equations — Illustration of numerical integration for the differential equation y = y,y(0) = 1. Blue: the Euler method, green: the midpoint method, red: the exact solution, y = et. The step size is h = 1.0 …
40List of mathematics articles (E) — NOTOC E E₇ E (mathematical constant) E function E₈ lattice E₈ manifold E∞ operad E7½ E8 investigation tool Earley parser Early stopping Earnshaw s theorem Earth mover s distance East Journal on Approximations Eastern Arabic numerals Easton s… …
