2018
DOI: 10.1088/2399-6528/aaedd2
|View full text |Cite
|
Sign up to set email alerts
|

Solving ordinary differential equations using genetic algorithms and the Taylor series matrix method

Abstract: A method for solving ordinary differential equations based in evolutionary algorithms is introduced. The concept of Taylor series matrix is defined, allowing to transform a differential equation into an optimization problem, in which the objective function is constituted by the coefficients of a series expansion. An ad-hoc genetic algorithm is used to find such coefficients that satisfy particular conditions. The efficiency of the algorithm is demonstrated by solving several ordinary differential equations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…Unlike real evolutionary-genetic transformations, GA does not solve the problem of the "survival" of the population as a whole and are aimed at optimizing certain moments in its vital activity, but "... it would be rash to see in optimization the key to understanding how populations and individuals survive" [22]. Both GA and EANN can be quite effective for solving differential equations (including evolutionary ones) and systems of such equations [23][24][25][26]. However, using evolutionary computational methods, it is impossible to predict abrupt transitions in the evolution of a complex open system from a state of chaos to a qualitatively new state, since genetic operators alone are not enough to model evolutionunderstanding the nature of the collective forces of interaction between "individuals" that lead to irreversible and indeterminacy of the phase trajectories of such systems is needed.…”
Section: Artificial Intelligence Techniquesmentioning
confidence: 99%
“…Unlike real evolutionary-genetic transformations, GA does not solve the problem of the "survival" of the population as a whole and are aimed at optimizing certain moments in its vital activity, but "... it would be rash to see in optimization the key to understanding how populations and individuals survive" [22]. Both GA and EANN can be quite effective for solving differential equations (including evolutionary ones) and systems of such equations [23][24][25][26]. However, using evolutionary computational methods, it is impossible to predict abrupt transitions in the evolution of a complex open system from a state of chaos to a qualitatively new state, since genetic operators alone are not enough to model evolutionunderstanding the nature of the collective forces of interaction between "individuals" that lead to irreversible and indeterminacy of the phase trajectories of such systems is needed.…”
Section: Artificial Intelligence Techniquesmentioning
confidence: 99%
“…With the help of this technique, one may define the concept of a Taylor series matrix, which turns a differential equation into an optimization problem. The coefficients of a series expansion make up the objective function in this problem [3].…”
Section: Introductionmentioning
confidence: 99%
“…The idea of GA optimization is effectively applied to nonlinear differential equations for optimized solutions [13][14][15][16]. Through reviewing the literature, it can be seen that collocation method has not been applied to the Troesch's equation.…”
Section: Introductionmentioning
confidence: 99%