Search Results for ""
21 - 30 of 600 for Quadratic ProgrammingSearch Results
For a quadratic form Q in the canonical form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2, the rank is the total number r of square terms (both positive and ...
A quadratic field Q(sqrt(D)) with D>0.
A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...
The signature of a non-degenerate quadratic form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2 of rank r is most often defined to be the ordered pair (p,q)=(p,r-p) of ...
An imaginary quadratic field is a quadratic field Q(sqrt(D)) with D<0. Special cases are summarized in the following table. D field members -1 Gaussian integer -3 Eisenstein ...
A method to obtain a signal C_l(z) with a flat spectrum c(theta;z) (such as a pulse), but having a smaller amplitude than the pulse. ...
If p and q are distinct odd primes, then the quadratic reciprocity theorem states that the congruences x^2=q (mod p) x^2=p (mod q) (1) are both solvable or both unsolvable ...
The index I associated to a symmetric, non-degenerate, and bilinear g over a finite-dimensional vector space V is a nonnegative integer defined by I=max_(W in S)(dimW) where ...
A congruence of the form ax^2+bx+c=0 (mod m), (1) where a, b, and c are integers. A general quadratic congruence can be reduced to the congruence x^2=q (mod p) (2) and can be ...
The quantity ps-rq obtained by letting x = pX+qY (1) y = rX+sY (2) in ax^2+2bxy+cy^2 (3) so that A = ap^2+2bpr+cr^2 (4) B = apq+b(ps+qr)+crs (5) C = aq^2+2bqs+cs^2 (6) and ...
...
View search results from all Wolfram sites (157622 matches)

