AI & ML
Synthetic Acceleration Preconditioners for Parametric Radiative Transfer Equations based on Trajectory-Aware Reduced-Order Models
arXiv cs.NA0 views
arXiv:2509.05001v2 Announce Type: replace Abstract: The parametric radiative transfer equation (RTE) arises in multi-query applications, such as design optimization, inverse problems, and uncertainty quantification, which require solving the RTE multiple times for various parameters. Classical synthetic acceleration (SA) preconditioners are typically derived from low-order approximations of the kinetic correction equation, such as the diffusion approximation in diffusion synthetic acceleration (DSA). Despite their widespread success, these methods rely on empirical physical assumptions and do not exploit low-rank structures across parameters of the parametric problem. To address this limitation, our previous work developed ROMSAD, a reduced-order model (ROM) enhanced SA preconditioner that incorporates low-rank structures across parameters and the original kinetic description of the correction equation. While ROMSAD improves overall efficiency compared with DSA, its efficiency decreases after the first iteration because the construction of the underlying ROM ignores the preconditioner-dependence of the residual trajectory, leading to a mismatch between the offline and online residual trajectories. To address this offline-online mismatch, we adapt multispace reduced basis preconditioning to parametric RTEs, developing a trajectory-aware ROM framework. Specifically, we sequentially construct iteration-dependent reduced bases to account for the dependence of residual trajectories on the ROM-based preconditioners applied in preceding iterations. We also formulate SA-based kinetic corrections tailored to matrix-free transport sweeps in RTE solvers to achieve efficient online solves. Numerical experiments demonstrate superior efficiency over DSA and ROMSAD. For a parametric lattice problem, the proposed preconditioners lead to convergence within only average 3.4 transport sweeps online.
Source:https://arxiv.org/abs/2509.05001PreviousfOGA: An Orthogonal Greedy Algorithm for Fractional Laplacian ProblemsNextThe extended horizontal linear complementarity problem: iterative methods and error analysis
Related posts
The draft is not the send
0dev.to Discuss

My First GitHub Issue & My First Forem (DEV.to) Issue 🚀
0dev.to Discuss
Multimodel AI for Business: How to Build a Reliable Video Content Workflow
0dev.to Productivity
Your Thanksgiving flight home is on the busiest travel day of the year
0dev.to Productivity
Audit Week: When Your AI Assistant Knows Your Website Better Than You
0dev.to Productivity

Telegram เตรียม Dictator: AI Agent บน Mac ที่รายงานว่ารันบน Hermes Agent
0dev.to Machine Learning