Related papers: Sweeping by a tame process
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
Sweeping is a commonly used procedure to explicitly solve the discrete ordinates equation, which itself is a common approximation of the neutron transport equation. To sweep through the computational domain, an ordering of the spatial cells…
A dynamical version of the Bourgain-Fremlin-Talagrand dichotomy shows that the enveloping semigroup of a dynamical system is either very large and contains a topological copy of $\beta \N$, or it is a "tame" topological space whose topology…
We expose some ideas from mathematical logics, i.e. the background of the theory of o-minimal structures, and demonstrate how they lead to the notion of a tame integral of motion and some extensions and clarifications of previous results on…
Let $(X,G)$ be a minimal equicontinuous dynamical system, where $X$ is a compact metric space and $G$ some topological group acting on $X$. Under very mild assumptions, we show that the class of regular almost automorphic extensions of…
We show that for any quasimeromorphic mapping with an essential singularity at infinity, there exist points whose iterates tend to infinity arbitrarily slowly. This extends a result by Nicks for quasiregular mappings, and Rippon and…
The paper is devoted to deriving necessary optimality conditions in a general optimal control problem for dynamical systems governed by controlled sweeping processes with hard-constrained control actions entering both polyhedral moving sets…
In this paper we consider the Moreau's sweeping processes driven by a time dependent prox-regular set $C(t)$ which is continuous in time with respect to the asymmetric distance $e$ called the excess, defined by $e(A,B) := \sup_{x \in A}…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more generally, definable in some o-minimal structure. Our sufficient…
The paper concerns boundary value problems for general nonautonomous first order quasilinear hyperbolic systems in a strip. We construct small global classical solutions, assuming that the right hand sides are small. In the case that all…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
We begin development of a method for studying dynamical systems using concepts from computational complexity theory. We associate families of decision problems, called telic problems, to dynamical systems of a certain class. These decision…
The use of iteration and piecewise functions allows analytic expression of the trajectories of an R\"ossler-like attractor, avoiding infinite series solution. It seems possible to extend this approach to other attractors, even if the…
It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…
In this paper, we study the existence of solutions to sweeping processes in the presence of stochastic perturbations, where the moving set takes uniformly prox-regular values and varies continuously with respect to the Hausdorff distance,…