Global Optimization for Algebraic Geometry – Computing Runge–Kutta Methods

  • Ivan Martino
  • Giuseppe Nicosia
Conference paper

DOI: 10.1007/978-3-642-34413-8_43

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7219)
Cite this paper as:
Martino I., Nicosia G. (2012) Global Optimization for Algebraic Geometry – Computing Runge–Kutta Methods. In: Hamadi Y., Schoenauer M. (eds) Learning and Intelligent Optimization. Lecture Notes in Computer Science, vol 7219. Springer, Berlin, Heidelberg

Abstract

This research work presents a new evolutionary optimization algorithm, Evo-Runge-Kutta in theoretical mathematics with applications in scientific computing. We illustrate the application of Evo-Runge-Kutta, a two-phase optimization algorithm, to a problem of pure algebra, the study of the parameterization of an algebraic variety, an open problem in algebra. Results show the design and optimization of particular algebraic varieties, the Runge-Kutta methods of order q. The mapping between algebraic geometry and evolutionary optimization is direct, and we expect that many open problems in pure algebra will be modelled as constrained global optimization problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ivan Martino
    • 1
  • Giuseppe Nicosia
    • 2
  1. 1.Department of MathematicsStockholm UniversitySweden
  2. 2.Department of Mathematics and Computer ScienceUniversity of CataniaItaly

Personalised recommendations