Related papers: On condition numbers of symmetric and nonsymmetric…
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…
This paper is part of a series developing $C^0$ finite element methods for fourth-order elliptic equations on polygonal domains. Here, we investigate how boundary conditions influence the design of effective $C^0$ schemes, specifically…
Even in cases where quantum linear solvers provide significant speedup compared to their classical counterparts, their performance depends on some of the same parameters. In particular, the condition number of the matrix which is to be…
In this article we present the first results on domain decomposition methods for nonlocal operators. We present a nonlocal variational formulation for these operators and establish the well-posedness of associated boundary value problems,…
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial differential equations with highly varying coefficients. The method is based on a discontinuous Galerkin formulation. We present both a…
The numerical solution of differential equations can be formulated as an inference problem to which formal statistical approaches can be applied. However, nonlinear partial differential equations (PDEs) pose substantial challenges from an…
We study two techniques for correcting the geometrical error associated with domain approximation by a polygon. The first was introduced some time ago \cite{bramble1972projection} and leads to a nonsymmetric formulation for Poisson's…
We present twelve numerical methods for evaluation of objects and concepts from Poisson geometry. We describe how each method works with examples, and explain how it is executed in code. These include methods that evaluate Hamiltonian and…
It is well known that the usual mixed method for solving the biharmonic eigenvalue problem by decomposing the operator into two Laplacians may generate spurious eigenvalues on non-convex domains. To overcome this difficulty, we adopt a…
The paper develops new methods of non-parametric estimation a compound Poisson distribution. Such a problem arise, in particular, in the inference of a Levy process recorded at equidistant time intervals. Our key estimator is based on…
The very weak solution of the Poisson equation with $L^2$ boundary data is defined by the method of transposition. The finite element solution with regularized boundary data converges in the $L^2(\Omega)$-norm with order $1/2$ in convex…
In this paper, we study the biharmonic equation with the Navier boundary conditions in a polygonal domain. In particular, we propose a method that effectively decouples the 4th-order problem into a system of Poisson equations. Different…
In this study we develop a systematic procedure to construct a Poisson operator that describes the dynamics of a three dimensional nonholonomic system. Instead of reducing by symmetry the antisymmetric operator that links the energy…
This work considers the iterative solution of large-scale problems subject to non-symmetric matrices or operators arising in discretizations of (port-)Hamiltonian partial differential equations. We consider problems governed by an operator…
We extend the ultraspherical spectral method to solving nonlinear ODE boundary value problems. We propose to use the inexact Newton-GMRES framework for which an effective preconditioner can be constructed and a fast Jacobian-vector…
The very weak solution of the Poisson equation with $L^2$ boundary data is defined by the method of transposition. The finite element solution with regularized boundary data converges with order $1/2$ in convex domains but has a reduced…
This paper proposes a domain decomposition subspace neural network method for efficiently solving linear and nonlinear partial differential equations. By combining the principles of domain decomposition and subspace neural networks, the…
Domain decomposition (DD) methods are widely used as preconditioner techniques. Their effectiveness relies on the choice of a locally constructed coarse space. Thus far, this construction was mostly achieved using non-assembled matrices…
We address composite optimization problems, which consist in minimizing the sum of a smooth and a merely lower semicontinuous function, without any convexity assumptions. Numerical solutions of these problems can be obtained by proximal…
Consider the Poisson equation with the Dirichlet boundary condition on a three-dimensional polyhedral domain. For singular solutions from the non-smoothness of the domain boundary, we propose new anisotropic tetrahedral mesh refinement…