학술저널
TWO-SIDED BEST SIMULTANEOUS APPROXIMATION
- 충청수학회
- Journal of the Chungcheong Mathematical Society
- Volume 23, No. 4
-
2010.12705 - 710 (6 pages)
- 2
Let C1(X) be a normed linear space over Rm, and S be an n-dimensional subspace of C1(X) with spaned by fs1; ¢ ¢ ¢ ; sng. For each `¡ tuple vectors F in C1(X), the two-sided best simulta- neous approximation problem is min s2S ` max i=1 fjjfi ¡ sjj1g: A s 2 S attaining the above minimum is called a two-sided best si- multaneous approximation or a Chebyshev center for F = ff1; ¢ ¢ ¢ ; f`g from S. This paper is concerned with algorithm for calculating two- sided best simultaneous approximation, in the case of continuous functions.
1. Introduction
2. Two-sided best simultaneous approximation
References
(0)
(0)