Search Results for ""

A method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

The finite volume method is a numerical method for solving partial differential equations that calculates the values of the conserved variables averaged across the volume. ...

The projective special linear group PSL_n(q) is the group obtained from the special linear group SL_n(q) on factoring by the scalar matrices contained in that group. It is ...

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

A direct search method of optimization that works moderately well for stochastic problems. It is based on evaluating a function at the vertices of a simplex, then iteratively ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

The sum of the reciprocals of roots of an equation equals the negative coefficient of the linear term in the Maclaurin series.

A congruence of the form f(x)=0 (mod n) where f(x) is an integer polynomial (Nagell 1951, p. 73).

A root-finding algorithm also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order Taylor series ...