Related papers: Discrete geodesics and cellular automata
Flexible elastic structures, such as beams, rods, ribbons, plates, and shells, exhibit complex nonlinear dynamical behaviors that are central to a wide range of engineering and scientific applications, including soft robotics, deployable…
A cellular automata approach using a Directed Cyclic Graph is used to model interrelationships of fluctuating time, state and space. This model predicts phenomena including a constant and maximum speed at which any moving entity can travel,…
We propose the difference discrete variational principle in discrete mechanics and symplectic algorithm with variable step-length of time in finite duration based upon a noncommutative differential calculus established in this paper. This…
In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…
We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…
In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t. variety of word transformations performed by the system:…
This paper studies the problem of distributed Riemannian optimization over a network of agents whose cost functions are geodesically smooth but possibly geodesically non-convex. Extending a well-known distributed optimization strategy…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
Geodesics on Riemannian manifolds are precisely the locally length-minimizing curves, but their explicit description via simple functions is rarely possible. Geodesics of the simplest form, such as lines on Euclidean space and great circles…
In this work we study the geodesic motion on a noncommutative space-time. As a result we find a non-commutative geodesic equation and then we derive corrections of the deviation angle per revolution in terms of the non-commutative parameter…
A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
We propose a computer-assisted approach to studying the effective continuum behavior of spatially discrete evolution equations. The advantage of the approach is that the "coarse model" (the continuum, effective equation) need not be…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
We extend the application of Hamiltonian Monte Carlo to allow for sampling from probability distributions defined over symmetric or Hermitian positive definite matrices. To do so, we exploit the Riemannian structure induced by Cartan's…
The Continuum Dislocation Dynamics (CDD) theory and the Discrete Dislocation Dynamics (DDD) method are compared based on concise mathematical formulations of the coarse graining of discrete data. A numerical tool for converting from a…
Distance functions are crucial in robotics for representing spatial relationships between a robot and its environment. They provide an implicit, continuous, and differentiable representation that integrates seamlessly with control,…
Discrete gradient methods are a powerful tool for the time discretization of dynamical systems, since they are structure-preserving regardless of the form of the total energy. In this work, we discuss the application of discrete gradient…
We define an evolution of multiple particles on a discrete manifold $G$. Each particle alone moves on geodesics and particles can interact if they are on the same facet. They move deterministically and reversibly on the frame bundle $P$ of…
Shape optimization is commonly applied in engineering to optimize shapes with respect to an objective functional relying on PDE solutions. In this paper, we view shape optimization as optimization on Riemannian shape manifolds. We consider…