Spectral Boundary-Enforcing Kernels

• Spectral, boundary-enforcing kernels are mathematical constructs that combine eigen-decomposition with exact boundary condition enforcement, crucial for accurate PDE and operator learning.
• They integrate analytic, algebraic, and optimization-based techniques to modify classical kernels, ensuring global spectral approximation while strictly satisfying domain constraints.
• Applied in fields like PINNs, Gaussian process regression, and conformal field theory, these kernels optimize spectral rank and enhance model stability under complex boundary conditions.

A spectral, boundary-enforcing kernel is a mathematical construct designed to simultaneously encode global spectral properties and exactly satisfy prescribed boundary or domain constraints. These kernels are central in scientific computing, PDE-constrained learning, signal processing, quantum control, conformal field theory, Gaussian process regression, and large-scale kernel methods, where precision at boundaries is as crucial as global approximation properties. They combine spectral (or frequency-domain) characteristics—such as eigenbasis expansion, filtering, or integral operator structure—with explicit imposition of boundary conditions via analytic, algebraic, or optimization-based mechanisms.

1. Foundational Concepts: Spectral Kernels and Boundary Enforcement

Spectral kernels are operators or positive (semi-)definite functions characterized by a decomposition in terms of eigenfunctions and eigenvalues—this underlies classical spectral methods and modern kernel machines. They can represent covariance, Green’s functions, or reproducing kernels, yielding an efficient and often asymptotically optimal description of function spaces.

Boundary enforcement refers to mechanisms that make the native space of the kernel (or the function class defined by the kernel) automatically satisfy user-prescribed, typically homogeneous, boundary conditions (e.g., Dirichlet, Neumann, Robin, or more general constraints). Spectral, boundary-enforcing kernels marry the global approximation power of spectral representations with strict satisfaction of these constraints, crucial in operator learning, high-order PDE solvers, and certain physics-informed ML models.

Mechanisms for boundary enforcement are diverse and may include:

• Analytic modification of classical kernels (e.g., by projection or correction, as in the RBF construction).
• Combinatorial (algebraic) modification for positive-definite kernels and RBFs using boundary-correcting formulas.
• Multiplicative spatial filters (gating) in PINN-type neural architectures, modulating the effective spectrum.
• Integral transforms for strongly enforcing in-/out-of-band frequency constraints in quantum control.
• Synthesis of covariance or Green’s function kernels with spectral boundary correction for physical PDEs (Xie et al., 29 Dec 2025, Christlieb et al., 2024, Azarnavid et al., 2016, Reich et al., 2013, Padilla-Segarra et al., 23 Jul 2025).

2. Principle Constructions in Machine Learning and Scientific Computing

Physics-Informed Neural Networks (PINNs)

In HC-PINNs (hard-constraint PINNs), the solution ansatz $$\tilde{u}(\mathbf{x};\theta) = A(\mathbf{x}) + B(\mathbf{x})N(\mathbf{x};\theta)$$ exactly enforces boundary data via $A$ and a boundary-vanishing spatial envelope $B$. The neural tangent kernel (NTK) of the trial function is given by:

$$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$

where $K_N$ is the NTK of the unconstrained network. Here, $B(\mathbf x)$ acts as a spectral filter, reshaping the eigenspectrum of both the native and residual NTKs. The boundary function’s spatial regularity directly controls the kernel’s effective rank: sharp or singular $B$ induces “spectral collapse” (most eigenvalues tending to zero), stalling optimization despite exact boundary data (Xie et al., 29 Dec 2025).

Table 1: Boundary Functions and Spectral Consequences in HC-PINNs

$B(x)$ Form	Spectral Effect	Recommendation
$x(1-x)$, $\tanh(\alpha x)\tanh(\alpha(1-x))$	Preserves interior modes	Preferred for robust training
$A$0, large $A$1	Spectral collapse; low $A$2	Avoid for high-order $A$3
Rational/exponential envelopes	Tunable filtering	Good for controlled decay

Design is thus recast as a spectral optimization problem: maximize effective rank of $A$4 subject to $A$5 and smoothness/interior positivity (Xie et al., 29 Dec 2025).

Kernel-Based PDE Solvers

Integral and RBF kernels for operator approximation often experience order-reduction at boundaries. High-order, boundary-corrected kernels are constructed by adding analytic boundary-correcting terms (based on Taylor expansions at the boundary) to classical kernel expressions. For derivative operators, one recursively defines correction terms to ensure the approximation matches the required order at the boundary, restoring full "spectral-like" convergence (error $A$6 for $A$7 correction terms), as shown for first and second-order PDEs (Christlieb et al., 2024).

Boundary-Enforcing Corrections for Positive Definite Kernels

Given a kernel $A$8 and boundary conditions $A$9, a sequence of rank-one corrections produces a new kernel $B$0 such that all boundary constraints are satisfied identically:

$B$1

This procedure preserves strict positive-definiteness and allows RBF-based spectral methods for PDEs to achieve full spectral convergence and optimal conditioning without separately collocating at boundaries (Azarnavid et al., 2016).

3. Spectral Filtering and Strict Boundary Constraints in Frequency Domain

In optimal quantum control, spectral constraints are imposed in the Krotov optimization framework by penalizing components of the control field $B$2 outside a desired frequency window. This is achieved via an extra quadratic penalty:

$B$3

with $B$4 the inverse Fourier transform of the desired frequency-domain weight $B$5.

Choosing $B$6 as the indicator of admissible frequency band leads to a projector kernel that strictly enforces vanishing Fourier coefficients outside the desired band—i.e., strictly boundary-enforcing in the spectral (frequency) sense. The resultant update rule leads to a Fredholm integral equation that can be efficiently solved using degenerate kernel methods. Positivity of $B$7 ensures monotonic convergence of the Krotov procedure (Reich et al., 2013).

4. Spectral-Kernel Boundary Analysis in Statistical Estimation and Inverse Problems

For spectral density estimation (e.g., time series analysis), boundary-enforcing kernels are constructed for local polynomial estimation near jump discontinuities in frequency space. One-sided (boundary-adapted) kernels are formulated by solving constrained moment equations (requiring polynomial reproduction and restriction of support to one side of the boundary):

$B$8

where $B$9 is constructed from Legendre polynomials to enforce boundary matching and minimize error constants. This ensures optimal rates ($$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$0 for mean-squared error) at boundaries, matching interior convergence rates and avoiding bias near discontinuities (Sidorenko et al., 2018).

5. Spectral, Boundary-Constrained Kernels in Gaussian Process Regression

For vector-valued Gaussian processes modeling physical systems with strong geometric or physical constraints (e.g., divergence-free fluid flows with Dirichlet boundary conditions), a general methodology synthesizes spectral projection and kernel differentiation:

• Start with an arbitrary $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$1-smooth base kernel $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$2.
• For a closed boundary $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$3, compute the Mercer eigendecomposition of the Gram operator $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$4 on $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$5.
• "Lift" eigensolutions off the boundary to the whole domain, constructing a modified kernel $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$6 that strictly vanishes whenever $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$7 or $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$8 lies on $$K_{HC}(\mathbf x,\mathbf x') = B(\mathbf x)K_N(\mathbf x,\mathbf x')B(\mathbf x')$$9:

$K_N$0

where $K_N$1 are lifts of boundary eigenfunctions.

• Apply derivative operators (e.g., $K_N$2) to encode essential physical constraints (e.g., incompressibility), yielding the final spectral, boundary-constrained kernel $K_N$3.

This hybrid approach enforces both geometric boundary conditions and global physicality, is compatible with arbitrary smooth base kernels, and supports efficient offline/online decoupling for large-scale GPR (Padilla-Segarra et al., 23 Jul 2025).

6. Spectral Boundary Kernels in Conformal Field Theory

In boundary and crosscap conformal field theories (CFTs), spectral kernels are constructed as explicit integral transforms relating correlators expanded in different eigenbases (bulk/boundary alpha-space expansions). For $K_N$4-dimensional BCFT, the bulk-to-boundary and boundary-to-bulk crossing kernels ($K_N$5, $K_N$6) are written as Mellin-Barnes integrals and can be recast in terms of Wilson functions (generalized hypergeometric functions). These spectral kernels exactly enforce crossing (bootstrap) relations and domain constraints, yielding involutive, unitary maps between function spaces (Hogervorst, 2017).

7. Summary and Practical Recommendations

Spectral, boundary-enforcing kernels unify the enforcement of strong constraints (geometric, physical, spectral, or analytic) with global approximation properties inherent in spectral representations. Across methods—neural (NTK-based), kernel-based, quantum control, or Gaussian process regression—two classes of mechanism recur:

• Multiplicative spatial modulation: Boundary or cutoff functions act as pointwise gates, altering the NTK or covariance spectrum to strictly enforce constraints (with careful tuning required to avoid spectral collapse) (Xie et al., 29 Dec 2025).
• Projection/correction: Analytical or algebraic subtraction of boundary-violating components modifies the kernel, yielding native spaces where boundary conditions are satisfied identically (Padilla-Segarra et al., 23 Jul 2025, Christlieb et al., 2024, Azarnavid et al., 2016).

Best practices include maximizing the effective spectral rank subject to boundary and smoothness requirements, using spectral projections or analytic corrections for exact satisfaction, and accessing the full flexibility of arbitrary smooth base kernels when possible. The interplay between global spectral properties and local constraint enforcement is fundamental to the expressive power and optimization properties of these constructions (Xie et al., 29 Dec 2025, Padilla-Segarra et al., 23 Jul 2025, Reich et al., 2013, Hogervorst, 2017, Sidorenko et al., 2018, Christlieb et al., 2024, Azarnavid et al., 2016).