By Topic

A factor-graph approach to Lagrangian and Hamiltonian dynamics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Vontobel, P.O. ; Hewlett-Packard Labs., Palo Alto, CA, USA

Factor graphs are graphical models with origins in coding theory. The sum-product, the max-product, and the min-sum algorithms, which operate by message passing on a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. This paper aims at extending the field of possible applications of factor graphs to Lagrangian and Hamiltonian dynamics. The starting point is the principle of least action (more precisely, the principle of stationary action). The resulting factor graphs require a new message-passing algorithm that we call the stationary-sum algorithm. As it turns out, some of the properties of this algorithm are equivalent to Liouville's theorem. Moreover, duality results for factor graphs allow to easily derive Noether's theorem. We also discuss connections and differences to Kalman filtering.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011