Equivalence of discrete euler equations and discrete hamiltonian systems

38Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Erbe and Yan recently presented a discrete linear Hamiltonian system. Their system is a special case of the discrete Hamiltonian system Δy(n - l) = Hz(n, y(n), z(n - l))Δz(n - l) = -Hy(n, y(n), z(n - l)), where Δy(n - 1) = y(n) - y(n - 1). Under certain implicit solvability hypotheses, these systems are equivalent to the discrete Euler equation f(hook)y(n, yn, Δyn - l) = Δf(hook)r(n, yn, Δyn - l). A Reid Roundabout Theorem for linear recurrence relations -Knyn+1 + Bnyn - KTn-1yn-1 = 0 is shown to imply the corresponding result obtained by Erbe and Yan for discrete linear Hamiltonian systems. Furthermore, discrete linear Hamiltonian systems are shown to have a symplectic transition matrix. © 1993 Academic Press, Inc.

Cite

CITATION STYLE

APA

Ahlbrandt, C. D. (1993). Equivalence of discrete euler equations and discrete hamiltonian systems. Journal of Mathematical Analysis and Applications, 180(2), 498–517. https://doi.org/10.1006/jmaa.1993.1413

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