Approximation with Convex Constraints.
BROWN UNIV PROVIDENCE R I DIV OF APPLIED MATHEMATICS
Pagination or Media Count:
The basic problem considered in this paper is the approximation of a given function in a normed linear space by simpler functions in a finite dimensional linear subspace which also satisfy certain constraints, or side conditions. A satisfactory study of a specific problem would include the existence and uniqueness of a best approximation, some distinguishing property which characterizes a best approximation, and algorithms for computing numerically a best approximation. The most intuitively appealing and complete results are obtained when the measure of approximation is the uniform norm. Author
- Theoretical Mathematics