학술저널
SOME ALGORITHMS OF THE BEST SIMULTANEOUS APPROXIMATION
- 충청수학회
- Journal of the Chungcheong Mathematical Society
- Volume 22, No. 2
-
2009.06141 - 148 (8 pages)
- 0
We consider various algorithms calculating best onesided simultaneous approximations. We assume that X is a compact subset of Rm satisfying X = intX, S is an n-dimensional subspace of C(X), and μ is any ’admissible’ measure on X. For any l−tuple f1, · · · , f` in C(X), we present various ideas for best approximation to F from S(F). The problem of best (both one and two-sided) approximation is a linear programming problem.
1. Introduction
2. A convergent sequence {m}
3. The convergence result
References
(0)
(0)