mlsanityData to 14 Oct 2026

Reachability of weakly nonlinear systems using Carleman linearization

arXiv 2108.10390 ↗First posted 23 Aug 2021math.OC cs.MS cs.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 23 Aug 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.