TOPICS
Search

Search Results for ""


381 - 390 of 600 for Quadratic ProgrammingSearch Results
The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...
Expressions of the form lim_(k->infty)x_0+sqrt(x_1+sqrt(x_2+sqrt(...+x_k))) (1) are called nested radicals. Herschfeld (1935) proved that a nested radical of real nonnegative ...
An orthogonal coordinate system is a system of curvilinear coordinates in which each family of surfaces intersects the others at right angles. Orthogonal coordinates ...
The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...
A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...
Pre-Calculus
In general, polynomial equations higher than fourth degree are incapable of algebraic solution in terms of a finite number of additions, subtractions, multiplications, ...
Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...
An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...
A Cartan matrix is a square integer matrix who elements (A_(ij)) satisfy the following conditions. 1. A_(ij) is an integer, one of {-3,-2,-1,0,2}. 2. A_(ii)=2 the diagonal ...
1 ... 36|37|38|39|40|41|42 ... 60 Previous Next

...