Related Experiment Video
Updated: Jun 17, 2026

08:35
Interactive and Visualized Online Experimentation System for Engineering Education and Research
Published on: November 24, 2021
H-FEX: A symbolic learning method for Hamiltonian systems.
Jasen Lai1, Senwei Liang2, Chunmei Wang1
1Department of Mathematics, University of Florida, 1400 Stadium Rd, Gainesville, FL 32611, USA.
Summary
A new method, Hamiltonian Finite Expression Method (H-FEX), learns complex Hamiltonian system equations from data. It accurately captures dynamics and conserves energy, outperforming existing techniques.
Area of Science:
- Physics
- Applied Mathematics
- Machine Learning
Background:
- Hamiltonian systems are crucial for modeling diverse physical phenomena, governed by energy functions.
- Data-driven methods like symbolic regression can learn dynamical system equations but struggle with complex Hamiltonians and energy conservation.
- Existing approaches often fail to accurately represent intricate interactions within Hamiltonian functions.
Purpose of the Study:
- To introduce the Hamiltonian Finite Expression Method (H-FEX), a novel symbolic learning technique.
- To enhance the accurate recovery of complex Hamiltonian functions from observational data.
- To ensure the preservation of energy conservation in learned models over extended time scales.
Main Methods:
- Developed H-FEX, a symbolic learning approach incorporating novel interaction nodes.
- Designed H-FEX to effectively capture intricate interaction terms in Hamiltonian functions.
- Applied H-FEX to learn governing equations from observational data of Hamiltonian systems.
Main Results:
- H-FEX successfully recovered complex Hamiltonian functions for various systems, including highly stiff ones.
- The method demonstrated accurate capture of system dynamics.
- Energy conservation was preserved over long time horizons, outperforming existing methods.
Conclusions:
- H-FEX offers a powerful framework for discovering closed-form expressions of complex dynamical systems.
- The novel interaction nodes are key to capturing intricate terms and ensuring energy conservation.
- This approach advances data-driven discovery for Hamiltonian mechanics.
Related Concept Videos
SFG Algebra
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Linear Approximation in Time Domain
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Signal Flow Graphs
Signal-flow graphs offer a streamlined and intuitive approach to representing control systems, providing an alternative to traditional block diagrams. These graphs use branches to symbolize systems and nodes to represent signals, effectively illustrating the relationships and interactions within the system.
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
State Space Representation
The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
Consider an RLC circuit, a...
Multi-input and Multi-variable systems
Cruise control systems in cars are designed as multi-input systems to maintain a driver's desired speed while compensating for external disturbances such as changes in terrain. The block diagram for a cruise control system typically includes two main inputs: the desired speed set by the driver and any external disturbances, such as the incline of the road. By adjusting the engine throttle, the system maintains the vehicle's speed as close to the desired value as possible.
In the absence of...
In the absence of...
Hückel's Rule Diagram of π MOs: Frost Circle
The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so that...
