Search Results for ""

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

A line bundle is a special case of a vector bundle in which the fiber is either R, in the case of a real line bundle, or C, in the case of a complex line bundle.

The ring of integers of a number field K, denoted O_K, is the set of algebraic integers in K, which is a ring of dimension d over Z, where d is the extension degree of K over ...

Metamathematics is another word for proof theory. The branch of logic dealing with the study of the combination and application of mathematical symbols is also sometimes ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...

A regression giving conditional expectation values of a given variable in terms of two or more other variables.

A function f(x) is said to be nondecreasing on an interval I if f(b)>=f(a) for all b>a, where a,b in I. Conversely, a function f(x) is said to be nonincreasing on an interval ...