Search Results for ""
91 - 100 of 1777 for Well DefinedSearch Results
![](/common/images/search/spacer.gif)
The (n+1)×(n+1) tridiagonal matrix (also called the Clement matrix) defined by S_n=[0 n 0 0 ... 0; 1 0 n-1 0 ... 0; 0 2 0 n-2 ... 0; | | ... ... ... |; 0 0 0 n-1 0 1; 0 0 0 0 ...
Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the local discrepancy is defined as D(J,P)=|(number of x_n in J)/N-Vol(J)|, Vol(J) is the ...
A moment sequence is a sequence {mu_n}_(n=0)^infty defined for n=0, 1, ... by mu_n=int_0^1t^ndalpha(t), where alpha(t) is a function of bounded variation in the interval ...
One of the eight regions of space defined by the eight possible combinations of signs (+/-,+/-,+/-) for x, y, and z.
Coordinates defined by an orthocentric system.
The term "over" is commonly used in mathematical exposition as a synonym for "in the domain of." So, for example, "Let f be a function over the reals" means "Let f be a ...
A signal sampled at a frequency higher than the Nyquist frequency is said to be oversampled beta times, where the oversampling ratio is defined as ...
The Owen T-function is defined as T(x,a)=1/(2pi)int_0^a(e^(-x^2(1+t^2)/2))/(1+t^2)dt. It is implemented in the Wolfram Language as OwenT[x, a]. A special value is given by ...
A point x_0 is said to be a periodic point of a function f of period n if f^n(x_0)=x_0, where f^0(x)=x and f^n(x) is defined recursively by f^n(x)=f(f^(n-1)(x)).
A smooth manifold with a Poisson bracket defined on its function space.
![](/common/images/search/spacer.gif)
...