Related papers: Cross-points in the Dirichlet-Neumann method II: a…
We propose an alternative condition for the solvability of the Dirichlet problem for the minimal surface equation that applies to non-mean convex domains. We introduce a structural condition, obtained from a second-order ordinary…
The reduction of computational costs in the numerical solution of nonstationary problems is achieved through splitting schemes. In this case, solving a set of less computationally complex problems provides the transition to a new level in…
We show that if $u$ is a solution to a linear elliptic differential equation of order $2m\geq 2$ in the half-space with $t$-independent coefficients, and if $u$ satisfies certain area integral estimates, then the Dirichlet and Neumann…
This paper proposes a method for rigorously analyzing the sign-change structure of solutions of elliptic partial differential equations subject to one of the three types of homogeneous boundary conditions: Dirichlet, Neumann, and mixed.…
Recent advances in unsupervised domain adaptation (UDA) techniques have witnessed great success in cross-domain computer vision tasks, enhancing the generalization ability of data-driven deep learning architectures by bridging the domain…
In this paper, we partially answer open questions about the convergence of overlapping Schwarz methods. We prove that overlapping Schwarz methods with Dirichlet transmission conditions for semilinear elliptic and parabolic equations always…
This paper concerns the asymptotic expansion of the solution of the Dirichlet-Laplace problem in a domain with small inclusions. This problem is well understood for the Neumann condition in dimension greater than two or Dirichlet condition…
Domain decomposition methods are essential in solving applied problems on parallel computer systems. For boundary value problems for evolutionary equations the implicit schemes are in common use to solve problems at a new time level…
We establish existence and uniqueness results for nonlinear elliptic Dirichlet boundary value problems on n-dimensional time scale domains. Time scales provide a unified framework that encompasses continuous, discrete, and hybrid settings.…
Trimming is a common operation in CAD, and, in its simplest formulation, consists in removing superfluous parts from a geometric entity described via splines (a spline patch). After trimming the geometric description of the patch remains…
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 an overdetermined problem for a two phase elliptic operator in divergence form with piecewise constant coefficients. We look for domains such that the solution $u$ of a Dirichlet boundary value problem also satisfies the…
One of the important aspects of IsoGeometric Analysis (IGA) is the strong link between Computer Aided Design and analysis. Two of IGA'a major challenge are the assembly of patches (Constructive Solid Geometry geometries made of Boolean…
Let $\mathcal{D}$ be a set of straight-line segments in the plane, potentially crossing, and let $c$ be a positive integer. We denote by $P$ the union of the endpoints of the straight-line segments of $\mathcal{D}$ and of the intersection…
This paper is concerned with the discretization error analysis of semilinear Neumann boundary control problems in polygonal domains with pointwise inequality constraints on the control. The approximations of the control are piecewise…
A new penalty-free neural network method, PFNN-2, is presented for solving partial differential equations, which is a subsequent improvement of our previously proposed PFNN method [1]. PFNN-2 inherits all advantages of PFNN in handling the…
The paper deals with finite element approximations of elliptic Dirichlet boundary control problems posed on two-dimensional polygonal domains. Error estimates are derived for the approximation of the control and the state variables. Special…
For elliptic in the half-space and parabolic degenerating on the boundary equation of Keldysh type we construct by similarity method the self-similar solution, which is the approximation to the identity in the class of integrable functions.…
Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…
In this paper, we analyze a substructuring type algorithm for the Cahn-Hilliard (CH) equation. Being a nonlinear equation, it is of great importance to develop efficient numerical schemes for investigating the solution behaviour of the CH…