Search Results for ""

The Fourier sine transform is the imaginary part of the full complex Fourier transform, F_x^((s))[f(x)](k) = I[F_x[f(x)](k)] (1) = int_(-infty)^inftysin(2pikx)f(x)dx. (2) The ...

Let {a_n} be a nonnegative sequence and f(x) a nonnegative integrable function. Define A_n=sum_(k=1)^na_k (1) and F(x)=int_0^xf(t)dt (2) and take p>1. For sums, ...

Hermite-Gauss quadrature, also called Hermite quadrature, is a Gaussian quadrature over the interval (-infty,infty) with weighting function W(x)=e^(-x^2) (Abramowitz and ...

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...

The multinomial coefficients (n_1,n_2,...,n_k)!=((n_1+n_2+...+n_k)!)/(n_1!n_2!...n_k!) (1) are the terms in the multinomial series expansion. In other words, the number of ...

In functional analysis, the term "Poincaré-Friedrichs inequality" is a term used to describe inequalities which are qualitatively similar to the classical Poincaré Inequality ...

In its simplest form, the principle of permanence states that, given any analytic function f(z) defined on an open (and connected) set U of the complex numbers C, and a ...

The pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

A stochastic approximation method that functions by placing conditions on iterative step sizes and whose convergence is guaranteed under mild conditions. However, the method ...