Increasing the Efficiency of Chebyshev Segment Fractional Rational Approximation

An algorithm for Chebyshev segment approximation with free nodes is presented. Fractional rational functions are used as approximating functions on subintervals. The differential evolution algorithm is used to find optimal nodes. Numerical results related to segment approximation of functions with o...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis Vol. 53; no. 5; pp. 759 - 765
Main Authors: Vakal, L. P., Kalenchuk-Porkhanova, A. A., Vakal, E. S.
Format: Journal Article
Language:English
Published: New York Springer US 01.09.2017
Springer
Springer Nature B.V
Subjects:
Algorithms
Approximation
Artificial Intelligence
Chebyshev approximation
Control
Cybernetics
Efficiency
Evolutionary algorithms
Evolutionary computation
Mathematical functions
Mathematics
Mathematics and Statistics
Nodes
Processor Architectures
Rational functions
Segments
Software Engineering/Programming and Operating Systems
Systems Theory
Chebyshev segment approximation
rational fractions
differential evolution algorithm
multidimensional nonlinear optimization problem
optimal node
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 Chebyshev segment approximation with free nodes is presented. Fractional rational functions are used as approximating functions on subintervals. The differential evolution algorithm is used to find optimal nodes. Numerical results related to segment approximation of functions with optimal nodes 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-017-9978-7