Numerical implementation of gradient algorithms

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

Abstract

A numerical method for computational implementation of gradient dynamical systems is presented. The method is based upon the development of geometric integration numerical methods, which aim at preserving the dynamical properties of the original ordinary differential equation under discretization. In particular, the proposed method belongs to the class of discrete gradients methods, which substitute the gradient of the continuous equation with a discrete gradient, leading to a map that possesses the same Lyapunov function of the dynamical system, thus preserving the qualitative properties regardless of the step size. In this work, we apply a discrete gradient method to the implementation of Hopfield neural networks. Contrary to most geometric integration methods, the proposed algorithm can be rewritten in explicit form, which considerably improves its performance and stability. Simulation results show that the preservation of the Lyapunov function leads to an improved performance, compared to the conventional discretization. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Atencia, M., Hernández, Y., Joya, G., & Sandoval, F. (2013). Numerical implementation of gradient algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7903 LNCS, pp. 355–364). https://doi.org/10.1007/978-3-642-38682-4_38

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