Discrete piecewise linear functions

The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is used to establish lattice polynomial representations of piecewise linear functions on convex domains and continuous selectors on linear orders.Comment: 17 pages, 4 figures, Fig.2.1 label correcte

Bifurcation Curves in Discontinuous Maps

Several discrete-time dynamic models are ultimately expressed in the form of iterated piecewise linear functions, in one or two-dimensional spaces. In this paper we study a one-dimensional map made up of three linear pieces which are separated by two discontinuity points, motivated by a dynamic model arising in social sciences. Starting from the bifurcation structure associated with one-dimensional maps with only one discontinuity point, we show how this is modied by the introduction of a second discontinuity point, and we give the analytic expressions of the bifurcation curves of the principal tongues (or tongues of first degree), for the family of maps considered, that depends on five parameters.iterated piecewise linear functions, discrete-time dynamic models, bifurcation curves.

Discussion

In this contribution aspects of inter-sample input signal behavior are examined. The starting point is that parametric identication always is performed on basis of discrete-time data. This is valid for identication of discrete-time models as well as continuous-time models. The usual assumptions on the input signal are; i) it is band-limited, ii) it is piecewise constant or iii) it is piecewise linear. One point made in this paper is that if a discrete-time model is used, the best possible (in the model structure) adjustment to data is made. This is independent of the assumption on the input signal. However, a transformation of the obtained discrete model to a continuous one is not possible without additional assumptions on the input signal. The other point made is that the frequency functions of the discrete models very well coincides with the frequency functions of the discretized continuous time models and the continuous time transfer function fitted in the frequency domain

Tropical Nevanlinna theory and second main theorem

We present a version of the tropical Nevanlinna theory for real-valued, continuous, piecewise linear functions on the real line. In particular, a tropical version of the second main theorem is proved. Applications to some ultra-discrete equations are given.Comment: 43 pages, 3 figure

Piecewise Linear Control Systems

This thesis treats analysis and design of piecewise linear control systems. Piecewise linear systems capture many of the most common nonlinearities in engineering systems, and they can also be used for approximation of other nonlinear systems. Several aspects of linear systems with quadratic constraints are generalized to piecewise linear systems with piecewise quadratic constraints. It is shown how uncertainty models for linear systems can be extended to piecewise linear systems, and how these extensions give insight into the classical trade-offs between fidelity and complexity of a model. Stability of piecewise linear systems is investigated using piecewise quadratic Lyapunov functions. Piecewise quadratic Lyapunov functions are much more powerful than the commonly used quadratic Lyapunov functions. It is shown how piecewise quadratic Lyapunov functions can be computed via convex optimization in terms of linear matrix inequalities. The computations are based on a compact parameterization of continuous piecewise quadratic functions and conditional analysis using the S-procedure. A unifying framework for computation of a variety of Lyapunov functions via convex optimization is established based on this parameterization. Systems with attractive sliding modes and systems with bounded regions of attraction are also treated. Dissipativity analysis and optimal control problems with piecewise quadratic cost functions are solved via convex optimization. The basic results are extended to fuzzy systems, hybrid systems and smooth nonlinear systems. It is shown how Lyapunov functions with a discontinuous dependence on the discrete state can be computed via convex optimization. An automated procedure for increasing the flexibility of the Lyapunov function candidate is suggested based on linear programming duality. A Matlab toolbox that implements several of the results derived in the thesis is presented