Search Results for ""

Given a function f(x)=f_0(x), write f_1=f^'(x) and define the Sturm functions by f_n(x)=-{f_(n-2)(x)-f_(n-1)(x)[(f_(n-2)(x))/(f_(n-1)(x))]}, (1) where [P(x)/Q(x)] is a ...

An inverse function of an Abelian integral. Abelian functions have two variables and four periods, and can be defined by Theta(v,tau;q^'; ...

An algorithm similar to Neville's algorithm for constructing the Lagrange interpolating polynomial. Let f(x|x_0,x_1,...,x_k) be the unique polynomial of kth polynomial order ...

An algorithm which extrapolates the partial sums s_n of a series sum_(n)a_n whose convergence is approximately geometric and accelerates its rate of convergence. The ...

The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...

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 apodization function f(x)=1-(|x|)/a (1) which is a generalization of the one-argument triangle function. Its full width at half maximum is a. It has instrument function ...

Let A and B_j be sets. Conditional probability requires that P(A intersection B_j)=P(A)P(B_j|A), (1) where intersection denotes intersection ("and"), and also that P(A ...

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...

A boundary value problem is a problem, typically an ordinary differential equation or a partial differential equation, which has values assigned on the physical boundary of ...