Journal
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
Volume 34, Issue 11, Pages 9323-9336Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2022.3157963
Keywords
Mathematical models; Computational modeling; Optimization; Time measurement; Real-time systems; Data models; Complexity theory; Artificial neural networks; Levenberg-Marquardt algorithm; machine learning; sparse identification; system identification
Ask authors/readers for more resources
This article introduces a flexible method for the sparse identification of dynamical systems. The method alleviates the stringent requirements imposed by other methods, such as fixed sampling rates and full state measurements. The Levenberg-Marquardt algorithm is used to solve the identification problem, and a parallel computing form of the algorithm is presented to reduce the solving time. An efficient backward elimination strategy is also proposed to construct a lean system model.
Low complexity of a system model is essential for its use in real-time applications. However, sparse identification methods commonly have stringent requirements that exclude them from being applied in an industrial setting. In this article, we introduce a flexible method for the sparse identification of dynamical systems described by ordinary differential equations. Our method relieves many of the requirements imposed by other methods that relate to the structure of the model and the dataset, such as fixed sampling rates, full state measurements, and linearity of the model. The Levenberg-Marquardt algorithm is used to solve the identification problem. We show that the Levenberg-Marquardt algorithm can be written in a form that enables parallel computing, which greatly diminishes the time required to solve the identification problem. An efficient backward elimination strategy is presented to construct a lean system model.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available