Piecewise polynomial approximation of the sixth order with automatic knots detection

MaRDI QIDQ2934313zbMATH OpenFDO

Authors N. D. Dikusar

Publication date 12 December 2014

zbMATH Keywords

basic elements methodefficiency of algorithmsinterpolationleast squares methodoptimal knot selectionpiecewise polynomial approximationsmoothing

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)

Recommendations

• Automatic knot finding for piecewise cubic approximation
• Algorithms for Piecewise Polynomials and Splines with Free Knots
• The basic element method
• Polynomial approximation of the high order
• scientific article; zbMATH DE number 45570

Cited in

(2)

• The basic element method
• Numerical solution of the Cauchy problem based on the basic element method;Численное решение задачи Коши на основе метода базисных элементов

This page was built for publication: Piecewise polynomial approximation of the sixth order with automatic knots detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934313)