DOI QR코드

DOI QR Code

REMARK FOR CALCULATING THE BEST SIMULTANEOUS APPROXIMATIONS

  • 투고 : 2010.03.08
  • 심사 : 2010.08.12
  • 발행 : 2010.09.30

초록

This paper is concerned with algorithm for calculating one-sided best simultaneous approximation, in the case of continuous functions. we will apply any subgradient algorithm. In other words, we consider the algotithms from a mathematical, rather then computational, point of view.

키워드

참고문헌

  1. L. Elsner, I. Koltracht and M. Neumann, Convergence of sequential and asyn- chronous nonlinear paracontractions, Numerische mathematik 62 (1992), 305- 319. https://doi.org/10.1007/BF01396232
  2. S. H. Park and H. J. Rhee, Characterization of best simultaneous approximation for a compact set, Bull K. Math. Soc. 33 (1996), 435-444.
  3. S. H. Park and H.J. Rhee, One-sided best simultaneous L1-approximation, J. K. Math. Soc. 33 (1996), 155-167.
  4. A. Pinkus, On $L_1$-approximation, Cambridge Tracts in Mathematics, 93 Cam- bridge University Press, Cambridge-New York, 1989.
  5. H. J. Rhee , An algorithm of the one-sided best simultaneous approximation, K. Ann. Math. 24 (2007), 69-79.
  6. I. Singer , Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces, Springer-Verlag, New York, 1970.