pith. sign in

arxiv: 2207.07755 · v2 · pith:E244GQV5new · submitted 2022-07-15 · 🧮 math.DS · cs.SY· eess.SY

Carleman Linearization of Nonlinear Systems and Its Finite-Section Approximations

classification 🧮 math.DS cs.SYeess.SY
keywords systemfinite-sectionnonlinearapproximationsconvergencelinearizationoriginaltime
0
0 comments X
read the original abstract

The Carleman linearization is one of the mainstream approaches to lift a finite-dimensional nonlinear dynamical system into an infinite-dimensional linear system with the promise of providing accurate approximations of the original nonlinear system over larger regions around the equilibrium for longer time horizons with respect to the conventional first-order linearization approach. Finite-section approximations of the lifted system has been widely used to study dynamical and control properties of the original nonlinear system. In this context, some of the outstanding problems are to determine under what conditions, as the finite-section order (i.e., truncation length) increases, the trajectory of the resulting approximate linear system from the finite-section scheme converges to that of the original nonlinear system and whether the time interval over which the convergence happens can be quantified explicitly. In this paper, we provide explicit error bounds for the finite-section approximation and prove that the convergence is indeed exponential with respect to the finite-section order. For a class of nonlinear systems, it is shown that one can achieve exponential convergence over the entire time horizon up to infinity. Our results are practically plausible as our proposed error bound estimates can be used to compute proper truncation lengths for a given application, e.g., determining proper sampling period for model predictive control and reachability analysis for safety verifications. We validate our theoretical findings through several illustrative simulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Flow map learning in nonlinear vector autoregressive models: influence of the feature-library structure on the training error

    cs.LG 2026-05 unverdicted novelty 6.0

    NVAR models exhibit training error scaling laws tied to feature library representation of Lie-series coefficients, with delays reducing one-step error but aiding long-horizon forecasts only under sufficient nonlinearity.

  2. A Quantum Linear Systems Pathway for Solving Differential Equations

    quant-ph 2025-10 unverdicted novelty 5.0

    A quantum algorithm pathway using block encoding and QSVT to solve differential equations, with demonstrations on heat and Burgers' equations plus hardware resource estimates.

  3. Solving Einstein Field Equations on a Digital Quantum Computer

    gr-qc 2026-06 unverdicted novelty 4.0

    A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.

  4. Measurement-Efficient Variational Quantum Linear Solver for Carleman-Linearized Nonlinear Dynamics

    quant-ph 2026-05 unverdicted novelty 4.0

    Hybrid VQLS pipeline with Carleman linearization recovers high-fidelity solutions to the weakly nonlinear Duffing equation on IBM and Xanadu hardware using symmetry-grouped measurements and optimized ansatzes.