Reachability of weakly nonlinear systems using Carleman linearization

DOI10.1007/978-3-030-89716-1_6MaRDI QIDQ6375870arXivFDO

Authors M. Forets, Christian Schilling

Publication date 23 August 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-89716-1_6

Mathematics Subject Classification ID

Theory of computing (68Qxx)

arXiv classification

cs.MScs.SYeess.SYmath.DSmath.OC

Abstract: In this article we introduce a solution method for a special class of nonlinear initial-value problems using set-based propagation techniques. The novelty of the approach is that we employ a particular embedding (Carleman linearization) to leverage recent advances of high-dimensional reachability solvers for linear ordinary differential equations based on the support function. Using a global error bound for the Carleman linearization abstraction, we are able to describe the full set of behaviors of the system for sets of initial conditions and in dense time.

This page was built for publication: Reachability of weakly nonlinear systems using Carleman linearization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375870)