Algorithm for the 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 co...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Cybernetics and systems analysis Ročník 55; číslo 3; s. 449 - 455
Hlavní autoři: Vakal, L. P., Vakal, E. S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.05.2019
Springer
Springer Nature B.V
Témata:
Algorithms
Analysis
Approximation
Artificial Intelligence
Control
Evolutionary algorithms
Evolutionary computation
Knots
Mathematics
Mathematics and Statistics
Optimization
Processor Architectures
Software Engineering/Programming and Operating Systems
Software–Hardware Systems
Systems Theory
best uniform approximation
differential evolution
spline
optimal knots
ISSN:1060-0396, 1573-8337
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-019-00152-5