Suscripción a Biblioteca: Guest
Journal of Automation and Information Sciences

Publicado 12 números por año

ISSN Imprimir: 1064-2315

ISSN En Línea: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Solving a Uniform Nonlinear Approximation Problem Using Continuous Genetic Algorithm

Volumen 48, Edición 6, 2016, pp. 49-59
DOI: 10.1615/JAutomatInfScien.v48.i6.50
Get accessGet access

SINOPSIS

A continuous genetic algorithm for solving a problem of the best uniform nonlinear approximation is proposed. A comparison of this algorithm with specialized algorithms of approximation is made according to results of computational experiments. There is presented an example of constructing a nonlinear empiric function of two variables for approximation of experimental data on filter capacity by using the genetic algorithm.

CITADO POR
  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

Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones Precios y Políticas de Suscripcione Begell House Contáctenos Language English 中文 Русский Português German French Spain