Metraipolis › archive › dc_372f7282dc2f
A Tensor-Network Chebyshev--Galerkin Method for Boundary-Value Problems in Computational Mechanics — arXiv:2611.06552
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06552
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:28:05.069Z
- SHA-256 of the archived text
af761efda2a0d3398b19eb7f1ad54cfc92c9ed133253a10ee0c06d8199fd2308- Stable URL of this page
https://metraipolis.com/documento/dc_372f7282dc2f
How to cite
A Tensor-Network Chebyshev--Galerkin Method for Boundary-Value Problems in Computational Mechanics — arXiv:2611.06552 — arXiv (en), https://arxiv.org/abs/2611.06552 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_372f7282dc2f (Metraipolis archive dc_372f7282dc2f, sha256 af761efda2a0d3398b19eb7f1ad54cfc92c9ed133253a10ee0c06d8199fd2308)
BibTeX
@misc{dc372f7282dc2f,
title = {A Tensor-Network Chebyshev--Galerkin Method for Boundary-Value Problems in Computational Mechanics — arXiv:2611.06552},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06552},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_372f7282dc2f; sha256 af761efda2a0d3398b19eb7f1ad54cfc92c9ed133253a10ee0c06d8199fd2308},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06552. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum-inspired numerical methods for partial differential equations represent discretized fields and operators as quantics tensor trains (QTT), so that their cost depends on how compressible the problem is rather than on the number of unknowns. Global spectral formulations in this setting have so far relied on Fourier bases, restricted to periodic problems, or on collocation, which does not preserve the variational structure exploited by tensor-network solvers. We introduce a QTT Chebyshev--Galerkin method that assembles and solves global spectral systems directly in compressed form, without forming the underlying arrays. Starting from the weak formulation, the method handles coupled elliptic systems with variable coefficients, smoothly mapped geometries, and mixed Dirichlet--Robin boundary conditions, and yields symmetric positive-definite systems suited to variational tensor-network solvers. Parameters and random inputs enter as additional coordinates, so the same construction returns the solution over an entire parameter space in a single solve. In linear elasticity, the method retains spectral convergence and reaches errors below $10^{-8}$ on a three-dimensional benchmark, beyond those attained by QTT finite differences and Q2/Q4 FEniCSx finite elements over the tested range. A six-parameter cantilever design study covering $1.7\times10^{7}$ designs is solved in a single 92~s run, and a stochastic problem with ten random coordinates is represented with $2.4\times10^{6}$ times less memory than its full coefficient array.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.06552 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:18:18.994Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).