On optimal choice of nodes when approximating functions by interpolation splines
From MaRDI portal
Recommendations
Cited in
(17)- Application of variable nodes in approximation of a function
- Asymptotically optimal disposition of tangent points for approximation of smooth convex surfaces by polygonal functions
- Asymptotically optimum recovery of smooth contours by Bézier curve
- Stable interpolation with exponential-polynomial splines and node selection via greedy algorithms
- On node distributions for interpolation and spectral methods
- scientific article; zbMATH DE number 4198712 (Why is no real title available?)
- scientific article; zbMATH DE number 4206239 (Why is no real title available?)
- scientific article; zbMATH DE number 3899481 (Why is no real title available?)
- An example of optimal nodes for interpolation
- Survey of input optimization1
- Computing a spline with quasi-optimal nodes
- scientific article; zbMATH DE number 48480 (Why is no real title available?)
- Optimal Nodes for Interpolatory Product Integration
- scientific article; zbMATH DE number 4002723 (Why is no real title available?)
- scientific article; zbMATH DE number 4118885 (Why is no real title available?)
- An asymptotically optimal cubic spline
- On the relationship between functions with the same optimal knots in spline and piecewise polynomial approximation
This page was built for publication: On optimal choice of nodes when approximating functions by interpolation splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3708492)
