Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeneralized monotone schemes, discrete paths of extrema, and discrete entropy conditions
151
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Solutions to conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this property from a numerical standpoint. We introduce a class of fully discrete in space and time, high order accurate, difference schemes, called generalized monotone schemes. Convergence toward the entropy solution is proven via a new technique of proof, assuming that the initial data has a finite number of extremum values only, and the flux-function is strictly convex. We define discrete paths of extrema by tracking local extremum values in the approximate solution. In the course of the analysis we establish the pointwise convergence of the trace of the solution along a path of extremum. As a corollary, we obtain a proof of convergence for a MUSCL-type scheme being second order accurate away from sonic points and extrema.
rate research
Read More
A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advanced calculus; later, Dubins result was reproved using control theory techniques [Reeds and Shepp, 1990], [Sussmann and Tang, 1991], [Boissonnat, Cerezo, and Leblond, 1994]. We introduce and study a discrete analogue of curvature-constrained motion. We show that shortest bounded-curvature polygonal paths have the same structure as Dubins paths. The properties of Dubins paths follow from our results as a limiting case---this gives a new, discrete proof of Dubins result.
The classical problem of moments is addressed by the maximum entropy approach for one-dimensional discrete distributions. The numerical technique of adaptive support approximation is proposed to reconstruct the distributions in the region where the main part of probability mass is located.
We consider general systems of ordinary differential equations with monotonic Gibbs entropy, and introduce an entropic scheme that simply imposes an entropy fix after every time step of any existing time integrator. It is proved that in the general case, our entropy fix has only infinitesimal influence on the numerical order of the original scheme, and in many circumstances, it can be shown that the scheme does not affect the numerical order. Numerical experiments on the linear Fokker-Planck equation and nonlinear Boltzmann equation are carried out to support our numerical analysis.
In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough path techniques. As a by-product, we provide a natural explanation of the various new asymptotic behaviors in contrast with the classical unweighted random sum case. We apply our principle to derive some weighted type Breuer-Major theorems, which generalize previous results to random sums that do not have to be in a finite sum of chaos. In this context, a Breuer-Major type criterion in notion of Hermite rank is obtained. We also consider some applications to realized power variations and to Itos formulas in law. In the end, we study the asymptotic behavior of weighted quadratic variations for some multi-dimensional Gaussian processes.
These lecture notes offer a gentle introduction to the two-dimensional Discrete Gaussian Free Field with particular attention paid to the scaling limits of the level sets at heights proportional to the absolute maximum. The bulk of the text is based on recent joint papers with O. Louidor and with J. Ding and S. Goswami. Still, new proofs of the tightness and distributional convergence of the centered DGFF maximum are presented that by-pass the use of the modified Branching Random Walk. The text contains a wealth of instructive exercises and a list of open questions and conjectures for future research.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
