Search Results for ""

A method which can be used to solve some classes of integral equations and is especially useful in implementing certain types of data inversion. It has been applied to invert ...

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...

The property of certain algorithms that accurate answers are returned for well-conditioned problems, and the inaccuracy of the answers returned for ill-conditioned problems ...

A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.

Every irrational number x has an approximation constant c(x) defined by c(x)=lim inf_(q->infty)q|qx-p|, where p=nint(qx) is the nearest integer to qx and lim inf is the ...

A Bäcklund transformation allows additional solutions to a nonlinear partial differential equations to be found if one particular solution is already known.

The Baer differential equation is given by while the Baer "wave equation" is (Moon and Spencer 1961, pp. 156-157; Zwillinger 1997, p. 121).

Baer's criterion, also known as Baer's test, states that a module M over a unit ring R is injective iff every module homomorphism from an ideal of R to M can be extended to a ...

A puzzle involving disentangling a set of rings from a looped double rod, originally used by French peasants to lock chests (Steinhaus 1999). The word "baguenaudier" means ...

The Bailey mod 9 identities are a set of three Rogers-Ramanujan-like identities appearing as equations (1.6), (1.8), and (1.7) on p. 422 of Bailey (1947) given by A(q) = ...