Sign-sensitive approximations
From MaRDI portal
This paper investigates sign-sensitive approximation in details and establishes the Chebyshev theory for such approximations, including existence, uniqueness, alternation characterization, as well as continuity of the best approximation, etc. In sign-sensitive approximations, the size of the deviation of approximation takes into account not only the modulus of the approximation error, but also its sign (which can be important in practice).
Recommendations
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 3816450 (Why is no real title available?)
- scientific article; zbMATH DE number 3755177 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3539771 (Why is no real title available?)
- scientific article; zbMATH DE number 738924 (Why is no real title available?)
- scientific article; zbMATH DE number 194458 (Why is no real title available?)
- scientific article; zbMATH DE number 774589 (Why is no real title available?)
- scientific article; zbMATH DE number 3213825 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- scientific article; zbMATH DE number 3046601 (Why is no real title available?)
- On the definition of Chebyshev's snakes
Cited in
(5)- scientific article; zbMATH DE number 177865 (Why is no real title available?)
- scientific article; zbMATH DE number 738924 (Why is no real title available?)
- Haar problem for sign-sensitive approximations
- Approximations with a sign-sensitive weight. Stability, applications to the theory of snakes and Hausdorff approximations
- scientific article; zbMATH DE number 7377775 (Why is no real title available?)
This page was built for publication: Sign-sensitive approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273571)