Related papers: An efficient algorithm for solving elliptic proble…
We investigate the iterative methods proposed by Maz'ya and Kozlov (see [3], [4]) for solving ill-posed reconstruction problems modeled by PDE's. We consider linear time dependent problems of elliptic, hyperbolic and parabolic types. Each…
We use a diffuse interface method for solving Poisson's equation with a Dirichlet condition on an embedded curved interface. The resulting diffuse interface problem is identified as a standard Dirichlet problem on approximating regular…
We prove the existence of classical solutions to the Dirichlet problem for a class of fully nonlinear elliptic equations of curvature type on Riemannian manifolds. We also derive new second derivative boundary estimates which allows us to…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
We propose a clustering-based iterative algorithm to solve certain optimization problems in machine learning, where we start the algorithm by aggregating the original data, solving the problem on aggregated data, and then in subsequent…
We study an iterative Galerkin method for quasilinear elliptic problems in the Browder-Minty setting. The resulting discrete nonlinear systems are solved by linearization via a (damped) Zarantonello iteration. Unlike prior work, adaptive…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
In this paper, the elliptic PDE-constrained optimization problem with box constraints on the control is studied. To numerically solve the problem, we apply the 'optimize-discretize-optimize' strategy. Specifically, the alternating direction…
In this work, we present a novel iterative deep Ritz method (IDRM) for solving a general class of elliptic problems. It is inspired by the iterative procedure for minimizing the loss during the training of the neural network, but at each…
In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9,18], and tensor…
In this paper, we propose a numerical method to solve isotropic elliptic equations on point cloud by generalizing the point integral method. The idea of the point integral method is to approximate the differential operators by integral…
The classical Dirichlet problem on the unit disk can be solved by different numerical approaches. The two most common and popular approaches are the integration of the associated Poisson integral and, by applying Dirichlet's principle,…
In this manuscript we present an approach to analyze the discontinuous Galerkin solution for general quasilinear elliptic problems. This approach is sufficiently general to extend most of the well-known discretization schemes, including…
A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…
A simple burning or epidemic type of algorithm is developed in order to test whether any loops in percolation clusters link a fixed reference loop, a problem considered recently by Gliozzi, Lottini, Panero, and Rago in the context of gauge…
We extend the framework of a posteriori error estimation by preconditioning in [Li, Y., Zikatanov, L.: Computers \& Mathematics with Applications. \textbf{91}, 192-201 (2021)] and derive new a posteriori error estimates for H(curl)-elliptic…
In this paper, we use a probabilistic approach to show that there exists a unique, bounded continuous solution to the Dirichlet boundary value problem for a general class of second order non-symmetric elliptic operators $L$ with singular…
We present a continuous/discontinuous Galerkin method for approximating solutions to a fourth order elliptic PDE on a surface embedded in $\mathbb{R}^3$. A priori error estimates, taking both the approximation of the surface and the…