polynomial solution
Смотреть что такое "polynomial solution" в других словарях:
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… … Wikipedia
Solution set — In mathematics, a solution set is a set of possible values that a variable can take on in order to satisfy a given set of conditions (which may include equations and inequalities).Formally, for a collection of polynomials {f i} over some ring R,… … Wikipedia
Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… … Wikipedia
Polynomial Diophantine equation — In mathematics, a polynomial Diophantine equation is an indeterminate polynomial equation whose solutions are restricted to be polynomials in the indeterminate. A Diophantine equation, in general, is one where the solutions are restricted to some … Wikipedia
Polynomial remainder theorem — The polynomial remainder theorem in algebra is an application of polynomial long division. It states that the remainder, r,, of a polynomial, f(x),, divided by a linear divisor, x a,, is equal to f(a) ,.This follows from the definition of… … Wikipedia
Tchebycheff polynomial — Math. a polynomial solution of the Tchebycheff equation, of the form Tn(x) = cos(n cos 1x), where n is an integer. Also called Chebyshev polynomial. [see TCHEBYCHEFF EQUATION] * * * … Universalium
Tchebycheff polynomial — Math. a polynomial solution of the Tchebycheff equation, of the form Tn(x) = cos(n cos 1x), where n is an integer. Also called Chebyshev polynomial. [see TCHEBYCHEFF EQUATION] … Useful english dictionary
Lagrange polynomial — In numerical analysis, a Lagrange polynomial, named after Joseph Louis Lagrange, is the interpolation polynomial for a given set of data points in the Lagrange form. It was first discovered by Edward Waring in 1779 and later rediscovered by… … Wikipedia
Dickson polynomial — In mathematics, the Dickson polynomials, denoted Dn(x,α), form a polynomial sequence studied by L. E. Dickson (1897). Over the complex numbers, Dickson polynomials are essentially equivalent to Chebyshev polynomials with a change of variable … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
