Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDynamical spectrum via determinant-free linear algebra
47
0
0.0
(
0
)
Authors
Joseph Horan
Ask ChatGPT about the research
No Arabic abstract
We consider a sequence of matrices that are associated to Markov dynamical systems and use determinant-free linear algebra techniques (as well as some algebra and complex analysis) to rigorously estimate the eigenvalues of every matrix simultaneously without doing any calculations on the matrices themselves. As a corollary, we obtain mixing rates for every system at once, as well as symmetry properties of densities associated to the system; we also find the spectral properties of a sequence of related factor systems.
rate research
Read More
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with collaborators formalized these kinds of structures (systems of systems) as algebras over presentable colored operads. It is also very useful to consider maps between dynamical systems. This amounts to viewing dynamical systems as objects in an appropriate category. This is the point taken by DeVille and Lerman in the study of dynamics on networks. The goal of this paper is to describe an algebraic structure that encompasses both approaches to systems of systems. To this end we replace the monoidal category of wiring diagrams by a monoidal double category whose objects are surjective submersions. This allows us, on one hand, build new large open systems out of collections of smaller open subsystems and on the other keep track of maps between open systems. As a special case we recover the results of DeVille and Lerman on fibrations of networks of manifolds.
We revisit the visible points of a lattice in Euclidean $n$-space together with their generalisations, the $k$th-power-free points of a lattice, and study the corresponding dynamical system that arises via the closure of the lattice translation orbit. Our analysis extends previous results obtained by Sarnak and by Cellarosi and Sinai for the special case of square-free integers and sheds new light on previous joint work with Peter Pleasants.
We use the dynamical algebra of a quantum system and its dynamical invariants to inverse engineer feasible Hamiltonians for implementing shortcuts to adiabaticity. These are speeded up processes that end up with the same populations than slow, adiabatic ones. As application examples we design families of shortcut Hamiltonians that drive two and a three-level systems between initial and final configurations imposing physically motivated constraints on the terms (generators) allowed in the Hamiltonian.
We examine the diffraction properties of lattice dynamical systems of algebraic origin. It is well-known that diverse dynamical properties occur within this class. These include different orders of mixing (or higher-order correlations), the presence or absence of measure rigidity (restrictions on the set of possible shift-invariant ergodic measures to being those of algebraic origin), and different entropy ranks (which may be viewed as the maximal spatial dimension in which the system resembles an i.i.d. process). Despite these differences, it is shown that the resulting diffraction spectra are essentially indistinguishable, thus raising further difficulties for the inverse problem of structure determination from diffraction spectra. Some of them may be resolved on the level of higher-order correlation functions, which we also briefly compare.
Motivated by the growing requirements on the operation of complex engineering systems, we present contracts as specifications for continuous-time linear dynamical systems with inputs and outputs. A contract is defined as a pair of assumptions and guarantees, both characterized in a behavioural framework. The assumptions encapsulate the available information about the dynamic behaviour of the environment in which the system is supposed to operate, while the guarantees express the desired dynamic behaviour of the system when interconnected with relevant environments. In addition to defining contracts, we characterize contract implementation, and we find necessary conditions for the existence of an implementation. We also characterize contract refinement, which is used to characterize contract conjunction in two special cases. These concepts are then illustrated by an example of a vehicle following system.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
