Related papers: Computing complex horseshoes by means of piecewise…
Nonlinear dynamic models are widely used for characterizing functional forms of processes that govern complex biological pathway systems. Over the past decade, validation and further development of these models became possible due to data…
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…
A set of algorithms is presented for efficient numerical calculation of the time evolution of classical dynamical systems. Starting with a first approximation for solving the differential equations that has a "reversible" character, we show…
Machine learning techniques not only offer efficient tools for modelling dynamical systems from data, but can also be employed as frontline investigative instruments for the underlying physics. Nontrivial information about the original…
Many complex systems are characterized by intriguing spatio-temporal structures. Their mathematical description relies on the analysis of appropriate correlation functions. Functional integral techniques provide a unifying formalism that…
Effectively modeling phenomena present in highly nonlinear dynamical systems whilst also accurately quantifying uncertainty is a challenging task, which often requires problem-specific techniques. We present a novel, domain-agnostic…
Experiments observing the liquid surface in a vertically oscillating container have indicated that modeling the dynamics of such systems require maps that admit states at infinity. In this paper we investigate the bifurcations in such a…
Modeling the temporal behavior of data is of primordial importance in many scientific and engineering fields. Baseline methods assume that both the dynamic and observation equations follow linear-Gaussian models. However, there are many…
In this study, a theory analogous to both the theories of polynomial-like mappings and Smale's real horseshoes is developed for the study of the dynamics of mappings of two complex variables. In partial analogy with polynomials in a single…
Starting from kicked equations of motion with derivatives of non-integer orders, we obtain "fractional" discrete maps. These maps are generalizations of well-known universal, standard, dissipative, kicked damped rotator maps. The main…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
We develop a stochastic calculus that makes it easy to capture a variety of predictable transformations of semimartingales such as changes of variables, stochastic integrals, and their compositions. The framework offers a unified treatment…
A simple construction is presented, which generalises piecewise linear one-dimensional Markov maps to an arbitrary number of dimensions. The corresponding coupled map lattice, known as a simplicial mapping in the mathematical literature,…
We consider dynamics of a scalar piecewise linear "saw map" with infinitely many linear segments. In particular, such maps are generated as a Poincar\'e map of simple two-dimensional discrete time piecewise linear systems involving a…
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the…
We study the complexity of functions computable by deep feedforward neural networks with piecewise linear activations in terms of the symmetries and the number of linear regions that they have. Deep networks are able to sequentially map…
We show some of the mathematics that is being developed for the computation of deep inelastic structure functions to three loops. These include harmonic sums, harmonic polylogarithms and a class of difference equations that can be solved…
When modeling complex robot systems such as branched robots, whose kinematic structures are a tree, current techniques often require modeling the whole structure from scratch, even when partial models for the branches are available. This…
Contemporary chess engines offer precise yet opaque evaluations, typically expressed as centipawn scores. While effective for decision-making, these outputs obscure the underlying contributions of individual pieces or patterns. In this…
In this paper, we present a novel approach to decompose a given piecewise affine (PWA) function into two convex PWA functions. Convex decompositions are useful to speed up or distribute evaluations of PWA functions. Different approaches to…