AI & ML
TensorSpectra: Bridging the Spectral and Tensor Worlds for High-Dimensional PDEs
arXiv cs.NA0 views
arXiv:2610.38087v2 Announce Type: replace 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 $\mathcal{O}(N^d)$ to $\mathcal{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 four representative baselines, with TensorSpectra consistently achieving the lowest relative $L^2$ errors. More broadly, our findings highlight the potential of low-rank spectral formulations for high-dimensional PDEs, motivating further investigation of coefficient-space approaches and enriching the methodological landscape of numerical PDEs solving.
Source:https://arxiv.org/abs/2610.38087PreviousA cut energy-based discontinuous Galerkin method for the wave equationNext$H^2$-based equilibrated residual error estimates
Related posts

Parallels Desktop review
0TechRadar
How Far Behind Are Open Weights, Measured
0dev.to
Claude was trained on protein sequences at scale
0Hacker News
Pretraining vs post-training: one apple problem, four learning signals
0dev.to Beginners
Bitcoin Recovery Expert USA: Professional Crypto Asset Recovery with META TECH RETRIEVE PRO
0dev.to Beginners
Hugging Face Switches Its Inference Providers to OpenRouter Routing
0dev.to OpenSource