Linearization, model reduction and reachability in nonlinear odes

Abstract In the analysis of nonlinear ordinary differential equations ( ode s), linear and Taylor approximations are fundamental tools. Such approximations are generally accurate only in a local sense, that is near a given expansion point in space or time. We study conditions and methods to compute linear approximations of nonlinear ode s that can be used to compute accurate reachability information also non locally. Relying on Carleman linearization and Krylov projection, our method yields a small, hence tractable linear system that is shown to produce accurate approximate solutions, under suitable stability conditions. In the general, possibly non stable case, we provide an algorithm that, given an initial set and a finite time horizon, builds a tight overapproximation of the reachable states at specified times. Experiments conducted with a proof-of-concept implementation have given encouraging results. We also establish a formal relation between our approach and Koopman approximation, a well-known framework for the analysis of nonlinear systems.

Authors

Institutions

Publication Details

Journal
Formal Methods in System Design
Published
2025-05-24
DOI
https://doi.org/10.1007/s10703-025-00477-2
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Linearization, model reduction and reachability in nonlinear odes

Luisa Collodi, Michele Boreale
Formal Methods in System Design
Model Reduction and Neural Networks
article

Linearization, model reduction and reachability in nonlinear odes

Luisa Collodi, Michele Boreale
article en

Abstract

Abstract In the analysis of nonlinear ordinary differential equations ( ode s), linear and Taylor approximations are fundamental tools. Such approximations are generally accurate only in a local sense, that is near a given expansion point in space or time. We study conditions and methods to compute linear approximations of nonlinear ode s that can be used to compute accurate reachability information also non locally. Relying on Carleman linearization and Krylov projection, our method yields a small, hence tractable linear system that is shown to produce accurate approximate solutions, under suitable stability conditions. In the general, possibly non stable case, we provide an algorithm that, given an initial set and a finite time horizon, builds a tight overapproximation of the reachable states at specified times. Experiments conducted with a proof-of-concept implementation have given encouraging results. We also establish a formal relation between our approach and Koopman approximation, a well-known framework for the analysis of nonlinear systems.

Formal Methods in System DesignVol. 66(3)
University of Florence (IT)
Università degli Studi di Firenze
Openalex Percentile: Top 91%
Model Reduction and Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Linearization, model reduction and reachability in nonlinear odes — Luisa Collodi, Michele Boreale · Formal Methods in System Design (2025) | TGRS Research Map | TGRS