Search Results for ""
41 - 50 of 600 for Quadratic ProgrammingSearch Results
A quadratic form Q(z) is said to be positive definite if Q(z)>0 for z!=0. A real quadratic form in n variables is positive definite iff its canonical form is ...
The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...
A number D that possesses no common divisor with a prime number p is either a quadratic residue or nonresidue of p, depending whether D^((p-1)/2) is congruent mod p to +/-1.
The quadratic class number constant is a constant related to the average behavior of class numbers of real quadratic fields. It is given by Q = product_(p)[1-1/(p^2(p+1))] ...
Given a simple harmonic oscillator with a quadratic perturbation, write the perturbation term in the form alphaepsilonx^2, x^..+omega_0^2x-alphaepsilonx^2=0, (1) find the ...
Somos's quadratic recurrence constant is defined via the sequence g_n=ng_(n-1)^2 (1) with g_0=1. This has closed-form solution ...
A precise sequence of instructions designed to accomplish a given task. The implementation of an algorithm on a computer using a programming language is an example of a ...
An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...
A program initiated by F. Klein in an 1872 lecture to describe geometric structures in terms of their automorphism groups.
Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...
...
View search results from all Wolfram sites (157622 matches)

