Abstract
The problem of approximating experimental data with an a priori fixed error by means of piecewise polynomial functions (with respect to a Chebyshev system) with free conjunction nodes is considered. The properties of the approximation with the minimum number of nodes are studied. A computational scheme for constructing the optimal approximation is proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
