A Discrete Algorithm to the Calculus of Variations

MaRDI QIDQ6217884zbMATH OpenFDO

Authors Celia T. L. M. Pereira, Pedro Cruz, Delfim F. M. Torres

Publication date 3 March 2010

Mathematics Subject Classification ID

Numerical methods based on necessary conditions (49M05) Discrete approximations in optimal control (49M25)

Abstract: A numerical study of an algorithm proposed by Gusein Guseinov, which determines approximations to the optimal solution of problems of calculus of variations using two discretizations and correspondent Euler-Lagrange equations, is investigated. The results we obtain to discretizations of the brachistochrone problem and Mania example with Lavrentiev's phenomenon are compared with the solutions found by other methods and solvers. We conclude that Guseinov's method presents better solutions in most of the cases studied.

This page was built for publication: A Discrete Algorithm to the Calculus of Variations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6217884)