Conservative time discretization: a comparative study

DOI10.1007/978-3-031-07727-2_9zbMath1504.93022arXiv2111.01454OpenAlexW3209616618MaRDI QIDQ2165508

Marcelo Forets, Christian Schilling

Publication date: 19 August 2022

Full work available at URL: https://arxiv.org/abs/2111.01454

zbMATH Keywords

linear systemreachabilitytime discretization

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Attainable sets, reachability (93B03)

Related Items (3)

Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions ⋮ Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability analysis of linear systems using support functions
• Reachable set computation for uncertain time-varying linear systems
• Reachability Analysis of Hybrid Systems Using Support Functions
• Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices
• Reachability Analysis of Large Linear Systems With Uncertain Inputs in the Krylov Subspace
• Numerical verification of affine systems with up to a billion dimensions
• JuliaReach
• Approximating the Matrix Exponential of an Advection-Diffusion Operator Using the Incomplete Orthogonalization Method
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• Symbolic reachability computation for families of linear vector fields

This page was built for publication: Conservative time discretization: a comparative study