Source-linked AI summary

Analysis of an inexact Schwarz domain decomposition method in 3D

Nibedita Ghosh

arXiv:2610.13793v1math.NAcs.NA

TL;DR

Inexact Schwarz methods for ddCOSMO use projected boundary data, but their local solver lacks the maximum principle because the truncated kernel can become negative near the boundary. This paper analyzes the 3D method on two overlapping spheres, proves positivity on an interior radius, and derives a maximum-principle bound that supports convergence analysis.

  • Problem

    In 3D, spherical-harmonic projection makes the inexact local solver's truncated kernel sign-changing near the boundary, so the exact-solver maximum principle does not directly apply.

    Source: §1 · p. 2
  • Method

    The paper represents the projected local solver with a truncated Poisson kernel, proves its positivity on an interior radius, and derives a corresponding maximum principle.

    Source: §1 · p. 2
  • Results

    For odd N≥5, K_N is nonnegative through radius r_N, yielding a maximum-principle bound except within a boundary layer of width O(ln N/N).

    Source: §1 · p. 2
  • Takeaways & Limitations

    The maximum principle provides maximum-norm bounds for the inexact Dirichlet-to-Dirichlet map that determines Schwarz-spherical convergence.

    Source: §1 · p. 3

    The analysis studies the iteration error only, not the discretization error.

    Source: §5 · p. 8

Abstract

from arXiv · show

We consider an inexact version of the Schwarz domain decomposition method in $3$D to solve a Laplace problem in a domain that is the union of two overlapping spheres. We solve each subproblem approximately by projecting its boundary data $L^2$-orthogonally onto the space of spherical harmonics of degree at most $N$. The model problem arises from the ddCOSMO solver used for implicit solvation in computational chemistry. We analyze the Schwarz-spherical domain decomposition method by establishing a new variant of the maximum principle.

1 Introduction

The paper extends inexact Schwarz analysis to the 3D setting relevant to ddCOSMO, where spherical-harmonic projection makes the local solver's truncated kernel sign-changing near the boundary. It establishes kernel positivity on an interior radius, derives a corresponding maximum principle, and uses it to analyze convergence.

1 Introduction

  • In COSMO, the Laplace problem on a union of overlapping atomic balls is used to compute electrostatic solvation energy; spherical-harmonic local solves make the ddCOSMO approach efficient for large molecules.Each local boundary problem is approximated using spherical harmonics up to a fixed degree N [1].Source: §1 · p. 1
  • The work addresses the gap left by analyses that assume exact subdomain solves, extending the inexact-solver maximum-principle approach from 2D disks to 3D overlapping spheres.In ddCOSMO, boundary data on each sphere are projected onto spherical harmonics through degree N; the 3D truncated Legendre kernel oscillates and becomes negative near the boundary, unlike the exact Poisson kernel.Source: §1 · p. 2
  • The inexact local solution operator is an integral operator whose kernel is the Poisson kernel projected onto spherical harmonics of degree at most N.This representation is established in Lemma 5.1.Source: §1 · p. 2
  • For every odd N≥5, the truncated kernel K_N is nonnegative for all points with radius r≤r_N.The proof relates the kernel minimum to its value at the antipodal point and estimates zeros of the resulting closed form using the Lambert W function.Source: §1 · p. 2
  • The inexact maximum principle bounds the local solution between the boundary-data minimum and maximum inside radius r_N, leaving a boundary layer of width O(ln N/N).The bound applies to piecewise continuous boundary data.Source: §1 · p. 2
  • For odd N≤100, δ_th(N) exceeds δ_num(N) by less than a factor of two, and δ_num(N)/δ_th(N) increases with N, indicating O(ln N/N) is sharp.The experiments compute the largest radius r_num(N) for which K_N remains nonnegative.Source: §1 · p. 3
  • The new maximum principle bounds the inexact Dirichlet-to-Dirichlet map in the maximum norm, and that map determines Schwarz-spherical convergence.The Schwarz-spherical method is formulated as a fixed-point iteration governed by inexact maps; the total error separates into discretization and iteration errors, and the paper studies the iteration error.Source: §1 · pp. 2–3

2 Solution of a Laplace problem in a unit ball in 3D

The section formulates the 3D Laplace problem in a unit ball with piecewise continuous boundary data and derives its bounded solution using separation of variables and spherical harmonics. It also describes convergence of the spherical-harmonic partial sums and gives a Poisson-kernel representation.

  • The problem is to find a bounded solution of the Laplace equation in the unit ball with piecewise continuous boundary data.The data are assumed to have finitely many discontinuities, with left- and right-hand limits at those points; the discontinuity-free case is allowed.Source: §2 · p. 3
  • Separation of variables yields a bounded solution represented through Legendre polynomials and spherical harmonics.The spherical harmonics form a complete orthonormal basis of L2 on the sphere.Source: §2 · pp. 3–4
  • The Fourier-Laplace partial sums of the boundary data converge in L2 and pointwise away from the discontinuities.The section also gives the limiting behavior at discontinuities separately.Source: §2 · p. 5
  • The solution can also be expressed using the 3D Poisson kernel, whose boundary limit recovers the prescribed data.The text identifies this representation as another solution of the same Laplace problem.Source: §2 · pp. 5–6
  • The Legendre polynomials used in the derivation are obtained by expanding their generating function as a Taylor series.Source: §2 · p. 5

3 Idea of maximum principle

The section develops a weaker version of the maximum principle, called a comparison principle, for Laplace problems with piecewise continuous boundary data. It considers the corresponding solutions for two such data functions.

  • The discussion invokes the maximum principle and a relation satisfied by the Poisson kernel.Source: §3 · p. 6
  • The section introduces a comparison principle for solutions corresponding to piecewise continuous boundary data.Source: §3 · p. 6
  • The comparison principle is framed for two boundary data functions and their respective Laplace-problem solutions.Source: §3 · p. 6

4 Classical Schwarz method for overlapping balls

The section describes the additive Schwarz method for a Laplace problem on the union of two overlapping balls. It defines maps that transfer local solutions to the shared boundary portions and uses them to describe the iteration.

  • The domain consists of two overlapping balls, with the shared boundary portions denoted Γ_i.Each ball has radius and center specified, and the boundary data are continuous on the domain boundary.Source: §4 · pp. 6–7
  • The method uses an additive Schwarz iteration to approximately solve the Laplace problem on the two balls.Source: §4 · p. 7
  • Dirichlet-to-Dirichlet maps transfer local solutions between the shared boundary portions of the balls.The maps are defined by restricting each ball's local solution to the other ball's interior boundary.Source: §4 · p. 7

5 Schwarz-spherical domain decomposition method

The Schwarz-spherical method projects local boundary data onto finite-dimensional spherical-harmonic spaces, and this paper develops a maximum-principle variant for its inexact solver. The analysis establishes positivity of a truncated kernel within a specified interior radius and uses that result to formulate the new principle.

5 Schwarz-spherical domain decomposition method

  • The method projects boundary data on each sphere L2-orthogonally onto spherical harmonics of degree at most N, using the same fixed N for both balls and every iteration.The local approximate boundary data are finite sums of spherical harmonics.Source: §5 · p. 7
  • The analysis separates total error into discretization and iteration components, but studies only the iteration error.It identifies accuracy of the discrete solution as a separate issue from convergence of the iterations.Source: §5 · p. 8

5.1 A variant of the maximum principle

  • The truncated kernel can change sign near the boundary because weak damping fails to suppress oscillations of the Legendre polynomials.The passage describes this sign change as an instance of the Gibbs phenomenon.Source: §5.1 · p. 9
  • For odd N ≥4, the projected Poisson kernel is nonnegative up to the radius r ≤ 1 − 2 ln(2(N+1))/(N+1).The theorem’s bound is sufficient for kernel positivity throughout the stated interior region.Source: §5.1 · pp. 9, 11, 12
  • The paper derives a new maximum-principle variant for boundary data projected into the finite-dimensional spherical-harmonic space.The derivation uses the projected-kernel positivity result.Source: §5.1 · p. 13
Loading 2610.13793v1…