1,867 research outputs found
Analysis of parametric biological models with non-linear dynamics
In this paper we present recent results on parametric analysis of biological
models. The underlying method is based on the algorithms for computing
trajectory sets of hybrid systems with polynomial dynamics. The method is then
applied to two case studies of biological systems: one is a cardiac cell model
for studying the conditions for cardiac abnormalities, and the second is a
model of insect nest-site choice.Comment: In Proceedings HSB 2012, arXiv:1208.315
Sapo: Reachability Computation and Parameter Synthesis of Polynomial Dynamical Systems
Sapo is a C++ tool for the formal analysis of polynomial dynamical systems.
Its main features are: 1) Reachability computation, i.e., the calculation of
the set of states reachable from a set of initial conditions, and 2) Parameter
synthesis, i.e., the refinement of a set of parameters so that the system
satisfies a given specification. Sapo can represent reachable sets as unions of
boxes, parallelotopes, or parallelotope bundles (symbolic representation of
polytopes). Sets of parameters are represented with polytopes while
specifications are formalized as Signal Temporal Logic (STL) formulas
Algorithmic Verification of Continuous and Hybrid Systems
We provide a tutorial introduction to reachability computation, a class of
computational techniques that exports verification technology toward continuous
and hybrid systems. For open under-determined systems, this technique can
sometimes replace an infinite number of simulations.Comment: In Proceedings INFINITY 2013, arXiv:1402.661
Reachability computation for polynomial dynamical systems
This paper is concerned with the problem of computing the bounded time reachable set of a polynomial discrete-time dynamical system. The problem is well-known for being difficult when nonlinear systems are considered. In this regard, we propose three reachability methods that differ in the set representation. The proposed algorithms adopt boxes, parallelotopes, and parallelotope bundles to construct flowpipes that contain the actual reachable sets. The latter is a new data structure for the symbolic representation of polytopes. Our methods exploit the Bernstein expansion of polynomials to bound the images of sets. The scalability and precision of the presented methods are analyzed on a number of dynamical systems, in comparison with other existing approaches
Analysis of Nonlinear Systems via Bernstein Expansions
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/106482/1/AIAA2013-4557.pd
Efficient computation of highly oscillatory integrals by using QTT tensor approximation
We propose a new method for the efficient approximation of a class of highly
oscillatory weighted integrals where the oscillatory function depends on the
frequency parameter , typically varying in a large interval. Our
approach is based, for fixed but arbitrary oscillator, on the pre-computation
and low-parametric approximation of certain -dependent prototype
functions whose evaluation leads in a straightforward way to recover the target
integral. The difficulty that arises is that these prototype functions consist
of oscillatory integrals and are itself oscillatory which makes them both
difficult to evaluate and to approximate. Here we use the quantized-tensor
train (QTT) approximation method for functional -vectors of logarithmic
complexity in in combination with a cross-approximation scheme for TT
tensors. This allows the accurate approximation and efficient storage of these
functions in the wide range of grid and frequency parameters. Numerical
examples illustrate the efficiency of the QTT-based numerical integration
scheme on various examples in one and several spatial dimensions.Comment: 20 page
High-order adaptive methods for computing invariant manifolds of maps
The author presents efficient and accurate numerical methods for computing invariant manifolds of maps which arise in the study of dynamical systems. In order to decrease the number of points needed to compute a given curve/surface, he proposes using higher-order interpolation/approximation techniques from geometric modeling. He uses B´ezier curves/triangles, fundamental objects in curve/surface design, to create adaptive methods. The methods are based on tolerance conditions derived from properties of B´ezier curves/triangles. The author develops and tests the methods for an ordinary parametric curve; then he adapts these methods to invariant manifolds of planar maps. Next, he develops and tests the method for parametric surfaces and then he adapts this method to invariant manifolds of three-dimensional maps
- …