Journal of the Chungcheong Mathematical Society (충청수학회지)

The Chungcheong Mathematical Society (충청수학회)
권호 표지

SOME ALGORITHMS OF THE BEST SIMULTANEOUS APPROXIMATION

  • Rhee, Hyang J. (College of Natural Sciences Duksung Women's University)
  • Received : 2008.11.20
  • Accepted : 2009.03.05
  • Published : 2009.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

We consider various algorithms calculating best onesided simultaneous approximations. We assume that X is a compact subset of $\mathbb{R}^{m}$ satisfying $X=\overline{intX}$, S is an n-dimensional subspace of C(X), and $\mu$ is any 'admissible' measure on X. For any l-tuple $f_1,\;{\cdots},\;f_{\ell}$ 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.

Keywords

Acknowledgement

Supported by : Duksung Women's University

References

  1. Y. Censor, T. Elfving and G. T. Herman, Averaging strings of sequential iterations for convex feasibility problems, Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (2001), 101–114.
  2. L. Elsner, I. Koltracht and M. Neumann, Convergence of sequential and asynchronous nonlinear paracontractions, Numerische mathematik 62 (1992), 305–319.
  3. A. S. Holland, B. N. Sahney and J. Tzimbalario, On best simultaneous approximation, J. Approx. Theory 17 (1976), 187–188.
  4. H. N. Mhaskar and D. V. Pai, Fundamentals of approximation theory, CRC Press, 2000.
  5. A. Pinkus, On L$_{1}$-approximation, Cambridge Tracts in Mathematics, 93, Cambridge University Press, Cambridge-New York, 1989.
  6. H. J. Rhee, An algorithm of the one-sided best simultaneous approximation, K. Ann. Math. 24 (2007), 69–79.
  7. I. Singer, Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces, Springer-Verlag, New York, 1970.