Search Results for ""

The bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...

A two-dimensional binary (k=2) totalistic cellular automaton with a von Neumann neighborhood of range r=1. It has a birth rule that at least 2 of its 4 neighbors are alive, ...

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Kaps-Rentrop methods.

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

Elementary methods consist of arithmetic, geometry, and high school algebra. These are the only tools that may be used in the branch of number theory known as elementary ...

A general set of methods for integrating ordinary differential equations. Predictor-corrector methods proceed by extrapolating a polynomial fit to the derivative from the ...

An extension of the secant method of root finding to higher dimensions.

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...