A KIND OF BEST APPROXIMATION USING FUNCTION PAIRS

Ye ShiChinese 1982

Abstract

This paper discusses the minimization problem: For a Given n-dimensional subspace K and a function f of C(X), find a function pair (p_1, p_2)∈K×K, p_1≥f≥p_2 suoh that‖p_1-p_2‖=(?)‖q_1-q_2‖. We call such a pair (p_1, p_2) (if any) a best approximation pair to f from K.This paper has proved a characterization theorem for best L_1 approximation pairs which says that (p_1, p_2)is a best L_1 approximation pair if and only if p_1 and p_2 are respectively an upper sided and a lower sided best L_1 approximation to f.With the provisos that K is a Haar subspace and thet 1∈K it turns out that the above conclusion of the characterization theorem for best L_∞ approximation pairs is also true. However we have further established, without the provisos at all, a complete characterization theorem for best L_∞ approximation pairs.Furthermore, sufficient conditions for uniqueness of best L_∞ approximation pairs are also given.
BibTeX
@inproceedings{shi1982kind,
  author = {Ye Shi},
  title = {{A KIND OF BEST APPROXIMATION USING FUNCTION PAIRS}},
  booktitle = {Chinese},
  year = {1982},
}

Loading related content...

Figure