TOPICS
Search

Search Results for ""


31 - 40 of 600 for Quadratic ProgrammingSearch Results
The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...
If A=(a_(ij)) is a diagonal matrix, then Q(v)=v^(T)Av=suma_(ii)v_i^2 (1) is a diagonal quadratic form, and Q(v,w)=v^(T)Aw is its associated diagonal symmetric bilinear form. ...
To find the minimum distance between a point in the plane (x_0,y_0) and a quadratic plane curve y=a_0+a_1x+a_2x^2, (1) note that the square of the distance is r^2 = ...
Given a general quadratic curve Ax^2+Bxy+Cy^2+Dx+Ey+F=0, (1) the quantity X is known as the discriminant, where X=B^2-4AC, (2) and is invariant under rotation. Using the ...
The determinant of a binary quadratic form Au^2+2Buv+Cv^2 is defined as D=AC-B^2. It is equal to 1/4 of the corresponding binary quadratic form discriminant. Unfortunately, ...
The discriminant of a binary quadratic form au^2+buv+cv^2 is defined by d=4ac-b^2. It is equal to four times the corresponding binary quadratic form determinant. ...
The use of three prior points in a root-finding algorithm to estimate the zero crossing.
A transformation of a hypergeometric function,
A quadratic form Q(x) is said to be positive semidefinite if it is never <0. However, unlike a positive definite quadratic form, there may exist a x!=0 such that the form is ...
Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...
1|2|3|4|5|6|7 ... 60 Previous Next

...