Cross Interpolation for Solving High-Dimensional Dynamical Systems on Low-Rank Tucker and Tensor Train Manifolds

Behzad Ghahremani; Hessam Babaee

Home/Archive/arXiv

arXiv · 2403.12826

Cross Interpolation for Solving High-Dimensional Dynamical Systems on Low-Rank Tucker and Tensor Train Manifolds

Behzad Ghahremani·Hessam Babaee

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a novel tensor interpolation algorithm for the time integration of nonlinear tensor differential equations (TDEs) on the tensor train and Tucker tensor low-rank manifolds, which are the building blocks of many tensor network decompositions. This paper builds upon our previous work (Donello et al., Proceedings of the Royal Society A, Vol. 479, 2023) on solving nonlinear matrix differential equations on low-rank matrix manifolds using CUR decompositions. The methodology we present offers multiple advantages: (i) It delivers near-optimal computational savings both in terms of memory and floating-point operations by leveraging cross algorithms based on the discrete empirical interpolation method to strategically sample sparse entries of the time-discrete TDEs to advance the solution in low-rank form. (ii) Numerical demonstrations show that the time integration is robust in the presence of small singular values. (iii) High-order explicit Runge-Kutta time integration schemes are developed. (iv) The algorithm is easy to implement, as it requires the evaluation of the full-order model at strategically selected entries and does not use tangent space projections, whose efficient implementation is intrusive. We demonstrate the efficiency of the presented algorithm for several test cases, including a nonlinear 100-dimensional TDE for the evolution of a tensor of size $70^{100} \approx 3.2 \times 10^{184}$ and a stochastic advection-diffusion-reaction equation with a tensor of size $4.7 \times 10^9$.

Explore related subjects

math.NA cs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Behzad Ghahremani, Hessam Babaee. 2024-06-11. Cross Interpolation for Solving High-Dimensional Dynamical Systems on Low-Rank Tucker and Tensor Train Manifolds. https://arxiv.org/abs/2403.12826

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Spectral deferred corrections parallelized across the method for differential-algebraic equations

In this work, the performance of different spectral deferred corrections (SDC) methods applied to initial value problems for differential-algebraic equations (DAEs) of index one is analyzed. The SDC method solves a series of correction equations, and after each iteration, the numerical solution is corrected by adding the obtained approximation of the error. The formulation of the SDC method allows for a parallelization across the method to obtain small-scale parallelism, for which a number of processes equal to the number of collocation nodes can be used. Recently, an analytical approach to finding optimal diagonal coefficients for parallel SDC was proposed. So far, no analysis with the new coefficients for parallel SDC applied to DAEs was done. We demonstrate that parallel SDC methods solve DAE problems with high accuracy faster than the associated sequential SDC schemes, obtaining speedup in a small-scale parallel regime.

math.NA↗

arXiv2026

Deep Truncated FBSDE Method for High-Dimensional Nonlinear PDEs and Fully Coupled FBSDEs

In this paper, we introduce a deep truncated forward-backward stochastic differential equation (FBSDE) method for high-dimensional partial differential equations (PDEs) and fully coupled FBSDEs. The proposed method combines gradient-truncated iterative decoupling with fictitious-play averaging to separate the forward and backward processes in a coupled framework. This preserves the coupled dynamics while reducing the unstable feedback induced by parameter-dependent forward paths during optimization. Furthermore, we incorporate a pathwise consistency term to create explicit local gradient shortcuts, thereby providing a structural mechanism that may mitigate gradient vanishing. We also derive a residual-based error estimate and establish conditional convergence of the fully discrete numerical approximations under suitable conditions, in which the pathwise consistency loss is not required. Our approach is particularly effective for convection-dominated equations, where the coupled formulation provides a stable representation of nonlinear transport without introducing singular terms into the BSDE. Numerical experiments demonstrate improved accuracy and stability in both low- and high-dimensional problems and robust performance for strongly coupled problems.

math.NA↗

arXiv2026

Sum of Squares and Non Sum of Squares Regimes for the Toeplitz Bottcher Wenzel Form

Toeplitz matrices are among the simplest structured models of translation invariance, arising naturally in convolution, stationary covariance models, and discretizations of translation-invariant operators. For a pair of real matrices, the Böttcher--Wenzel form (BW form) is a nonnegative quartic measuring the gap in the corresponding commutator inequality. László conjectured that, when both matrices are Toeplitz, this quartic is a sum of squares for every matrix order. We show that the conjecture is false. More precisely, we identify an explicit family of corner-supported Toeplitz pairs, retaining only the outermost diagonals on the two sides, for which the associated BW form is not a sum of squares at all sufficiently large orders. The proof reduces the complete family of Gram representations to a finite complex test: its Gram-invariant part develops a strictly negative limiting direction, while the remaining Gram-dependent contribution vanishes. We also give an explicit sufficient threshold for the matrix order. The negative result is complemented by two positive regimes. If either Toeplitz factor is symmetric or skew-symmetric, then the corresponding BW form is SoS for every order, with the other factor allowed to be an arbitrary real Toeplitz matrix. For unrestricted Toeplitz pairs, we further prove SoS representability for every $2\le N\le50$, with formal Lean~4 verification through order 20. The large-order non-SoS theorem, including the explicit sufficient threshold, has also been formally verified in Lean 4.

math.NA↗