𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Interpolation and Approximation from Convex Sets

✍ Scribed by Bernd Mulansky; Marian Neamtu


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
400 KB
Volume
92
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

✦ Synopsis


We derive conditions which guarantee that the set B & A &1 (d ) is nonempty and dense in C & A &1 (d ). Some applications to shape preserving interpolation and approximation are described.


πŸ“œ SIMILAR VOLUMES


Best Approximation on Convex Sets in Met
✍ G. C. Ahuja; T. D. Narang; Swaran Trehan πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 256 KB

## Abstract In this paper the concepts of strictly convex and uniformly convex normed linear spaces are extended to metric linear spaces. A relationship between strict convexity and uniform convexity is established. Some existence and uniqueness theorems on best approximation in metric linear space

Multilevel Interpolation and Approximati
✍ F.J. Narcowich; R. Schaback; J.D. Ward πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 159 KB

Interpolation by translates of a given radial basis function (RBF) has become a well-recognized means of fitting functions sampled at scattered sites in R d . A major drawback of these methods is their inability to interpolate very large data sets in a numerically stable way while maintaining a good

Approximation and Learning of Convex Sup
✍ Leonid Gurvits; Pascal Koiran πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 411 KB

We present a fairly general method for constructing classes of functions of finite scale-sensitive dimension (the scale-sensitive dimension is a generalization of the Vapnik Chervonenkis dimension to realvalued functions). The construction is as follows: start from a class F of functions of finite V