- quadratic function
Wikipedia foundation.
quadratic function
Look at other dictionaries:
Quadratic function — A quadratic function, in mathematics, is a polynomial function of the form f(x)=ax^2+bx+c ,!, where a e 0 ,!. The graph of a quadratic function is a parabola whose major axis is parallel to the y axis.The expression ax^2+bx+c in the definition of … Wikipedia
Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… … Wikipedia
Quadratic equation — This article is about quadratic equations and solutions. For more general information about quadratic functions, see Quadratic function. For more information about quadratic polynomials, see Quadratic polynomial. In mathematics, a quadratic… … Wikipedia
Quadratic — In mathematics, the term quadratic describes something that pertains to squares, to the operation of squaring, to terms of the second degree, or equations or formulas that involve such terms. Quadratus is Latin for square . Mathematics Algebra… … Wikipedia
Quadratic polynomial — In mathematics, a quadratic polynomial is a polynomial whose degree is 2. A quadratic polynomial with three terms is called a quadratic trinomial. Some examples of quadratic polynomials are ax 2 + bx + c , 2 x 2 − y 2, and xy + xz + yz… … Wikipedia
quadratic programming — Variant of linear programming in which the objective function is quadratic rather than linear. In portfolio selection, we often minimize the variance of the portfolio (which is a quadratic function) subject to constraints on the mean return of… … Financial and business terms
quadratic — adjective Date: 1668 involving terms of the second degree at most < quadratic function > < quadratic equations > • quadratic noun • quadratically adverb … New Collegiate Dictionary
Quadratic probing — is a scheme in computer programming for resolving collisions in hash tables.Quadratic probing operates by taking the original hash value and adding successive values of an arbitrary quadratic polynomial to the starting value. This algorithm is… … Wikipedia
Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… … Wikipedia
Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… … Wikipedia
