Related papers: An efficient algorithm for solving elliptic proble…
We show, that under natural assumptions, solutions of Dirichlet problems for uniformly elliptic divergence form operator can be approximated pointwise by solutions of some versions of Robin problems. The proof is based on stochastic…
We study the size of the near-critical window for Bernoulli percolation on $\mathbb Z^d$. More precisely, we use a quantitative Grimmett-Marstrand theorem to prove that the correlation length, both below and above criticality, is bounded…
We present a novel algorithm based on the ensemble Kalman filter to solve inverse problems involving multiscale elliptic partial differential equations. Our method is based on numerical homogenization and finite element discretization and…
Several important problems in partial differential equations can be formulated as integral equations. Often the integral operator defines the solution of an elliptic problem with specified jump conditions at an interface. In principle the…
The probabilities of clusters spanning a hypercube of dimensions two to seven along one axis of a percolation system under criticality were investigated numerically. We used a modified Hoshen--Kopelman algorithm combined with Grassberger's…
In this paper, we prove an extrapolation result for complex coefficient divergence form operators that satisfy a strong ellipticity condition known as $p$-{\it ellipticity}. Specifically, let $\Omega$ be a chord-arc domain in $\mathbb R^n$…
Integral estimates for weak solutions to a class of Dirichlet problems for nonlinear, fully anisotropic, elliptic equations with a zero order term are obtained using symmetrization techniques.
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
We derive a priori second order estimates for solutions of a class of fully nonlinear elliptic equations on Riemannian manifolds under some very general structure conditions. We treat both equations on closed manifolds, and the Dirichlet…
In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse…
We give integral formulas to approximate solutions of Dirichlet and Neumann problems for Helmholtz equation at high frequencies. These approximations are valid in the complementary of a union of convex compact obstacles. The first step of…
In this paper, we propose a new adaptation of the D-iteration algorithm to numerically solve the differential equations. This problem can be reinterpreted in 2D or 3D (or higher dimensions) as a limit of a diffusion process where the…
We provide a mathematical framework for studying different versions of discontinuous Galerkin (DG) approaches for solving 2D Riemann-Liouville fractional elliptic problems on a finite domain. The boundedness and stability analysis of the…
This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the…
We present a simple numerical algorithm for solving elliptic equations where the diffusion coefficient, the source term, the solution and its flux are discontinuous across an irregular interface. The algorithm produces second-order accurate…
We construct clustering positive solutions for a perturbed critical elliptic equation on a closed manifold of dimension $n=4,5$. Such a construction is already available in the literature in dimensions $n\ge 6$ (see for instance…
An elegant bootstrap percolation result on the hyperrectangle graph was proved by Balogh, Bollob\'as, Morris, and Riordan using a linear algebric method in 2012. This paper studies the same problem by purely combinatorial means. The base…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We present a new approach to the numerical upscaling for elliptic problems with rough diffusion coefficient at high contrast. It is based on the localizable orthogonal decomposition of $H^1$ into the image and the kernel of some novel…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…