Skip to content
DraconiticResearch
Search Sources API
190,332 studies31 sourcesUpdated 46 min ago
PreprintCC BY 4.0arXiv

Numerical Stability of Extended-Domain Spectral Collocation: Floating-Point Regularization and an Equilibrium Law for the Frame Constants

Abstract

Extended-domain spectral collocation expands the solution of a boundary value problem in the Laplacian eigenbasis of an enclosing box and collocates at as many nodes as modes. The square system is exponentially ill-conditioned, and the impossibility theorem for equispaced data rules out stable geometric convergence; yet such solvers converge geometrically to a few orders of magnitude above the unit roundoff. We explain why in one dimension. The collocation solution is the solution operator applied to the interpolant of the data in an operator-dependent test space whose Lebesgue constant must grow exponentially for geometric convergence, so exact solutions can amplify data errors exponentially. In floating-point arithmetic the error of any coefficient vector is bounded by its nodal residual, its distance to a competitor and two frame constants, a leakage and a restricted Marcinkiewicz--Zygmund constant, bounded uniformly in the number of modes at a fixed positive threshold; for a backward-stable solve, under a condition on the perturbed matrix, the bound is uniform in the conditioning for suitably analytic data and, with computed constants, within a factor of about ten of the error floor of a direct solver. For the Poisson operator the rate of the two constants along the tail of the spectrum is given by a constrained equilibrium problem of logarithmic potential theory. For an interval of length L extended by δ at each end, the problems for δ and L2/(4δ) are dual, the rate is linear for δ= L/2, and it starts with slope minus the fraction of the extended domain occupied by the extension, so for δ< L/2 the leakage constant obeys no power law with the exponent of the end of the spectrum. In experiments, convection--diffusion operators behave like the Poisson operator at moderate Péclet numbers.

Related

  1. Numerical approximation of RBSDEs via regularization
    Ankush Agarwal, Emmanuel Gobet, Yihan Zou
    HALPreprintCC BY 4.0Full textProbabilityHAL
  2. Spectral constants for algebraic numerical ranges
    Tomasz Kania
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  3. An energy-decreasing algorithm for the finite element approximation of ferronematic equilibrium states and its numerical realization
    Alexandre Ern, Ruma R. Maity
    HALPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingHALarXiv
  4. Analysis, thermodynamics, and a numerical solver for a pressure-temperature equilibrium closure of the four-equation model
    Bennett Clayton, Joshua McConnell, Clell Solomon
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingComputational physicsarXiv
  5. Regularization and algebraic stability of birational automorphisms
    Alexandra Kuznetsova
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{wu2026numerical,
  title = {{Numerical Stability of Extended-Domain Spectral Collocation: Floating-Point Regularization and an Equilibrium Law for the Frame Constants}},
  author = {Po-Yi Wu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.13222},
  eprint = {2610.13222},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.13222},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Numerical Stability of Extended-Domain Spectral Collocation: Floating-Point Regularization and an Equilibrium Law for the Frame Constants
AU  - Po-Yi Wu
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2610.13222
UR  - https://arxiv.org/abs/2610.13222
AB  - Extended-domain spectral collocation expands the solution of a boundary value problem in the Laplacian eigenbasis of an enclosing box and collocates at as many nodes as modes. The square system is exponentially ill-conditioned, and the impossibility theorem for equispaced data rules out stable geometric convergence; yet such solvers converge geometrically to a few orders of magnitude above the unit roundoff. We explain why in one dimension. The collocation solution is the solution operator applied to the interpolant of the data in an operator-dependent test space whose Lebesgue constant must grow exponentially for geometric convergence, so exact solutions can amplify data errors exponentially. In floating-point arithmetic the error of any coefficient vector is bounded by its nodal residual, its distance to a competitor and two frame constants, a leakage and a restricted Marcinkiewicz--Zygmund constant, bounded uniformly in the number of modes at a fixed positive threshold; for a backward-stable solve, under a condition on the perturbed matrix, the bound is uniform in the conditioning for suitably analytic data and, with computed constants, within a factor of about ten of the error floor of a direct solver. For the Poisson operator the rate of the two constants along the tail of the spectrum is given by a constrained equilibrium problem of logarithmic potential theory. For an interval of length L extended by δ at each end, the problems for δ and L^2/(4δ) are dual, the rate is linear for δ= L/2, and it starts with slope minus the fraction of the extended domain occupied by the extension, so for δ< L/2 the leakage constant obeys no power law with the exponent of the end of the spectrum. In experiments, convection--diffusion operators behave like the Poisson operator at moderate Péclet numbers.
ER  -