Published 12 issues per year
ISSN Print: 1064-2315
ISSN Online: 2163-9337
Indexed in
Seeking Optimal Knots for Segment Approximation
ABSTRACT
The differential evolution algorithm for seeking optimal knots for Chebyshev (uniform) piecewise-polynomial approximation is proposed. The approximation results obtained with the use of algorithm are presented. A comparison of this algorithm with deterministic algorithms of segment polynomial approximation and with a continuous genetic algorithm is made.
-
Vakal L. P., Kalenchuk-Porkhanova A. A., Vakal E. S., Increasing the Efficiency of Chebyshev Segment Fractional Rational Approximation, Cybernetics and Systems Analysis, 53, 5, 2017. Crossref
-
Vakal L. P., Vakal E. S., Algorithm for the Best Uniform Spline Approximation with Free Knots, Cybernetics and Systems Analysis, 55, 3, 2019. Crossref
-
Kalenchuk-Porkhanova A. A., Modeling Flow States in Water Bodies, Cybernetics and Systems Analysis, 55, 4, 2019. Crossref