Abstract This paper provides the first rigorous proof that functions with point singularities in 3D—common in quantum chemistry and electromagnetics—can be approximated with exponential efficiency using quantized tensor formats. The authors demonstrate that the "tensor rank," a measure of computational complexity, grows only polylogarithmically with the desired accuracy. This result effectively breaks the curse of dimensionality for a wide class of singular physical problems, offering a robust alternative to traditional adaptive mesh methods.
1. Introduction
In scientific computing, functions with point singularities—where values or derivatives blow up at specific locations—are ubiquitous. A classic example is the $1/|x|$ potential of an electron near a nucleus. Standard numerical methods, such as the Finite Element Method (FEM), struggle with these features; achieving high accuracy typically requires an impractically large number of grid points clustered near the singularity.
While specialized techniques like $hp$-FEM (which utilize variable mesh sizes and polynomial degrees) can achieve exponential convergence, they are notoriously difficult to implement in three dimensions. This paper explores Quantized Tensor Decompositions as a solution. These methods reshape a standard 3D grid into a high-dimensional "virtual" space of bits. This study investigates whether the complexity (tensor rank) of these representations remains manageable as accuracy requirements increase for singular functions.
2. Methodology
The authors analyze three specific quantized tensor formats:
- Quantized Tensor Train (QTT): The standard approach where the 3D grid is reshaped into a long chain of bit-level dimensions.
- Transposed QTT (QT3): A variation that interleaves the bits of the $x, y,$ and $z$ coordinates to better capture local spatial correlations.
- Tucker QTT (TQTT): A hybrid approach using Tucker decomposition to compress physical dimensions, combined with QTT for the resulting factors.
The "Bridge" Proof
To establish rank bounds, the authors utilize a novel intermediate step. They first prove that $hp$-FEM approximations converge exponentially for "Gevrey-regular" functions—a class including analytic functions but allowing for more general derivative growth. They then demonstrate that these $hp$-FEM functions can be exactly represented as low-rank tensors. By linking these two domains, they prove that the tensor approximation of the original singular function must also possess low ranks.
3. Experimental Setup
As a theoretical numerical analysis, the study utilizes mathematical model problems for validation:
- Synthetic Singular Functions: Functions defined as $u(x) = |x|^\alpha m(x)$, where $\alpha$ determines the singularity strength at the origin.
- The Hydrogen Atom: A benchmark eigenvalue problem for the Schrödinger equation featuring a singular Coulomb potential ($V = -1/|x|$).
- Implementation: Numerical experiments were conducted using the
ttpyPython library.
4. Key Insights and Results
Polylogarithmic Rank Growth
The primary theoretical contribution is the proof that the tensor rank $r$ required to achieve accuracy $\epsilon$ satisfies $r \le C |\log \epsilon|^\kappa$. This polylogarithmic scaling is the hallmark of exponential convergence. In 3D experiments, such as the hydrogen atom model, observed ranks were even lower than the theoretical upper bounds.
Format Efficiency and Adaptation
- Automatic Adaptation: Unlike $hp$-FEM, which requires manual geometric mesh design, quantized tensor algorithms (like SVD-based rounding) automatically discover the low-rank structure of the singularity.
- Interleaving Benefits: The QT3 format provides superior theoretical scaling for certain singularities by grouping bits from different spatial dimensions.
- TQTT Performance: The Tucker-QTT hybrid was found to be the most efficient format, requiring the fewest parameters to reach prescribed accuracy levels.
5. Conclusion and Future Work
While this work rigorously addresses point singularities, several avenues for future research remain. The current proof does not yet formally cover line or face singularities (e.g., the edges of a cube), which are common in engineering applications. Additionally, while the paper provides upper bounds on ranks, it is not yet known if these bounds are tight.
Future work will focus on applying these bounds to more complex many-body interaction problems in quantum chemistry and addressing the ill-conditioning that arises in extremely refined grids through specialized derivative-free tensor algorithms.
Summary updated