Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
نویسندگان
چکیده
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-based analysis of hybrid systems and embedded software with polynomial dynamics, which found applications in various engineering domains. One typical example is the computation of all states reachable from a given set in one step by a continuous dynamics described by a differential or difference equation. We propose a new algorithm for over-approximating such images based on the Bernstein representation of polynomial functions. The images are stored using template polyhedra. Using a prototype implementation, the performance of the algorithm was demonstrated on two practical systems as well as a number of randomly generated examples.
منابع مشابه
Reachability analysis for polynomial dynamical systems using the Bernstein expansion over polytopes
This paper is concerned with the reachability computation problem for polynomial dynamical systems. Such computations constitute a crucial component in algorithmic verification tools for hybrid systems and embedded software with polynomial dynamics, which have found applications in many engineering domains. We describe two methods for over-approximating reachable sets of such systems; these met...
متن کاملReachability Analysis for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the reachability computation problem for polynomial dynamical systems. Such computations constitute a crucial component in algorithmic verification tools for hybrid systems and embedded software with polynomial dynamics, which have found applications in many engineering domains. We describe two methods for overapproximating reachable sets of such systems; these meth...
متن کاملExpansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind
In this paper, the Bernstein polynomials are used to approximate the solutions of linear integral equations with multiple time lags (IEMTL) through expansion methods (collocation method, partition method, Galerkin method). The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is car...
متن کاملAnalysis of Nonlinear Systems via Bernstein Expansions
This paper presents an analytical approach for the stability and bifurcation analyses of nonlinear dynamic systems that have polynomial and trigonometric nonlinearities. The method ensures that all equilibrium points in a bounded region of the state space are found and yields arbitrarily tight bounds to the parameter points where the system exhibits local bifurcations. The solution method requi...
متن کاملComputation of the Bernstein Coefficients on Subdivided Triangles
We present a procedure for computing the coeecients of the expansion of a bivariate polynomial into Bernstein polynomials over subtriangles. These triangles are generated by partitioning the standard simplex of IR 2. The coeecients are computed directly from the coeecients on the subdivided triangle from the preceding subdivision level. This allows a recursive computation of the coeecients and ...
متن کامل