TWO-SIDED BEST SIMULTANEOUS APPROXIMATION

• 발행기관: 충청수학회
• 저자명: Hyang Joo Rhee
• 간행물 정보: 『Journal of the Chungcheong Mathematical Society』Volume 23, No. 4, 705~710쪽, 전체 6쪽
• 주제분류: 자연과학 > 자연과학일반
• 파일형태: PDF
• 발행일자: 2010.12.30

영문 초록

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