Library Subscription: Guest
Journal of Automation and Information Sciences

Published 12 issues per year

ISSN Print: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Seeking Optimal Knots for Segment Approximation

Volume 48, Issue 11, 2016, pp. 68-75
DOI: 10.1615/JAutomatInfScien.v48.i11.60
Get accessGet access

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.

CITED BY
  1. 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

  2. Vakal L. P., Vakal E. S., Algorithm for the Best Uniform Spline Approximation with Free Knots, Cybernetics and Systems Analysis, 55, 3, 2019. Crossref

  3. Kalenchuk-Porkhanova A. A., Modeling Flow States in Water Bodies, Cybernetics and Systems Analysis, 55, 4, 2019. Crossref

Begell Digital Portal Begell Digital Library eBooks Journals References & Proceedings Research Collections Prices and Subscription Policies Begell House Contact Us Language English 中文 Русский Português German French Spain