# method+of+computation

11

**Evolutionary computation**— For the journal, see Evolutionary Computation (journal). In computer science, evolutionary computation is a subfield of artificial intelligence (more particularly computational intelligence) that involves combinatorial optimization problems.… …12

**Condorcet method**— Part of the Politics series Electoral methods Single winner …13

**Stein's method**— is a general method in probability theory to obtain bounds on the distance between two probability distributions with respect to a probability metric. It was introduced by Charles Stein, who first published it 1972,[1] to obtain a bound between… …14

**Reassignment method**— The method of reassignment is a technique forsharpening a time frequency representation by mappingthe data to time frequency coordinates that are nearer tothe true region of support of theanalyzed signal. The method has been… …15

**Flexibility method**— In structural engineering, the flexibility method is the classical consistent deformation method for computing member forces and displacements in structural systems. Its modern version formulated in terms of the members flexibility matrices also… …16

**Graeffe's method**— In mathematics, Graeffe s method or Dandelin–Graeffe method is an algorithm for finding all of the roots of a polynomial. It was developed independently by Germinal Pierre Dandelin in 1826 and Karl Heinrich Gräffe in 1837. Lobachevsky in 1834… …17

**Dynamic Monte Carlo method**— In chemistry, dynamic Monte Carlo (DMC) is a method for modeling the dynamic behaviors of molecules by comparing the rates of individual steps with random numbers. Unlike the Metropolis Monte Carlo method, which has been employed to study systems …18

**Fermat's factorization method**— is based on the representation of an odd integer as the difference of two squares: :N = a^2 b^2. That difference is algebraically factorable as (a+b)(a b); if neither factor equals one, it is a proper factorization of N .Each odd number has such… …19

**BFGS method**— In mathematics, the Broyden Fletcher Goldfarb Shanno (BFGS) method is a method to solve an unconstrained nonlinear optimization problem. The BFGS method is derived from the Newton s method in optimization, a class of hill climbing optimization… …20

**Jacobi method**— The Jacobi method is an algorithm in linear algebra for determining the solutions of a system of linear equations with largest absolute values in each row and column dominated by the diagonal element. Each diagonal element is solved for, and an… …