It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.
Rooted binary
- NSF-PAR ID:
- 10496570
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- Bulletin of Mathematical Biology
- Volume:
- 86
- Issue:
- 5
- ISSN:
- 0092-8240
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract arXiv:2010.09793 ) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators$$L_{\beta ,\gamma } =- {\text {div}}D^{d+1+\gamma -n} \nabla $$ $$\Omega \subset {\mathbb {R}}^n$$ $$\Gamma $$ $$d < n-1$$ $$D = D_\beta $$ $$D_\beta (X)^{-\beta } = \int _{\Gamma } |X-y|^{-d-\beta } d\sigma (y)$$ $$X \in \Omega $$ $$\beta >0$$ $$\gamma \in (-1,1)$$ G for$$L_{\beta ,\gamma }$$ $$D^{1-\gamma }$$ $$\big | D\nabla \big (\ln \big ( \frac{G}{D^{1-\gamma }} \big )\big )\big |^2$$ $$\Omega $$ -
more » « less
Abstract A long-standing problem in mathematical physics is the rigorous derivation of the incompressible Euler equation from Newtonian mechanics. Recently, Han-Kwan and Iacobelli (Proc Am Math Soc 149:3045–3061, 2021) showed that in the monokinetic regime, one can directly obtain the Euler equation from a system of
N particles interacting in$${\mathbb {T}}^d$$ $$d\ge 2$$ supercritical mean-field limit . Namely, the coupling constant$$\lambda $$ $$N^{-\theta }$$ $$\theta \in (0,1)$$ $$\lambda \sim N^{-1}$$ $$\theta \in (1-\frac{2}{d(d+1)},1)$$ $$N\rightarrow \infty $$ $$\theta $$ $$N\rightarrow \infty $$ $$\theta \in (1-\frac{2}{d},1)$$ $$\theta $$ $$\theta \le 1-\frac{2}{d}$$ -
more » « less
Abstract In the present paper, we show that for an optimal class of elliptic operators with non-smooth coefficients on a 1-sided Chord-Arc domain, the boundary of the domain is uniformly rectifiable if and only if the Green function
G behaves like a distance function to the boundary, in the sense that$$\left| \frac{\nabla G(X)}{G(X)}-\frac{\nabla D(X)}{D(X)}\right| ^2D(X) dX$$ D is a regularized distance adapted to the boundary of the domain. The main ingredient in our proof is a corona decomposition that is compatible with Tolsa’s$$\alpha $$ -
more » « less
Abstract In this paper, we study multistage stochastic mixed-integer nonlinear programs (MS-MINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization with
non-Lipschitzian value functions and multistage stochastic mixed-integer linear optimization. We develop stochastic dual dynamic programming (SDDP) type algorithms with nested decomposition, deterministic sampling, and stochastic sampling. The key ingredient is a new type of cuts based on generalized conjugacy. Several interesting classes of MS-MINLP are identified, where the new algorithms are guaranteed to obtain the global optimum without the assumption of complete recourse. This significantly generalizes the classic SDDP algorithms. We also characterize the iteration complexity of the proposed algorithms. In particular, for a$$(T+1)$$ L -exact Lipschitz regularization withd -dimensional state spaces, to obtain an$$\varepsilon $$ $${\mathcal {O}}((\frac{2LT}{\varepsilon })^d)$$ $${\mathcal {O}}((\frac{LT}{4\varepsilon })^d)$$ $${\mathcal {O}}((\frac{LT}{8\varepsilon })^{d/2-1})$$ polynomially on the number of stages. We further show that the iteration complexity dependslinearly onT , if all the state spaces are finite sets, or if we seek a$$(T\varepsilon )$$ T . To the best of our knowledge, this is the first work that reports global optimization algorithms as well as iteration complexity results for solving such a large class of multistage stochastic programs. The iteration complexity study resolves a conjecture by the late Prof. Shabbir Ahmed in the general setting of multistage stochastic mixed-integer optimization. -
more » « less
Abstract Finite volume, weighted essentially non-oscillatory (WENO) schemes require the computation of a smoothness indicator. This can be expensive, especially in multiple space dimensions. We consider the use of the simple smoothness indicator
$$\sigma ^{\textrm{S}}= \frac{1}{N_{\textrm{S}}-1}\sum _{j} ({\bar{u}}_{j} - {\bar{u}}_{m})^2$$ $$N_{\textrm{S}}$$ $${\bar{u}}_j$$ j , and indexm gives the target element. Reconstructions utilizing standard WENO weighting fail with this smoothness indicator. We develop a modification of WENO-Z weighting that gives a reliable and accurate reconstruction of adaptive order, which we denote as SWENOZ-AO. We prove that it attains the order of accuracy of the large stencil polynomial approximation when the solution is smooth, and drops to the order of the small stencil polynomial approximations when there is a jump discontinuity in the solution. Numerical examples in one and two space dimensions on general meshes verify the approximation properties of the reconstruction. They also show it to be about 10 times faster in two space dimensions than reconstructions using the classic smoothness indicator. The new reconstruction is applied to define finite volume schemes to approximate the solution of hyperbolic conservation laws. Numerical tests show results of the same quality as standard WENO schemes using the classic smoothness indicator, but with an overall speedup in the computation time of about 3.5–5 times in 2D tests. Moreover, the computational efficiency (CPU time versus error) is noticeably improved.
