ABSTRACT
Reservoir computing is an effective model for learning and predicting nonlinear and chaotic dynamical systems; however, there remains a challenge in achieving a more dependable evolution for such systems. Based on the foundation of Koopman operator theory, considering the effectiveness of the sparse identification of nonlinear dynamics algorithm to construct candidate nonlinear libraries in the application of nonlinear data, an alternative reservoir computing method is proposed, which creates the linear Hilbert space of the nonlinear system by including nonlinear terms in the optimization process of reservoir computing, allowing for the application of linear optimization. We introduce an implementation that incorporates a polynomial transformation of arbitrary order when fitting the readout matrix. Constructing polynomial libraries with reservoir-state vectors as elements enhances the nonlinear representation of reservoir states and more easily captures the complexity of nonlinear systems. The Lorenz-63 system, the Lorenz-96 system, and the Kuramoto-Sivashinsky equation are used to validate the effectiveness of constructing polynomial libraries for reservoir states in the field of state-evolution prediction of nonlinear and chaotic dynamical systems. This study not only promotes the theoretical study of reservoir computing, but also provides a theoretical and practical method for the prediction of nonlinear and chaotic dynamical system evolution.
