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...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis Vol. 55; no. 3; pp. 449 - 455
Main Authors: Vakal, L. P., Vakal, E. S.
Format: Journal Article
Language:English
Published: New York Springer US 01.05.2019
Springer
Springer Nature B.V
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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