- value of polynomial
- мат. значение многочлена
Большой англо-русский и русско-английский словарь. 2001.
value of polynomial
Смотреть что такое "value of polynomial" в других словарях:
Polynomial function theorems for zeros — are a set of theorems aiming to find (or determine the nature) of the complex zeros of a polynomial function.Found in most precalculus textbooks, these theorems include: * Remainder theorem * Factor theorem * Descartes rule of signs * Rational… … Wikipedia
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 ring — In mathematics, especially in the field of abstract algebra, a polynomial ring is a ring formed from the set of polynomials in one or more variables with coefficients in another ring. Polynomial rings have influenced much of mathematics, from the … Wikipedia
Polynomial and rational function modeling — In statistical modeling (especially process modeling), polynomial functions and rational functions are sometimes used as an empirical technique for curve fitting.Polynomial function modelsA polynomial function is one that has the form:y = a… … Wikipedia
Polynomial time — In computational complexity theory, polynomial time refers to the computation time of a problem where the run time, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically using big O notation, this states … Wikipedia
Polynomial expression — In mathematics, and in particular in the field of algebra, a polynomial expression in one or more given entities E 1, E 2, ..., is any meaningful expression constructed from copies of those entities together with (usually numeric) constants,… … 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
Newton polynomial — In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is the interpolation polynomial for a given set of data points in the Newton form. The Newton polynomial is sometimes called Newton s… … 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
Wilkinson's polynomial — In numerical analysis, Wilkinson s polynomial is a specific polynomial which was used by James H. Wilkinson in 1963 to illustrate a difficulty when finding the root of a polynomial: the location of the roots can be very sensitive to perturbations … Wikipedia
