相关论文: Series solution of Laplace problems

A high-order quadrature scheme is constructed for the evaluation of Laplace single and double layer potentials and their normal derivatives on smooth surfaces in three dimensions. The construction begins with a harmonic approximation of the…

We propose a high-order version of the augmented Lagrangian method for solving convex optimization problems with linear constraints, which achieves arbitrarily fast -- and even superlinear -- convergence rates. First, we analyze the…

Linear system solving is one of the main workhorses in applied mathematics. Recently, theoretical computer scientists have contributed sophisticated algorithms for solving linear systems with symmetric diagonally dominant matrices (a class…

Borel summable divergent series usually appear when studying solutions of analytic ODE near a multiple singular point. Their sum, uniquely defined in certain sectors of the complex plane, is obtained via the Borel--Laplace transformation.…

For lambda phi^4 problems, convergent perturbative series can be obtained by cutting off the large field configurations. The modified series converge to values exponentially close to the exact ones. For lambda larger than some critical…

This paper complements the existing theory developed in [5] for the Dirichlet and Neumann problems for the Laplace equation, in multiply connected domains. Within the framework of layer potential methods, we study the Laplace equation under…

In time series analysis, when fitting an autoregressive model, one must solve a Toeplitz ordinary least squares problem numerous times to find an appropriate model, which can severely affect computational times with large data sets. Two…

Lawson and Osserman proved that the Dirichlet problem for the minimal surface system is not always solvable in the class of Lipschitz maps. However, it is known that minimizing sequences (for area) of Lipschitz graphs converge to objects…

We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…

For quasi-linear interface problems with discontinuous diffusion coefficients, the nonconvex objective functional often leads to optimization stagnation in randomized neural network approximations. This paper Proposes a…

Lame equation arises from deriving Laplace equation in ellipsoidal coordinates; in other words, it's called ellipsoidal harmonic equation. Lame functions are applicable to diverse areas such as boundary value problems in ellipsoidal…

We study the Cauchy problem associated with the equations governing a fluid loaded plate formulated on either the line or the half-line. We show that in both cases the problem can be solved by employing the unified approach to boundary…

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

In this paper we extend the classical sub-supersolution Sattinger iteration method to $1$-Laplace type boundary value problems of the form \begin{equation*} \begin{cases} \displaystyle -\Delta_1 u = F(x,u) & \text{in}\;\Omega,\\ \newline…

We introduce an alternative to the method of matched asymptotic expansions. In the "traditional" implementation, approximate solutions, valid in different (but overlapping) regions are matched by using "intermediate" variables. Here we…

In mixed finite element approximations of Hodge Laplace problems associated with the de Rham complex, the exterior derivative operators are computed exactly, so the spatial locality is preserved. However, the numerical approximations of the…

Solution of some boundary value problems and initial problems in unique ball leads to the convergence and sumability problems of Fourier series of given function by eigenfunctions of Laplace operator on a sphere - spherical harmonics. Such…

In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficiently and in polynomial…

The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10-1000 times…

Using a hierarchical construction, we develop methods for a wide and flexible class of models by taking a fully parametric approach to generalized linear mixed models with complex covariance dependence. The Laplace approximation is used to…