Search arXiv⌕ Search

arXiv · 2610.27880

Proper generalized decomposition with synthetic preconditioning for multiscale parametric phonon transport

Abstract

Deterministic solution of the phonon Boltzmann transport equation is costly for two reasons: the distribution depends on high-dimensional phase space, and source iteration converges slowly when scattering is frequent. We address both for the steady linearized gray Callaway model in two dimensions by combining proper generalized decomposition (PGD) with the general synthetic iterative scheme (GSIS). The distribution is a sum of products of a space--azimuth factor and a polar factor. This splitting is intrinsically low-rank: along each characteristic the polar angle only stretches the in-plane optical depth, so the rank is bounded, uniformly in the Knudsen numbers, by the numerical rank of the kernel $\exp(-τ/\sinϕ)$. PGD--GSIS updates the factors against a macroscopic source frozen within each alternating step and refreshed by the GSIS moment equations. A Fourier analysis shows that pure PGD, although implicit in the polar factor, moves macroscopic information only through lagged spatial sweeps and stalls like source iteration, whereas the synthetic refresh sees only third-order moments of the representation error. On an isothermal cavity, cross-plane conduction and phonon Poiseuille flow, PGD--GSIS reproduces full-order solutions at ranks 3--14, with heat-flux errors below $6\times10^{-3}$ from the diffusive to the ballistic regime and memory independent of the polar resolution. Treating the inverse Knudsen numbers as coordinates of the polar factor yields one spatial basis over four decades of both; a joint update of all polar factors, which costs only small nodal linear systems, is required for accuracy at large Knudsen numbers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jia Liu, Wei Su. 2026-10-20. Proper generalized decomposition with synthetic preconditioning for multiscale parametric phonon transport. https://arxiv.org/abs/2610.27880

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

KEEP EXPLORING

Related papers

Matrix-free phase-field modeling of fracture in micromechanical testing simulations of inelastic materials

Resolving steep damage gradients across diffuse cracks in the phase-field modeling of fracture favors the use of high-order finite elements, for which matrix-free methods can provide superior performance and scalability. Here, we implement the Peric & Dettmer constitutive framework for visco-elastoplastic materials in an open source solid mechanics library supporting matrix-free operators for high-order finite elements with p-multigrid preconditioning on GPUs. We introduce a rheological fracture element assembled in series with the Peric & Dettmer block, keeping fracture and inelastic material properties mutually independent. We conduct numerical simulations of tensile and compressive quasistatic tests on synthetic particle-matrix microstructures using an El Capitan high-performance computing prototype. The results reproduce representative inelastic responses and fracture patterns, including X-shaped cracking observed in polymer-bonded explosives and cup-and-cone fracture in ductile metals.

physics.comp-ph↗

Tractable Inference with Kolmogorov-Arnold Networks

Machine-learning surrogates in computational science often require not only accurate predictions but also expectations, variances, conserved integrals, and normalization constants. Conventional neural networks, including Kolmogorov--Arnold networks (KANs), generally evaluate these quantities through Monte Carlo sampling or multidimensional quadrature, making repeated inference costly, particularly in high dimensions. We introduce KANs with Tractable Operators for Uncertainty and Constraints (TOUCKANs), whose finite-degree polynomial outer functions yield a decomposable sum--product representation. Under factorizing input measures, expectations and higher moments then reduce algebraically to deterministic recursions over one-dimensional leaf integrals. Independent and shared inner-block variants form a parameter-efficiency hierarchy, and a universal-approximation proof for its most restricted member extends to the complete class. The same deterministic operators allow conserved integrals and normalization to be imposed throughout training. Across uniform and Gaussian benchmarks through 50 dimensions, deterministic mean and variance errors remained below the median fixed-budget Monte Carlo errors in every case. TOUCKANs also conserved Cahn--Hilliard mass to machine precision and imposed normalization and orthogonality through deterministic moments, enabling joint computation of the lowest four Schrödinger eigenpairs in two, three, and five dimensions. TOUCKANs therefore connect KAN approximation with tractable probabilistic circuits, making statistical operators and integral constraints directly available within an expressive neural surrogate.

physics.comp-ph↗

DiffVortex: A quantum-inspired fast solver for incompressible flows

Matrix-product-state (MPS) and quantized tensor-train (QTT) representations offer a promising framework for computational fluid dynamics, with logarithmic run time and memory scaling in mesh size when bond dimensions remain bounded. Existing MPS-based solvers are Eulerian: they compress velocity fields and enforce immersed-body boundary conditions through static masks or body-fitted coordinates. Moving or flexible bodies complicate this approach: deformation requires updating MPS masks every time step, while filamentary vorticity in high-Reynolds-number flows may resist low-rank compression. We propose a complementary approach: compress the Biot--Savart kernel rather than the flow state, evolve vorticity using Lagrangian vortex particles, and represent immersed bodies by bound vortex sheets on Lagrangian surface points. Our main theoretical result is a lifting theorem: QTT rank $r$ of the kernel implies matrix-product-operator (MPO) rank at most $2^d r$ for the corresponding convolution operator in $d$ dimensions, independent of grid resolution. This bound is sharp for our interleaved ordering. With quantics tensor cross interpolation, the moment-to-local stage of a single-level fast multipole method becomes a precomputed tensor-network contraction with quasi-linear complexity, retaining Lagrangian flexibility for immersed bodies. Our PyTorch implementation (\texttt{DiffVortex}) is end-to-end differentiable, runs on GPUs, and handles $6.7\times10^{7}$ particles on a single device. We validate against reference vortex-method results for an impulsively started cylinder and exact and reference solutions for inviscid elliptical vortices. We also demonstrate two-dimensional flows past rigidly moving, multiple, and deforming bodies, including gradients propagated through the full time integration.

physics.comp-ph↗