Алгоритм наилучшей равномерной аппроксимации сплайнами со свободными узлами / Вакал Л. П., Вакал Е. С. (2019)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2019, 55 (3))

Vakal L.P., Vakal E.S.
Algorithm for best uniform spline approximation with free knots

An algorithm for the best uniform approximation by a spline with optimal knots is presented in the paper. Differential evolution is used to find optimal knots. It is one of the best evolutionary algorithms, which sustainably finds function’s global optimum in minimum time. Spline coefficients are computed as a solution of a spline-approximation problem with fixed knots. Results of the numerical experiment are given. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: best uniform approximation, differential evolution, optimal knots, spline, Evolutionary algorithms, Optimization, Splines, Best uniform approximation, Differential Evolution, Global optimum, Minimum time, Numerical experiments, optimal knots, Spline approximations, Approximation algorithms


Cite:
Vakal L.P., Vakal E.S. (2019). Algorithm for best uniform spline approximation with free knots. Cybernetics and Systems Analysis, 55 (3), 121-128. doi: https://doi.org/10.1007/s10559-019-00152-5 http://jnas.nbuv.gov.ua/article/UJRN-0000986323 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна