On approximation with the continuous polynomial cubic splines

DOI

https://doi.org/10.1109/CSCC49995.2020.00030
Final published version

I. G. Burova

Algorithms for the calculation of the continuous cubic polynomial splines of the maximum defect are considered. The behavior of constants and the Lebesgue functions for cubic polynomial splines in the case of non-uniform condensing grids are discussed. The algorithm is proposed for constructing an irregular grid consistent. This grid provides the minimum error when the left, the right, or the middle cubic polynomial splines.

Original language	English
Title of host publication	Proceedings - 24th International Conference on Circuits, Systems, Communications and Computers, CSCC 2020
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	126-129
Number of pages	4
ISBN (Electronic)	9781728165035
DOIs	https://doi.org/10.1109/CSCC49995.2020.00030
State	Published - Jul 2020
Event	24th International Conference on Circuits, Systems, Communications and Computers, CSCC 2020 - Platanias, Chania, Crete Island, Greece Duration: 19 Jul 2020 → 22 Jul 2020

Publication series

Name	Proceedings - 24th International Conference on Circuits, Systems, Communications and Computers, CSCC 2020

Conference

Conference	24th International Conference on Circuits, Systems, Communications and Computers, CSCC 2020
Country/Territory	Greece
City	Platanias, Chania, Crete Island
Period	19/07/20 → 22/07/20

Research areas

cubic polynomial splines, grid

Scopus subject areas

Computer Science Applications
Computer Vision and Pattern Recognition
Information Systems
Electrical and Electronic Engineering
Computational Mathematics
Artificial Intelligence
Computer Networks and Communications

ID: 76977320