Method of optimal placement of approximation nodes

MaRDI QIDQ6890378zbMATH OpenFDO

Authors Evgeniĭ Viktorovich Konopatskiĭ, Ol'ga Viktorovna Kotova

Publication date 3 December 2025

Published in Zhurnal Srednevolzhskogo Matematicheskogo Obshchestva (Search for Journal in Brave)

zbMATH Keywords

approximationapproximation errorapproximation nodesinterpolationoptimal node placementRunge's functionuniform partitioning

Mathematics Subject Classification ID

Approximation by polynomials (41A10)

Cites work

• Approximation by elementary functions for the solution of meteor physics equations
• On a Lebesgue constant of interpolation rational process at the Chebyshev-Markov nodes
• On the approximation of conjugate functions and their derivatives on the segment by partial sums of Fourier-Chebyshev series
• Smooth Approximation of the Quantile Function Derivatives
• Some aspects of approximation and interpolation of functions artificial neural networks

This page was built for publication: Method of optimal placement of approximation nodes

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