TensorSpectra: Bridging the Spectral and Tensor Worlds for High-Dimensional PDEs

arXiv:2610.38087 · math.NA, cs.NA · Submitted 2026-10-28 · Read on arXiv

math.NA, cs.NA

Submitted: 2026-10-28

Updated: 2026-11-17

License: http://creativecommons.org/licenses/by/4.0/

The gist: High-dimensional partial differential equations (PDEs) remain challenging for spectral methods due to the exponential growth of multidimensional coefficient spaces.

Abstract

High-dimensional partial differential equations (PDEs) remain challenging for spectral methods due to the exponential growth of multidimensional coefficient spaces. We propose TensorSpectra, a low-rank spectral framework that directly parameterizes spectral coefficient tensors in canonical polyadic (CP) form, reducing representation complexity from O(N d) to O(dNr). TensorSpectra combines structure-preserving spectral calculus, de-aliased nonlinear interactions, operator-aware residual weighting, and progressive low-rank corrections to enable efficient PDEs solving in compressed coefficient space. We further establish a theoretical framework connecting spectral truncation, low-rank approximation, and optimization errors. Extensive experiments across five PDE families and 24 benchmark configurations demonstrate State-Of-The-Art accuracy among five representative baselines, with TensorSpectra consistently achieving the lowest relative L squared errors. More broadly, our findings offer a new perspective on high-dimensional PDEs solving, suggesting that exploiting intrinsic low-rank structure in spectral coefficient space provides a viable alternative to conventional physical-space approaches.

Sources

Related papers