Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination

DOI10.48550/arXiv.2607.23814MaRDI QIDQ7284423arXivFDO

Authors Behzad Ghahremani, Hessam Babaee

Publication date 26 July 2026

Published in arXiv

Tldr We introduce an algorithm for implicit tensor-train cross integration of high-dimensional nonlinear PDEs by eliminating fiber dependencies via interpolation identities; this enables implicit methods for nonlinear equations with full-order spatial discretization and preserves the accuracy and efficiency of existing TT-cross methods.

Full work available at URL https://doi.org/10.48550/arXiv.2607.23814

arXiv classification

math.NA

Cites work

• A collocation method for nonlinear tensor differential equations on low-rank manifolds
• A CUR Krylov Solver for Large-Scale Linear Matrix Equations
• A new cross approximation for Tucker tensors and its application in Tucker-Anderson Acceleration
• A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
• A projector-splitting integrator for dynamical low-rank approximation
• A rank-adaptive robust integrator for dynamical low-rank approximation
• A robust second-order low-rank BUG integrator based on the midpoint rule
• A theory of pseudoskeleton approximations
• Adaptive sparse interpolation for accelerating nonlinear stochastic reduced-order modeling with time-dependent bases
• Alternating Least-Squares for Low-Rank Matrix Reconstruction
• Alternating Least-Squares for Low-Rank Matrix Reconstruction
• Computational Methods for Linear Matrix Equations
• Cross Algorithms for Cost-Effective Time Integration of Nonlinear Tensor Differential Equations on Low-Rank Tucker Tensor and Tensor Train Manifolds
• CUR matrix decompositions for improved data analysis
• Dynamical approximation by hierarchical Tucker and tensor-train tensors
• Dynamical Low‐Rank Approximation
• Interpolatory Dynamical Low-Rank Approximation: Theoretical Foundations and Algorithms
• Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
• Nonlinear model reduction via discrete empirical interpolation
• On local convergence of alternating schemes for optimization of convex problems in the tensor train format
• Preconditioning Low Rank Generalized Minimal Residual Method (GMRES) for Implicit Discretizations of Matrix Differential Equations
• Projected exponential methods for stiff dynamical low-rank approximation problems
• Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations
• Solution of the matrix equation \(AX-XB=C\)
• Stability of discrete empirical interpolation and gappy proper orthogonal decomposition with randomized and deterministic sampling points
• Sylvester-Preconditioned Adaptive-Rank Implicit Time Integrators for Advection-Diffusion Equations with Inhomogeneous Coefficients
• Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
• Tensor-train decomposition
• The alternating linear scheme for tensor optimization in the tensor train format
• TT-cross approximation for multidimensional arrays

Cited in

(1)

• A High-Order Rank-Adaptive Implicit Algorithm for Solving High Dimensional Diffusion Equations using the Hierarchical Tucker Decomposition

This page was built for publication: Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284423)