Discretization with interpolating approximation
We approximate by a family (F,P) varisolvent in the sense of Rice on X, a closed subset of a closed interval [\(\alpha\),\(\beta\) ]. The norm is the uniform norm on C(X) and the constraint is, for a fixed m-point subset Z of X, \(F(A,z)=f(z)\), \(z\in Z\), where f is the function being approximated. Theorem. Let f have a best approximation F(A,.) on [\(\alpha\),\(\beta\) ] of maximal degree. There exists \(\delta >0\) such that if the density of X is less than \(\delta\), a best approximation exists on X. If \(\{X_ k\}\to [\alpha,\beta]\) and \(F(A_ k,.)\) is best on \(X_ k\), then \(\| F(A,.)-F(A_ k,.)\| \to 0.\) Examples are given to show that the hypothesis of maximum degree cannot be dropped.
- Alternating Chebyshev Approximation
- Best non-linear uniform approximation with interpolation
- Discrete NonlinearLp Approximation, 0<p≤1
- Eine varisolvente Familie, welche des Phänomen der konstanten Fehlerkurve zuläßt
- scientific article; zbMATH DE number 3295416 (Why is no real title available?)
- Tchebycheff Approximations by Functions Unisolvent of Variable Degree
- A discrete monotonous interpolation scheme
- A discrete trigonometric interpolation method
- scientific article; zbMATH DE number 3912940 (Why is no real title available?)
- scientific article; zbMATH DE number 562331 (Why is no real title available?)
- Localized Discrete Empirical Interpolation Method
- Measuring Disagreement with Interpolants
- Discretization for uniform polynomial approximation
This page was built for publication: Discretization with interpolating approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092348)