Global Optimization for Algebraic Geometry - Computing Runge-Kutta Methods
نویسندگان
چکیده
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 RungeKutta 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.
منابع مشابه
Partitioned Runge-Kutta Methods for Semi-explicit Differential-Algebraic Systems of Index 2
A general class of one-step methods for index 2 differential-algebraic systems in Hessenberg form is studied. This family of methods, which we call partitioned Runge-Kutta methods, includes all one-step methods of Runge-Kutta type proposed in the literature for integrating such DAE systems, including the more recently proposed classes of half-explicit methods. A new family of super-convergent p...
متن کاملOptimal Explicit Strong-Stability-Preserving General Linear Methods
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods generalize both Runge-Kutta (RK) and linear multistep schemes. They have high stage orders and hence are less susceptible than RK methods to order reduction from source terms or nonhomogeneous boundary conditions. A glo...
متن کاملSensitivity Analysis in Index-1 Differential Algebraic Equations by Esdirk Methods
Dynamic optimization by multiple shooting requires integration and sensitivity calculation. A new semi-implicit Runge-Kutta algorithm for numerical sensitivity calculation of index-1 DAE systems is presented. The algorithm calculates sensitivities with respect to problem parameters and initial conditions, exploiting the special structure of the sensitivity equations. The algorithm is a one-step...
متن کاملOptimization of the Runge-Kutta iteration with residual smoothing
Iterative solvers in combination with multi-grid have been used extensively to solve large algebraic systems. One of the best known is the Runge-Kutta iteration. Previously [4] we reformulated the Runge-Kutta scheme and established a model of a complete V-cycle which was used to optimize the coefficients of the multi-stage scheme and resulted in a better overall performance. We now look into as...
متن کاملProjected Runge-kutta Methods for Differential Algebraic Equations of Index 3
In the present paper we introduce a new class of methods, Projected RungeKutta methods, for the solution of index 3 differential algebraic equations (DAEs) in Hessenberg form. The methods admit the integration of index 3 DAEs without any drift effects. This makes them particularly well suited for long term integration. Finally, implemented on the basis of the Radau5 code, the projected Runge-Ku...
متن کامل