SOME ALGORITHMS OF THE BEST SIMULTANEOUS APPROXIMATION

• 발행기관: 충청수학회
• 저자명: Hyang J. Rhee
• 간행물 정보: 『Journal of the Chungcheong Mathematical Society』Volume 22, No. 2, 141~148쪽, 전체 8쪽
• 주제분류: 자연과학 > 자연과학일반
• 파일형태: PDF
• 발행일자: 2009.06.30

영문 초록

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