A tensor-train reduced basis solver for parameterized partial differential equations on Cartesian grids
Abstract
In this manuscript, we introduce the tensor-train reduced basis method, a novel projection-based reduced-order model designed for the efficient solution of parameterized partial differential equations. While reduced-order models are widely used for their computational efficiency compared to full-order models, they often involve significant offline computational costs. Our proposed approach mitigates this limitation by leveraging the tensor train format to efficiently represent high-dimensional finite element quantities. This method offers several advantages, including a reduced number of operations for constructing the reduced subspaces, a cost-effective hyper-reduction strategy for assembling the PDE residual and Jacobian, and a lower dimensionality of the projection subspaces for a given accuracy. We provide a posteriori error estimates to validate the accuracy of the method and evaluate its computational performance on benchmark problems, including the Poisson equation, heat equation, and transient linear elasticity in two- and three-dimensional domains. Although the current framework is restricted to problems defined on Cartesian grids, we anticipate that it can be extended to arbitrary shapes by integrating the tensor-train reduced basis method with unfitted finite element techniques.
Cite
@article{arxiv.2412.14460,
title = {A tensor-train reduced basis solver for parameterized partial differential equations on Cartesian grids},
author = {Nicholas Mueller and Yiran Zhao and Santiago Badia and Tiangang Cui},
journal= {arXiv preprint arXiv:2412.14460},
year = {2025}
}
Comments
23 pages, 3 figures, 8 tables