Search Results for ""

A method for numerical solution of a second-order ordinary differential equation y^('')=f(x,y) first expounded by Gauss. It proceeds by introducing a function delta^(-2)f ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

A method for finding roots of a polynomial equation f(x)=0. Now find an equation whose roots are the roots of this equation diminished by r, so (1) The expressions for f(r), ...

Any method which solves a problem by generating suitable random numbers and observing that fraction of the numbers obeying some property or properties. The method is useful ...

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...

The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...

A diagonal of a square matrix which is traversed in the "northeast" direction. "The" skew diagonal (or "secondary diagonal") of an n×n square matrix is the skew diagonal from ...

A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...