Parallel genetic algorithms for finding solution of system of ordinary differential equations

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The goal of our research is to evaluate the general methods of finding solution of a system of differential equations. In this paper we investigate a novel two step genetic algorithm approach that produces an analytical solution of the system. The evaluation of the algorithm reveals its capability to solve non-trivial systems in very small number of generations. In order to find the best solution, and due to the fact that the simulations are computational intensive, we use grid genetic algorithms. Using the gLite based Grid, we propose a grid genetic solution that uses large number of computational nodes, that archives excellent performance. This research will be the basis on our goal of solving more complex research problems based around the Schrodingers equation. © 2012 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Jovanovski, J., Jakimovski, B., & Jakimovski, D. (2012). Parallel genetic algorithms for finding solution of system of ordinary differential equations. In Advances in Intelligent and Soft Computing (Vol. 150 AISC, pp. 227–237). https://doi.org/10.1007/978-3-642-28664-3_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free