Related papers: An efficient algorithm for solving elliptic proble…
A fourth-order compact scheme is proposed for a fourth-order subdiffusion equation with the first Dirichlet boundary conditions. The fourth-order problem is firstly reduced into a couple of spatially second-order system and we use an…
This paper presents a decomposition method for solving elliptic boundary value problems in one-dimension. The method is an improvement to an existing technique for approximating elliptic systems. It is demonstrated to be computationally…
We consider the Dirichlet problem in an ellipsoidal cylinder when the data function is entire. Under an additional assumption that the order of the data function is less than one, we show that there is a solution that extends as an entire…
We present a novel integral representation for the biharmonic Dirichlet problem. To obtain the representation, the Dirichlet problem is first converted into a related Stokes problem for which the Sherman-Lauricella integral representation…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
Consider long-range Bernoulli percolation on $\mathbb{Z}^d$ in which we connect each pair of distinct points $x$ and $y$ by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…
This paper is concerned with existence and multiplicity results for the semilinear subelliptic equation with free perturbation term. By using the degenerate Rellich-Kondrachov compact embedding theorem, precise lower bound estimates of…
Let $\Omega $ be a bounded domain in $\mathbb{R}^{d}$ $\left( d\geq 2\right) $ pretty regular. We solve the variational Dirichlet problem for a class of quasi-linear elliptic systems.
We study the Dirichlet problem in Lipschitz domains and with boundary data in Besov spaces, for divergence form strongly elliptic systems of arbitrary order, with bounded, complex-valued coefficients. Our main result gives a sharp condition…
A rapid algorithm is derived for the Helmholtz--Hodge decomposition on the surface of the sphere in spherical coordinates. The algorithm uncouples modes of spherical harmonics with different absolute order, writes the conversion as…
In complex network research clique percolation, introduced by Palla et al., is a deterministic community detection method, which allows for overlapping communities and is purely based on local topological properties of a network. Here we…
In this article, a posteriori error analysis of the elliptic obstacle problem is addressed using hybrid high-order methods. The method involve cell unknowns represented by degree-$r$ polynomials and face unknowns represented by degree-$s$…
The problem of finding elliptical shapes in an image will be considered. We discuss the solution which uses cross-entropy clustering. The proposed method allows the search for ellipses with predefined sizes and position in the space.…
We prove a quantitative, large-scale doubling inequality and large-scale three-ellipsoid inequality for solutions of uniformly elliptic equations with periodic coefficients. These estimates are optimal in terms of the minimal length scale…
We propose and study a novel efficient algorithm for clustering and classification tasks based on the famous MBO scheme. On the one hand, inspired by Jacobs et al. [J. Comp. Phys. 2018], we introduce constraints on the size of clusters…
We derive and analyze high order discontinuous Galerkin methods for second-order elliptic problems on implicitely defined surfaces in $\mathbb{R}^{3}$. This is done by carefully adapting the unified discontinuous Galerkin framework of…
Under structural conditions which are almost optimal, we derive a quantitative version of boundary estimate then prove existence of solutions to Dirichlet problem for a class of fully nonlinear elliptic equations on Hermitian manifolds.
We show that a solution of the optimal assignment problem can be obtained as the limit of the solution of an entropy maximization problem, as a deformation parameter tends to infinity. This allows us to apply entropy maximization algorithms…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…