This paper is devoted to exploiting the restrictions of Riesz–Morrey potentials on either unbounded or bounded domains in Euclidean spaces.

No abstract uploaded!

A solution to a Dirichlet problem for the complex Monge-Ampère operator is characterized as a minimizer of an energy functional. A mutual energy estimate and a generalization of Hölder's inequality is proved. A comparison is made with corresponding results in classical potential theory.

We consider the problem of the random fluctuations in the solutions to elliptic PDEs with highly oscillatory random coefficients. In our setting, as the correlation length of the fluctuations tends to zero, the heterogeneous solution converges to a deterministic solution obtained by averaging. When the Green’s function to the unperturbed operator is sufficiently singular (i.e., not square integrable locally), the leading corrector to the averaged solution may be either deterministic or random, or both in a sense we shall explain. Our main application is the solution of an elliptic problem with random Robin boundary condition that may be used to model diffusion of signaling molecules through a layer of cells into a bulk of extracellular medium. The problem is then described by an elliptic pseudo-differential operator (a Dirichlet-to-Neumann operator) on the boundary of the domain with random potential. In the physical setting of a three dimensional extracellular medium on top of a two-dimensional surface of cells forming a layer of epithelium, we show that the approximate corrector to averaging consists of a deterministic correction plus a Gaussian field of amplitude proportional to the correlation length of the random medium. The result is obtained under some assumptions on the four-point correlation function in the medium. We provide examples of such random media based on Gaussian and Poisson statistics.

We propose an inverse iterative method for computing the Perron pair of an irreducible nonnegative third order tensor. The method involves the selection of a parameter $\theta_k$ in the $k$th iteration. For every positive starting vector, the method converges quadratically and is positivity preserving in the sense that the vectors approximating the Perron vector are strictly positive in each iteration. It is also shown that $\theta_k=1$ near convergence. The computational work for each iteration of the proposed method is less than four times (three times if the tensor is symmetric in modes two and three, and twice if we also take the parameter to be $1$ directly) that for each iteration of the Ng--Qi--Zhou algorithm, which is linearly convergent for essentially positive tensors.