# polynomial approximation

• 1 polynomial approximation

аппроксимация при помощи полинома
полиномиальное приближение

[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]

### EN

• 2 polynomial approximation

полиномиальная аппроксимация, полиномиальное приближение
см. тж. approximation
• 3 polynomial approximation

полиномиальная аппроксимация; полиномиальное приближение

• 4 polynomial approximation

• 5 polynomial approximation

• 6 polynomial approximation

• 7 polynomial approximation

• 8 polynomial approximation

• 9 polynomial approximation

• 10 polynomial approximation

多項式近似法
• 11 polynomial approximation

аппроксимация полиномами, полиномиальная аппроксимация
• 12 polynomial approximation

• 13 polynomial approximation

polinomska aproksimacija
• 14 polynomial approximation

• 15 polynomial approximation

полиномиальная аппроксимация, полиномиальное приближение
• 16 polynomial approximation

przybliżenie wielomianowe
• 17 polynomial approximation

• 18 polynomial approximation

аппроксимация при помощи полиномов; полиномиальная аппроксимация; полиномиальное приближение
• 19 polynomial approximation

பல்லுறுப்புக்கோவையண்ணளவு
• 20 polynomial approximation

полиномиальная аппроксимация, полиномиальное приближение

### Look at other dictionaries:

• Approximation theory — In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by best and simpler will depend on …   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

• 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

• Approximation algorithm — In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP hard problems; since it is unlikely that there …   Wikipedia

• Approximation theory/Proofs — Proof that an N th degree polynomial that gives rise to an error function that has N + 2 maxima, of alternating signs and equal magnitudes, is optimal in the sense of approximation theory. Such an optimal polynomial gives the minimum value, over… …   Wikipedia

• Minimax approximation algorithm — Polynomial expansions such as the Taylor series expansion are often convenient for theoretical work but less useful for practical applications. For practical work it is often desirable to minimize the maximum absolute or relative error of a… …   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

• Orders of approximation — In science, engineering, and other quantitative disciplines, orders of approximation refer to formal or informal terms for how precise an approximation is, and to indicate progressively more refined approximations: in increasing order of… …   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

• Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique …   Wikipedia

• Bernstein polynomial — In the mathematical field of numerical analysis, a Bernstein polynomial, named after Sergei Natanovich Bernstein, is a polynomial in the Bernstein form, that is a linear combination of Bernstein basis polynomials.A numerically stable way to… …   Wikipedia