Search Results for ""

Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...

T-integration, which stands for "tunable numerical integration," is a fast, accurate, and numerically stable numerical integration formula given by ...

It is thought that the totient valence function N_phi(m)>=2, i.e., if there is an n such that phi(n)=m, then there are at least two solutions n. This assertion is called ...

A differential evolution method used to minimize functions of real variables. Evolution strategies are significantly faster at numerical optimization than traditional genetic ...

The study of groups. Gauss developed but did not publish parts of the mathematics of group theory, but Galois is generally considered to have been the first to develop the ...

Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...

An indicial equation, also called a characteristic equation, is a recurrence equation obtained during application of the Frobenius method of solving a second-order ordinary ...

Nonhomogeneous matrix equations of the form Ax=b (1) can be solved by taking the matrix inverse to obtain x=A^(-1)b. (2) This equation will have a nontrivial solution iff the ...

Maximum likelihood, also called the maximum likelihood method, is the procedure of finding the value of one or more parameters for a given statistic which makes the known ...

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...