Communications on Pure & Applied Analysis · 2008 · 277 citations · 16 references
ComputingComputer ScienceMathematicsAlgorithmsOptimizationSet TheoryApproximation AlgorithmsInterpolation TechniquesInterpolation AlgorithmsInterpolation FunctionsInterpolation TheoryLinear Interpolation
Lagrangian interpolation is a classical way to approximate generalfunctions by finite sums of well chosen, pre-defined, linearlyindependent interpolating functions; it is much simpler to implement thandetermining the best fits with respect to some Banach (or even Hilbert)norms. In addition, only partial knowledge is required (here values on someset of points). The problem of defining the best sample of points isnevertheless rather complex and is in general open. In this paper wepropose a way to derive such sets of points. We do not claim that thepoints resulting from the construction explained here are optimal in anysense. Nevertheless, the resulting interpolation method is proven to work under certain hypothesis, theprocess is very general and simple to implement, and compared to situationswhere the best behavior is known, it is relatively competitive.
16
n-Widths in Approximation Theory.
Klaus Höllig, Allan Pinkus · Mathematics of Computation · 1986 · 747 citations
Christophe Prud'Homme, Dimitrios Rovas, Karen Veroy et al. · Journal of Fluids Engineering · 2001 · 571 citations · Full text
Computing, Computational Engineering, Finite Element Analysis +16
Karen Veroy, Christophe Prud'Homme, Dimitrios Rovas et al. · 16th AIAA Computational Fluid Dynamics Conference · 2003 · 257 citations · Full text
Computing, Computational Engineering, Computational Mechanics +16