Parallel Genetic Algorithms for Finding Solution of System of Ordinary Differential Equations

  • Jane Jovanovski
  • Boro Jakimovski
  • Dragan Jakimovski
Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 150)

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.

Keywords

Genetic Algorithm Candidate Solution Correct Solution Function Tree Grammatical Evolution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lambert, J.D.: Numerical methods for ordinary differential systems: the initial value problem. John Wiley & Sons, Inc. (1991)Google Scholar
  2. 2.
    Fasshauer, G.E.: Solving differential equations with radial basis functions: multilevel methods and smoothing. Advances in Computational Mathematics 11, 139–159 (1999), doi:10.1023/A:1018919824891MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Lagaris, I.E., Likas, A., Fotiadis, D.I.: Artificial neural networks for solving ordinary and partial differential equations. IEEE Transactions on Neural Networks 9, 987–1000 (1998)CrossRefGoogle Scholar
  4. 4.
    Burgess, G.: Finding Approximate Analytic Solutions To Differential Equations Using Genetic Programming. Technical Report DSTO-TR-0838, Surveillance Systems Division, Defence Science and Technology Organisation, Australia, Salisbury, SA, 5108, Austrlia (1999), http://www.dsto.defence.gov.au/corporate/reports/DSTO-TR-0838.pdf
  5. 5.
    Tsoulos, I.G., Lagaris, I.E.: Solving differential equations with genetic programming. Genetic Programming and Evolvable Machines 7, 33–54 (2006)CrossRefGoogle Scholar
  6. 6.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc. (1989)Google Scholar
  7. 7.
    O’Neill, M., Ryan, C., Keijzer, M., Cattolico, M.: Crossover in Grammatical Evolution. Genetic Programming and Evolvable Machines 4, 67–93 (2003)CrossRefMATHGoogle Scholar
  8. 8.
    Ridders, C.: Accurate computation of F’(x) and F’(x) F”(x). In: Advances in Engineering Software (1978), vol. 4, pp. 75–76 (1982), doi:10.1016/S0141-1195(82)80057-0Google Scholar
  9. 9.
    Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer Publishing Company, Inc. (2007)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  • Jane Jovanovski
    • 1
  • Boro Jakimovski
    • 1
  • Dragan Jakimovski
    • 1
  1. 1.Faculty of Natural Sciences and MathematicsSs. Cyril and Methodius UniversitySkopjeMacedonia

Personalised recommendations