Related papers: Damping factors for the gap-tooth scheme
This paper introduces an adaptive time splitting technique for the solution of stiff evolutionary PDEs that guarantees an effective error control of the simulation, independent of the fastest physical time scale for highly unsteady…
Compressed inverted indices in use today are based on the idea of gap compression: documents pointers are stored in increasing order, and the gaps between successive document pointers are stored using suitable codes which represent smaller…
This paper shows how to evolve numerically the maximum entropy probability distributions for a given set of constraints, which is a variational calculus problem. An evolutionary algorithm can obtain approximations to some well-known…
The dynamics of a one dimensional growth model involving attachment and detachment of particles is studied in the presence of a localized growth inhomogeneity along with anchored boundary conditions. At large times, the latter enforce an…
Motion planning and control problems are embedded and essential in almost all robotics applications. These problems are often formulated as stochastic optimal control problems and solved using dynamic programming algorithms. Unfortunately,…
Many applied time-dependent problems are characterized by an additive representation of the problem operator. Additive schemes are constructed using such a splitting and associated with the transition to a new time level on the basis of the…
This work proposes a discretization of the acoustic wave equation with possibly oscillatory coefficients based on a superposition of discrete solutions to spatially localized subproblems computed with an implicit time discretization. Based…
Nonadiabatic holonomic quantum computation has robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates…
In this thesis we study properties of open quantum dissipative evolutions of spin systems on lattices described by Lindblad generators, in a particular regime that we denote rapid mixing. We consider dissipative evolutions with a unique…
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing…
We present new algorithms for the problem of multiple string matching of gapped patterns, where a gapped pattern is a sequence of strings such that there is a gap of fixed length between each two consecutive strings. The problem has…
We investigate the effects of the interaction between time-inhomogeneous damping, non-local diffusion, and noise on classical solutions to the Camassa--Holm equations that incorporate these additional factors. Initially, a local-in-time…
We consider algorithms that, from an arbitrarily sampling of $N$ spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formulated as minimization problems with non-convex constraints.…
An implicit Euler finite-volume scheme for general cross-diffusion systems with volume-filling constraints is proposed and analyzed. The diffusion matrix may be nonsymmetric and not positive semidefinite, but the diffusion system is assumed…
Energy methods for constructing time-stepping algorithms are of increased interest in application to nonlinear problems, since numerical stability can be inferred from the conservation of the system energy. Alternatively, symplectic…
Generative models such as diffusion models, excel at capturing high-dimensional distributions with diverse input modalities, e.g. robot trajectories, but are less effective at multi-step constraint reasoning. Task and Motion Planning (TAMP)…
Decoherence-free subspaces allow for the preparation of coherent and entangled qubits for quantum computing. Decoherence can be dramatically reduced, yet dissipation is an integral part of the scheme in generating stable qubits and…
We consider one dimensional lattice diffusion model on a microscale grid with many discrete diffusivity values which repeat periodicially. Computer algebra explores how the dynamics of small coupled `patches' predict the slow emergent…
A quasi-second order scheme is developed to obtain approximate solutions of the shallow water equationswith bathymetry. The scheme is based on a staggered finite volume scheme for the space discretization:the scalar unknowns are located in…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…