- approximation theorem
-
теорема аппроксимации
Англо-русский словарь технических терминов. 2005.
approximation theorem
Смотреть что такое "approximation theorem" в других словарях:
Dirichlet's approximation theorem — In number theory, Dirichlet s theorem on Diophantine approximation, also called Dirichlet s approximation theorem, states that for any real number α and any positive integer N, there exists integers p and q such that 1 ≤ q ≤ N and This is a… … Wikipedia
Universal approximation theorem — In the mathematical theory of neural networks, the universal approximation theorem states[1] that the standard multilayer feed forward network with a single hidden layer that contains finite number of hidden neurons, and with arbitrary activation … Wikipedia
Simplicial approximation theorem — In mathematics, the simplicial approximation theorem is a foundational result for algebraic topology, guaranteeing that continuous mappings can be (by a slight deformation) approximated by ones that are piecewise of the simplest kind. It applies… … Wikipedia
Artin approximation theorem — In mathematics, the Artin approximation theorem is a fundamental result of Michael Artin in deformation theory which implies that formal power series with coefficients in a field k are well approximated by the algebraic functions on k .tatement… … Wikipedia
Weierstrass approximation theorem — Math. the theorem that for any continuous function on a closed interval, there is a polynomial such that the difference in values of the function and the polynomial at each point in the interval is less in absolute value than some positive number … Universalium
Weierstrass approximation theorem — Math. the theorem that for any continuous function on a closed interval, there is a polynomial such that the difference in values of the function and the polynomial at each point in the interval is less in absolute value than some positive number … Useful english dictionary
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
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 in algebraic groups — In mathematics, strong approximation in linear algebraic groups is an important arithmetic property of matrix groups. In rough terms, it explains to what extent there can be an extension of the Chinese remainder theorem to various kinds of… … Wikipedia
Approximation de Bernstein — En analyse, l approximation de Bernstein est une méthode d approximation polynomiale, permettant d approcher uniformément une fonction continue f définie sur l intervalle [0,1] par une suite de combinaisons linéaires des polynômes de Bernstein.… … Wikipédia en Français
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
