Difference between revisions of "Element of best approximation"
(Importing text file) |
(MSC 41A50) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | + | {{TEX|done}}{{MSC|41A50}} | |
− | + | An element $u_0$ in a given set $F$ that is a [[best approximation]] to a given element $x$ in a [[metric space]] $X$, i.e. is such that | |
− | + | $$ | |
− | This is a generalization of the classical concept of a [[ | + | \rho(u_0,x) = \inf \{ \rho(u,x) : x \in F \} \ . |
+ | $$ | ||
+ | This is a generalization of the classical concept of a [[polynomial of best approximation]]. The main questions concerning elements of best approximation are: their existence and uniqueness, their characteristic properties (see [[Chebyshev theorem]]), the properties of the operator that associates with each element $x \in X$ the set of elements of best approximation (see [[Metric projection]]; [[Approximately-compact set]]), and numerical methods for the construction of elements of best approximation. |
Latest revision as of 20:09, 27 December 2014
2020 Mathematics Subject Classification: Primary: 41A50 [MSN][ZBL]
An element $u_0$ in a given set $F$ that is a best approximation to a given element $x$ in a metric space $X$, i.e. is such that $$ \rho(u_0,x) = \inf \{ \rho(u,x) : x \in F \} \ . $$ This is a generalization of the classical concept of a polynomial of best approximation. The main questions concerning elements of best approximation are: their existence and uniqueness, their characteristic properties (see Chebyshev theorem), the properties of the operator that associates with each element $x \in X$ the set of elements of best approximation (see Metric projection; Approximately-compact set), and numerical methods for the construction of elements of best approximation.
Element of best approximation. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Element_of_best_approximation&oldid=18961