pith. sign in

arxiv: 2604.05975 · v1 · submitted 2026-04-07 · 🧮 math.NA · cs.NA

A boundary integral equation method for Steklov eigenvalue problems for smooth planar domains

Pith reviewed 2026-05-10 18:22 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords Steklov eigenvaluesboundary integral equationsgeneralized Neumann kernelharmonic conjugationplanar domainsnumerical spectral methodseigenvalue approximation
0
0 comments X

The pith

The Steklov spectrum of smooth simply connected planar domains can be computed accurately from boundary data alone using a generalized conjugation operator.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a numerical method to approximate the Steklov eigenvalues and eigenfunctions for smooth simply connected planar domains. It extends the explicit Dirichlet-to-Neumann operator known for the unit disk to general domains by means of a generalized conjugation operator obtained from a boundary integral equation with the generalized Neumann kernel. Combined with Fourier differentiation on an equidistant boundary grid, the approach yields a dense matrix eigenvalue problem whose solutions give the boundary traces of the eigenfunctions. The method requires no interior discretization, handles interior and exterior problems uniformly, and recovers the eigenfunctions inside the domain by harmonic extension. A reader would care because it offers an efficient, geometry-flexible way to study how domain shape controls the Steklov spectrum on benchmark and parameter-dependent families of smooth curves.

Core claim

The Steklov spectrum of smooth simply connected planar domains can be approximated accurately by a boundary-only formulation based on harmonic conjugation through the generalized conjugation operator defined via the boundary integral equation with the generalized Neumann kernel, combined with Fourier differentiation on an equidistant boundary grid. This produces a dense algebraic eigenvalue problem for the boundary traces of the eigenfunctions, uses only boundary data, treats interior and exterior problems in a unified way, and reconstructs eigenfunctions in the domain by harmonic extension.

What carries the argument

The generalized conjugation operator obtained from the boundary integral equation with the generalized Neumann kernel, which extends the classical conjugation operator of the unit disk and, together with Fourier differentiation, converts the Steklov problem into a boundary algebraic eigenvalue problem.

If this is right

  • The method yields high-accuracy Steklov eigenvalues for ellipses, star-like curves, and other smooth parameter-dependent families without interior meshing.
  • Interior and exterior Steklov problems are treated by the same boundary formulation.
  • Boundary traces of eigenfunctions are obtained directly and can be extended harmonically to the whole domain.
  • The dependence of the spectrum on geometric parameters can be tracked continuously across families of smooth domains.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same boundary-integral conjugation idea may apply to other boundary-value eigenvalue problems whose operators can be reduced to the Dirichlet-to-Neumann map.
  • For domains with corners or lower regularity the equidistant Fourier grid would need replacement by a more adaptive quadrature or basis.
  • The approach could be embedded in shape-optimization loops that seek domains realizing prescribed Steklov spectra.

Load-bearing premise

The generalized conjugation operator defined via the boundary integral equation with the generalized Neumann kernel correctly extends harmonic conjugation to arbitrary smooth simply connected domains, and Fourier differentiation on an equidistant grid introduces negligible error for the targeted smooth boundaries.

What would settle it

Apply the method to the unit disk, where the exact Steklov eigenvalues are known to be the nonnegative integers with multiplicity two for each positive integer; if the computed spectrum deviates from these exact values by more than discretization tolerance, the extension or grid accuracy fails.

Figures

Figures reproduced from arXiv: 2604.05975 by Harri Hakula, Jamie Swan, Matti Vuorinen, Mohamed M.S. Nasser.

Figure 1
Figure 1. Figure 1: The eigenvalues of the matrices K (left) and E (center) for the bounded domain in [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗
Figure 4
Figure 4. Figure 4: The condition number of the matrix Q + I, for the matrix Q defined in (35), is also presented in [PITH_FULL_IMAGE:figures/full_fig_p011_4.png] view at source ↗
Figure 2
Figure 2. Figure 2: The boundary Γ for the domain G1 (left) and the domain G2 (right) for Example 1. 0 100 200 300 400 n 10−15 10−10 10−5 100 Relative Error λ1 λ2 λ3 λ4 λ5 λ6 λ7 λ8 λ9 λ10 0 100 200 300 400 n 10−15 10−10 10−5 100 Relative Error λ1 λ2 λ3 λ4 λ5 λ6 λ7 λ8 λ9 λ10 [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The relative error for the first 10 nonzero eigenvalues for the domains [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The number of iterations and CPU time (sec) required for the convergence of the MATLAB [PITH_FULL_IMAGE:figures/full_fig_p013_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The eigenvalues λk for 1 ≤ k ≤ 10 (left), 30 ≤ k ≤ 40 (center), and 90 ≤ k ≤ 100 (right) for the domain G1 in Example 1. 0 ≤ t ≤ 2π. For unbounded domain G2, the orientation of Γ is assumed to be clockwise and hence Γ will be parametrized by η(t) = 1.5 cos(t) + 0.7 cos(2t) − 0.4 + i(−1.5 sin(t) − 0.3 cos(t)), (39) 0 ≤ t ≤ 2π. For this example, we present in [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: The eigenvalues λk for 1 ≤ k ≤ 10 (left), 30 ≤ k ≤ 40 (center), and 90 ≤ k ≤ 100 (right) for the domain G2 in Example 1 [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Eigenmodes for the first 8 nonzero eigenvalues [PITH_FULL_IMAGE:figures/full_fig_p014_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Boundary traces of the eigenmodes corresponding to the first 8 nonzero eigenvalues [PITH_FULL_IMAGE:figures/full_fig_p014_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: The boundary Γ for Example 2 [PITH_FULL_IMAGE:figures/full_fig_p015_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: The relative error for the first 10 nonzero eigenvalues for bounded domain [PITH_FULL_IMAGE:figures/full_fig_p016_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: The number of iterations and CPU time (sec) required for the convergence of the MATLAB [PITH_FULL_IMAGE:figures/full_fig_p016_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: The eigenvalues for 1 ≤ k ≤ 10 (left), 30 ≤ k ≤ 40 (center), 90 ≤ k ≤ 100 (right) for both domains G1 and G2 in Example 2 [PITH_FULL_IMAGE:figures/full_fig_p017_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Eigenmodes for the first 8 nonzero eigenvalues for the bounded domain [PITH_FULL_IMAGE:figures/full_fig_p017_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Boundary traces of the eigenmodes corresponding to the first 8 nonzero eigenvalues for [PITH_FULL_IMAGE:figures/full_fig_p017_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: The first 10 nonzero eigenvalues as functions of [PITH_FULL_IMAGE:figures/full_fig_p018_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: The relative error for the first 10 nonzero eigenvalues for the bounded domain [PITH_FULL_IMAGE:figures/full_fig_p018_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: The number of iterations and CPU time (sec) required for the convergence of the MATLAB [PITH_FULL_IMAGE:figures/full_fig_p019_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: The eigenmodes of the first 8 nonzero eigenvalues of the bounded domain [PITH_FULL_IMAGE:figures/full_fig_p020_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: The eigenmodes of the first 8 nonzero eigenvalues of the unbounded domain [PITH_FULL_IMAGE:figures/full_fig_p020_19.png] view at source ↗
Figure 20
Figure 20. Figure 20: The eigenvalues λk for several values of k and r for the bounded domain G1 (first row) and the unbounded domain G2 (second row) in Example 3. r 2 4 6 8 10 Eigenvalues 0 1 2 3 4 5 6 7 8 9 1 λ1 + 1 λ2 λ1λ2 r 2 4 6 8 10 Eigenvalues 0 0.5 1 1.5 2 2.5 3 λ1 1 a√ r [PITH_FULL_IMAGE:figures/full_fig_p022_20.png] view at source ↗
Figure 21
Figure 21. Figure 21: Verifying the inequalities (42) (left) and (43) (right) numerically for several values of [PITH_FULL_IMAGE:figures/full_fig_p022_21.png] view at source ↗
Figure 22
Figure 22. Figure 22: The first 10 nonzero eigenvalues as functions of [PITH_FULL_IMAGE:figures/full_fig_p023_22.png] view at source ↗
Figure 23
Figure 23. Figure 23: The eigenmodes of the first 9 nonzero eigenvalues of the bounded domain [PITH_FULL_IMAGE:figures/full_fig_p024_23.png] view at source ↗
Figure 24
Figure 24. Figure 24: The eigenmodes of the first 9 nonzero eigenvalues of the unbounded domain [PITH_FULL_IMAGE:figures/full_fig_p025_24.png] view at source ↗
read the original abstract

In this paper, we study the computational question of whether the Steklov spectrum of smooth simply connected planar domains can be approximated accurately by a boundary-only formulation based on harmonic conjugation. For the unit disk, the Dirichlet-to-Neumann operator can be written explicitly in terms of the classical conjugation operator. We show how this viewpoint extends to general bounded and unbounded simply connected domains through the generalized conjugation operator defined through the boundary integral equation with the generalized Neumann kernel. Combined with Fourier differentiation on an equidistant boundary grid, this leads to a dense algebraic eigenvalue problem for the boundary traces of Steklov eigenfunctions. The resulting method uses only boundary data, treats interior and exterior problems in a unified way, and reconstructs eigenfunctions in the domain by harmonic extension. Numerical experiments on benchmark domains and on parameter-dependent smooth families, including ellipses and star-like curves, show high accuracy for smooth boundaries and illustrate how the Steklov spectrum changes with geometry.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper develops a boundary integral equation method to approximate the Steklov spectrum of smooth simply connected planar domains. It extends the explicit Dirichlet-to-Neumann operator from the unit disk to general domains via the generalized conjugation operator defined by the boundary integral equation with the generalized Neumann kernel. Discretization combines this operator with Fourier differentiation on an equidistant boundary grid to produce a dense algebraic eigenvalue problem for the boundary traces of eigenfunctions; eigenfunctions are recovered by harmonic extension. The method treats interior and exterior problems uniformly and is tested numerically on ellipses, star-like curves, and parameter-dependent families, reporting high accuracy for smooth boundaries.

Significance. If the discretization achieves the claimed accuracy, the approach supplies an efficient, boundary-only scheme that unifies interior/exterior Steklov problems and leverages standard integral operators plus harmonic extension. This could be valuable for shape optimization or spectral geometry computations on planar domains. The absence of free parameters in the core derivation and the use of established kernels are positive features.

major comments (2)
  1. [§3 and §4] §3 (discretization of the generalized conjugation operator) and §4 (numerical experiments): Fourier differentiation is applied on an equidistant parameter grid for non-circular domains (ellipses, star-like curves). For parametrizations that are not arc-length uniform, this grid is non-uniform in physical arc length; without explicit Jacobian weights or re-parametrization, the discrete differentiation operator approximates the continuous operator only to O(h) or O(h^2) rather than spectrally. This directly affects the accuracy of the resulting Steklov eigenvalues, especially higher modes, and is the least-secured step in the high-accuracy claim. The manuscript should supply a convergence analysis or numerical comparison against arc-length parametrization to confirm spectral accuracy.
  2. [Table 1, Figure 3] Table 1 and Figure 3 (ellipse and star-like results): reported eigenvalue errors decrease rapidly with N, but without a clear statement of the underlying parametrization (polar angle vs. arc length) or quadrature corrections, it is unclear whether the observed rates are consistent with the equidistant-grid Fourier scheme or require hidden re-weighting. This needs explicit clarification because it bears on whether the method truly extends the unit-disk case without loss of spectral accuracy.
minor comments (2)
  1. [§2] Notation for the generalized Neumann kernel and conjugation operator should be introduced with a brief reminder of its integral-equation definition in §2 to improve readability for readers unfamiliar with the kernel.
  2. [Abstract, §1] The abstract and introduction claim 'high accuracy' without specifying the norm or reference solution used; a short sentence defining the error measure would help.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and valuable suggestions. We address the major comments below and will incorporate the necessary clarifications and additions in the revised manuscript.

read point-by-point responses
  1. Referee: [§3 and §4] Fourier differentiation is applied on an equidistant parameter grid for non-circular domains (ellipses, star-like curves). For parametrizations that are not arc-length uniform, this grid is non-uniform in physical arc length; without explicit Jacobian weights or re-parametrization, the discrete differentiation operator approximates the continuous operator only to O(h) or O(h^2) rather than spectrally. This directly affects the accuracy of the resulting Steklov eigenvalues, especially higher modes, and is the least-secured step in the high-accuracy claim. The manuscript should supply a convergence analysis or numerical comparison against arc-length parametrization to confirm spectral accuracy.

    Authors: We agree that the discretization details in Section 3 require more explicit treatment to confirm spectral accuracy for general parametrizations. In the revised version, we will expand the description of the discrete generalized conjugation operator to include the explicit incorporation of the parametrization speed |γ'(θ)| when recovering the arc-length derivative from the Fourier differentiation in the parameter θ. We will also add a brief theoretical note on the spectral convergence for smooth periodic parametrizations and include numerical comparisons using arc-length reparametrization in Section 4 to verify the rates. revision: yes

  2. Referee: [Table 1, Figure 3] reported eigenvalue errors decrease rapidly with N, but without a clear statement of the underlying parametrization (polar angle vs. arc length) or quadrature corrections, it is unclear whether the observed rates are consistent with the equidistant-grid Fourier scheme or require hidden re-weighting. This needs explicit clarification because it bears on whether the method truly extends the unit-disk case without loss of spectral accuracy.

    Authors: We will revise the presentation of the numerical results in Section 4, including the captions for Table 1 and Figure 3, to explicitly describe the parametrizations employed (polar angle for the ellipse and star-like examples) and confirm that the differentiation and quadrature steps include the appropriate metric factors derived from the boundary parametrization. This clarification will demonstrate that the observed convergence rates are consistent with the spectral method without hidden adjustments. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation extends standard harmonic conjugation independently of target eigenvalues

full rationale

The paper's chain begins with the explicit Dirichlet-to-Neumann operator on the unit disk, then defines the generalized conjugation operator via the boundary integral equation with the generalized Neumann kernel for general smooth simply connected domains. This definition rests on established properties of harmonic functions and integral operators, not on the Steklov eigenvalues or spectrum being computed. Fourier differentiation on the equidistant boundary grid is introduced as a standard discretization step to form the algebraic eigenvalue problem. No equation or claim reduces a prediction to a fitted parameter, self-referential definition, or load-bearing self-citation chain; the numerical validation on benchmarks is external to the derivation itself. The approach is self-contained against external benchmarks for smooth domains.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The approach relies on classical properties of harmonic functions in simply connected domains and on the existence and properties of the generalized Neumann kernel; no new free parameters, invented entities, or ad-hoc axioms are introduced beyond standard assumptions of boundary integral theory.

axioms (2)
  • standard math The Dirichlet-to-Neumann operator on the unit disk can be expressed explicitly using the classical conjugation operator.
    Invoked in the abstract as the starting point for the generalization.
  • domain assumption The generalized conjugation operator defined by the boundary integral equation with the generalized Neumann kernel correctly reproduces the Dirichlet-to-Neumann map for arbitrary smooth simply connected domains.
    This is the central modeling step that allows the method to extend beyond the disk.

pith-pipeline@v0.9.0 · 5472 in / 1536 out tokens · 32843 ms · 2026-05-10T18:22:04.925707+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages

  1. [1]

    Alhejaili & C

    W. Alhejaili & C. Kao, Numerical studies of the Steklov eigenvalue problem via conformal mappings,Appl. Math. Comput.347 (2019) 785-802

  2. [2]

    Atkinson, The numerical solution of integral equations of the second kind, Cambridge university press, Cambridge, 1997

    K.E. Atkinson, The numerical solution of integral equations of the second kind, Cambridge university press, Cambridge, 1997

  3. [3]

    Auscher & M

    P. Auscher & M. Egert, Boundary Value Problems and Hardy Spaces for Elliptic Systems with Block Structure, Birkh¨ auser, Cham, 2023

  4. [4]

    Babuˇ ska & J

    I. Babuˇ ska & J. Osborn, Eigenvalue problems, In: Handbook of Numerical Analysis, Vol. 2, Elsevier, pp. 641–787, 1991

  5. [5]

    Bundrock, A

    L. Bundrock, A. Girouard, D.S. Grebenkov, M. Levitin, & I. Polterovich, The exterior Steklov problem for Euclidean domains,arXiv:2511.09490(2025)

  6. [6]

    Dittmar, Eigenvalue Problems and Conformal Mapping, In: Handbook of Complex Analysis: Geometric Functional Theory, Vol

    B. Dittmar, Eigenvalue Problems and Conformal Mapping, In: Handbook of Complex Analysis: Geometric Functional Theory, Vol. 2, Elsevier B.V, pp. 669–686, 2005

  7. [7]

    Duren, Theory ofH p Spaces, Academic Press, New York, 1970

    P. Duren, Theory ofH p Spaces, Academic Press, New York, 1970

  8. [8]

    Gaier, Konstruktive Methoden der konformen Abbildung, Springer, Berlin, 1964

    D. Gaier, Konstruktive Methoden der konformen Abbildung, Springer, Berlin, 1964

  9. [9]

    Girouard & I

    A. Girouard & I. Polterovich, Spectral geometry of the Steklov problem (survey article), J. Spectral Theory 7 (2017) 321–359

  10. [10]

    Henrici, Applied and Computational Complex Analysis, Vol

    P. Henrici, Applied and Computational Complex Analysis, Vol. 3, John Wiley & Sons, New York, 1986

  11. [11]

    Henrot, Extremum Problems for Eigenvalues of Elliptic Operators, Birkh¨ auser, Basel, 2006

    A. Henrot, Extremum Problems for Eigenvalues of Elliptic Operators, Birkh¨ auser, Basel, 2006

  12. [12]

    Hersch, L

    J. Hersch, L. Payne & M. Schiffer, Some inequalities for Stekloff eigenvalues,Arch. Ration. Mech. Anal.57 (1975) 99–114. 27

  13. [13]

    Kuznetsov, T

    N. Kuznetsov, T. Kulczycki, M. Kwasnicki, A. Nazarov, S. Poborchi, I. Polterovich & B. Siudeja, The legacy of Vladimir Andreevich Steklov,Notices Amer. Math. Soc.61 (2014) 9–23

  14. [14]

    J.M. Lee & G. Uhlmann, Determining anisotropic real-analytic conductivities by boundary measurements,Comm. Pure Appl. Math.42 (1989) 1097–1112

  15. [15]

    Levitin, D

    M. Levitin, D. Mangoubi & I. Polterovich, Topics in spectral geometry, AMS, Providence, 2023

  16. [16]

    Nasser, A nonlinear integral equation for numerical conformal mapping,Adv

    M.M.S. Nasser, A nonlinear integral equation for numerical conformal mapping,Adv. Pure Appl. Math.1 (2010) 47–63

  17. [17]

    Nasser, Convergence of numerical solution of generalized Theodorsen’s nonlinear integral equation,Abstr

    M.M.S. Nasser, Convergence of numerical solution of generalized Theodorsen’s nonlinear integral equation,Abstr. Appl. Anal.2014 (2014) 213296

  18. [18]

    Nasser, Fast solution of boundary integral equations with the generalized Neumann kernel,Electron

    M.M.S. Nasser, Fast solution of boundary integral equations with the generalized Neumann kernel,Electron. Trans. Numer. Anal.44 (2015) 189–229

  19. [19]

    Nasser, A.H.M

    M.M.S. Nasser, A.H.M. Murid, M. Ismail & E.M.A. Alejaily, Boundary integral equations with generalized Neumann kernel for Laplace’s equation in multiply connected regions,Appl. Math. Comput.217 (2011) 4710–4727

  20. [20]

    Naqos, A.H.M

    S. Naqos, A.H.M. Murid, M.M.S. Nasser & S.H. Yeak, Computing the Dirichlet-to-Neumann map via an integral equation with the adjoint generalized Neumann kernel,Partial Differ. Equ. Appl. Math.12 (2024) 100967

  21. [21]

    Sauter & C

    S. Sauter & C. Schwab, Boundary Element Methods, Springer, Berlin, 2011

  22. [22]

    Schwab,p- andhp-Finite Element Methods, Oxford University Press, Oxford, 1998

    C. Schwab,p- andhp-Finite Element Methods, Oxford University Press, Oxford, 1998

  23. [23]

    Szab´ o & I

    B. Szab´ o & I. Babuˇ ska, Finite Element Analysis, Wiley, New York, 1991

  24. [24]

    Taylor, Partial Differential Equations II: Qualitative Studies of Linear Equations, Springer, 2011

    M.E. Taylor, Partial Differential Equations II: Qualitative Studies of Linear Equations, Springer, 2011

  25. [25]

    Trefethen & J.A.C

    L.N. Trefethen & J.A.C. Weideman, The exponentially convergent trapezoidal rule,SIAM Rev. 56 (2014) 385–458

  26. [26]

    Wegmann, Methods for numerical conformal mapping

    R. Wegmann, Methods for numerical conformal mapping. In: Handbook of Complex Analysis: Geometric Function Theory, Vol. 2, Elsevier B. V., pp. 351–477, 2005

  27. [27]

    Wegmann, A.H.M

    R. Wegmann, A.H.M. Murid & M.M.S. Nasser, The Riemann-Hilbert problem and the general- ized Neumann kernel,J. Comput. Appl. Math.182 (2005) 388–415

  28. [28]

    Weinstock, Inequalities for a classical eigenvalue problem,J

    R. Weinstock, Inequalities for a classical eigenvalue problem,J. Ration. Mech. Anal.3 (1954) 745–753. 28