Pith. sign in

REVIEW 2 major objections 7 minor 1 cited by

Highly Efficient Rank-Adaptive Sweep-based SI-DSA for the Radiative Transfer Equation via Mild Space Augmentation

T0 review · 2 major / 7 minor · reviewed 2026-07-15 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A mild-augmentation rank-adaptive SI-DSA matches full-rank accuracy and outer iterations for the radiative transfer equation while cutting memory and runtime even when ranks hit 30–45% of full size.

desk verdict Solid methods paper: first rank-adaptive sweep SI-DSA for first-order RTE that stays faster than full-rank even at 30–45% ranks via mild (constant-p) augmentation. read the letter →

arxiv 2603.25233 v3 pith:LEO5NOXQ submitted 2026-03-26 math.NA cs.NA

Wei Guo , Zhichao Peng This is my paper · ORCID
classification math.NAcs.NA MSC 65M6065F1085A25
keywords radiativetransferequationsourceiterationdiffusionsyntheticaccelerationlow-rankapproximationrankadaptivitytransportsweepmildspaceaugmentationdiscreteordinates
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Discrete-ordinates solvers for the steady radiative transfer equation store and update an angular flux over a high-dimensional phase space, which becomes expensive. Low-rank approximations can cut that cost, but standard rank-adaptive schemes enlarge the basis by a multiple of the current rank before truncating; when the true rank is already tens of percent of full size, that overhead cancels the savings. This paper builds a source-iteration DSA solver that works directly on the first-order form and reuses ordinary transport sweeps. Inside each source-iteration step an inner loop adds only a fixed handful of angular snapshots chosen by residual-based greedy sampling, updates the spatial basis and projected operators incrementally, and truncates only once the inner loop has converged. Outer DSA acceleration is left unchanged. On homogeneous, lattice, variable-scattering and pin-cell problems the method recovers the same outer iteration counts and scalar-flux accuracy as full-rank SI-DSA, while the memory and runtime drop by factors of roughly two (or more than twelve in the pure-diffusion regime). The practical claim is that genuine speed-ups remain available even for multiscale media whose solution rank is no longer tiny.

What carries the argument

Mild space augmentation via residual-based greedy angular subsampling: each inner iteration solves transport sweeps for a fixed small number p of newly sampled angles, incrementally enlarges the spatial basis by those p vectors without truncation, and selects the next p angles from a random candidate pool by residual size; truncation occurs only after the inner residual and scalar-flux tests both pass.

What would settle it

A multiscale benchmark (e.g., the pin-cell or lattice problem) on which the low-rank outer residual stagnates or the scalar-flux error exceeds the full-rank SI-DSA error by more than an order of magnitude once the true rank exceeds roughly 40 percent of full size, while the same residual-greedy schedule and stopping tolerances are used.

Watch

Extended reading notes

Core claim

A rank-adaptive, sweep-based SI-DSA for the first-order steady RTE can be realized by mild (rank-independent) space augmentation inside an inner residual-driven loop; the resulting solver matches full-rank outer iteration counts and accuracy while still reducing memory and runtime when the effective rank reaches 30–45 percent of the full discrete rank.

Load-bearing premise

That sampling only a handful of residual-largest angles from a small random candidate set, together with the dual residual-plus-scalar-flux stopping test, is enough to adapt rank correctly without premature inner termination or outer-loop stagnation.

Editorial extensions

If this is right

  • Existing transport-sweep and DSA codes can be reused with only non-intrusive wrappers that supply angular snapshots and projected operators.
  • Memory and runtime savings remain available for practical multiscale media whose solution ranks are 30–45 percent of the full discrete rank.
  • The same mild-augmentation SI can be substituted into implicit time-stepping of time-dependent RTE without redesigning the angular sampler.
  • Aggressive O(r) basis enrichment is unnecessary for rank-adaptive first-order transport solvers.
  • Compression ratios of roughly 40 percent already yield roughly 2 imes wall-clock speed-ups under standard outer tolerances.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The residual-greedy sampler may transfer to other kinetic equations that already possess fast directional sweeps (e.g., linear Boltzmann or neutron transport).
  • If the candidate-pool size q can be reduced further without loss of outer convergence, the method becomes still cheaper for very high angular resolution.
  • Coupling the same mild-augmentation idea with quasi-diffusion or data-driven synthetic accelerators could push the high-rank regime beyond 45 percent while preserving speed-up.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 7 minor

Summary. The paper proposes a rank-adaptive sweep-based SI–DSA solver for the first-order steady-state RTE. Its core is an inner-loop low-rank source iteration that enriches the spatial basis by a small, rank-independent number p of angular snapshots per iteration (default p=1), selected by residual-based greedy random subsampling from q candidates, with a single SVD truncation only after the inner loop converges. Incremental MGS2-RO basis/operator updates and a dual residual/scalar-flux stopping test support non-intrusive reuse of existing transport sweeps; DSA is applied in the outer loop. Systematic 2D2V SN–DG experiments (homogeneous regimes, lattice, multiscale variable scattering, pin-cell) report outer iteration counts matching full-rank SI–DSA, scalar-flux differences O(10^{-7}–10^{-8}) below ε_SI-SA=10^{-6}, compression ratios ~8–45%, and speedups from ~1.5× up to >12×, including cases whose effective rank is 30–45% of full rank.

Significance. The work addresses a genuine practical bottleneck: rank-proportional space augmentation (e.g., 2r or 4r) can erase low-rank gains once the effective rank reaches tens of percent of the full rank, a regime that appears in standard multiscale RTE benchmarks. Delivering the first rank-adaptive sweep-based iterative solver for the first-order formulation, while preserving classical transport sweeps and DSA and requiring only mild augmentation, is a clear and useful contribution. Strengths include non-intrusive design, explicit ablations (MGS2 vs MGS vs full QR; p/q sweeps; multi-seed pin-cell robustness), and direct comparison to the same full-rank SI–DSA baseline on identical discretizations. If the empirical picture holds under broader use, the method is a practical path to genuine memory and runtime savings for moderately high-rank RTE problems where aggressive rank adaptation fails.

major comments (2)
  1. [Sec. 3.3, 3.5; Sec. 4 tables] Sec. 3.3 (eqs. 3.7–3.9) and Sec. 3.5: when the candidate residual test passes, the stopping procedure solves Galerkin systems for all remaining unsampled angles at cost O((N_Ω−q−r_k)r_k^3) before checking the scalar-flux difference. The text asserts this occurs only in the final few inner iterations, but Sec. 4 reports no counts of how often the full-angle projection is invoked, nor a wall-clock breakdown separating sweeps, incremental updates, candidate residuals, and full projections. In the motivating 30–45% rank regime this term is not a priori negligible; a short quantification (or timing table) is needed to substantiate that mild augmentation plus the dual stopping test still yields the claimed net speedups rather than shifting cost into the convergence monitor.
  2. [Sec. 3.2; Sec. 4.3–4.4] Sec. 3.2 and Remark 3.1: residual norms on a small random candidate set (default q=8, p=1) are treated as sufficiently informative for greedy enrichment. The p/q ablation (Tab. 4.3) and eight-seed pin-cell study (Tab. 4.4) support robustness on the reported tests, but the manuscript does not discuss or test a failure mode in which important angular structure is systematically under-sampled by the random candidates (e.g., highly anisotropic beams or very sparse angular features). A brief limitation statement and, if feasible, one more extreme angular configuration would make the weakest algorithmic assumption falsifiable rather than only empirically successful on the current suite.
minor comments (7)
  1. [Title / headers] Title page and running headers show spaced-out words (e.g., “HIGHL Y”, “RADIA TIVE”, “AUGMENT A TION”), likely PDF extraction artifacts; ensure the production PDF has clean titles and section headings.
  2. [Alg. 3.1] Alg. 3.1 line 3 uses “while k ≤ NIter” but the outer counter is n; align the loop variable with the surrounding text (n).
  3. [Fig. 4.2, Fig. 4.6 captions] Fig. 4.2 caption refers to “Sec. 4.3” for the lattice problem, which is Sec. 4.2; Fig. 4.6 caption similarly points to Sec. 4.3 for the pin-cell problem (Sec. 4.4). Correct cross-references.
  4. [Sec. 3.1–3.2] Notation: r_k is used both as the current spatial rank and, in places, as if it equals p k; state explicitly that r_k = r_0 + k p (or the actual recurrence) when reorthogonalization does not drop columns.
  5. [Sec. 4 intro] Default hyperparameters (p=1, q=8, ε_res=ε_diff=10^{-7}, ε_SVD=10^{-8}, ε_MGS) are stated in Sec. 4 but not collected in one place; a short “default parameters” paragraph or table would help reproducibility.
  6. [Sec. 3.6 / Sec. 4] The relation to concurrent collocation-based DLR [6] is discussed well in Sec. 3.6; a one-sentence clarification that no numerical head-to-head is attempted (different problem class / fixed vs adaptive rank) would prevent readers from expecting such a comparison in Sec. 4.
  7. [Appx. B] Appx. B: the definitions of D^±_x, D^±_y are dense; a brief remark that they are the standard upwind DG streaming matrices would help readers who skip the appendix.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: empirical numerical-methods paper whose claims are measured performance against independent full-rank SI-DSA baselines on identical discretizations.

full rationale

The paper proposes a concrete algorithmic construction (inner-loop residual-based greedy angular subsampling with mild p-augmentation, incremental MGS2 basis/operator updates, dual residual/scalar-flux stopping, outer DSA) and reports measured quantities: outer iteration counts matching full-rank SI-DSA, accuracy differences O(10^{-7}–10^{-8}), compression ratios, and wall-clock speedups on standard multiscale benchmarks (lattice, variable scattering, pin-cell). These are not forced by definition or by a fitted parameter renamed as a prediction; hyperparameters (p,q,ε) are stated and ablated, but the central claim is comparative efficiency, not a tautological forecast. Self-citations to the authors’ prior low-rank RTE work supply background and contrast (fixed-rank or aggressive-augmentation baselines) and are not load-bearing uniqueness theorems that close the argument. The derivation chain is therefore self-contained against external full-rank reference solutions; no step reduces by construction to its own inputs.

Assumptions & free parameters 5 free parameters · 4 assumptions · 2 invented entities

The central performance claim rests on standard SN-DG and SI-DSA theory plus several hand-chosen algorithmic hyperparameters that control sampling and truncation. No new physical entities are postulated; invented pieces are algorithmic constructs (mild augmentation loop, residual-greedy sampler, MGS2-RO incremental update). Domain assumptions (isotropic scattering, rectangular Cartesian mesh, fully consistent DSA) bound the tested regime.

free parameters (5)
  • p (angles added per inner iteration) = 1 (default)
    Default p=1 (tested 1–3); controls mildness of augmentation and oversampling ratio; chosen by hand, not derived.
  • q (candidate angles for greedy selection) = 8 (default)
    Default q=8 (tested 4–16); trades sampling quality vs cost; hand-chosen.
  • ε_res and ε_diff (inner-loop residual and scalar-flux tolerances) = 1e-7
    Default 10^{-7}; gate when full angular projection and outer-compatible stopping occur; hand-set relative to outer ε_SI-SA=10^{-6}.
  • ε_SVD (truncation tolerance after inner convergence) = 1e-8
    Default 10^{-8}; determines reported solution rank after SVD of C^{(n)}; hand-chosen.
  • ε_MGS (reorthogonalization trigger)
    Threshold on loss of orthogonality that triggers full QR in Alg. 3.2; implementation detail affecting cost.
assumptions (4)
  • domain assumption SN upwind DG discretization of first-order RTE is well-posed and asymptotic-preserving for piecewise linear or higher polynomials.
    Invoked in Sec. 2.1 citing [24,25]; underpins matrix form (2.6) and diffusion-limit consistency of DSA.
  • domain assumption Fully consistent DSA accelerates SI and yields outer convergence comparable to classical SI-DSA when the SI step is only approximately solved in low rank.
    Outer loop reuses classical DSA (2.8)–(2.9); empirical same iteration counts support it, but no proof that low-rank SI residual preserves DSA theory.
  • standard math Transport sweeps invert (D_j+Σ_t) matrix-free via upwind block triangular structure on Cartesian meshes.
    Sec. 2.2; standard discrete-ordinates fact enabling non-intrusive reuse of sweeps.
  • ad hoc to paper Residual norms on a small random candidate set of angles are informative enough to select the next p enrichment directions.
    Core of Sec. 3.2 greedy random subsampling; justified empirically, not by a sampling theorem.
invented entities (2)
  • Mild space-augmentation inner-loop low-rank SI
    purpose: Adapt rank by adding fixed p snapshots without intermediate truncation, truncating once after inner convergence.
    Algorithmic construct (Sec. 3.1); independent_evidence false as a named object, though performance is falsifiable via full-rank comparison.
  • Residual-based greedy random angular subsampling
    purpose: Select enrichment angles from q candidates by PDE residual of Galerkin-projected SI equations.
    Sec. 3.2; alternative to DEIM-on-all-angles; quality is empirical.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Highly Efficient Rank-Adaptive Sweep-based SI-DSA for the Radiative Transfer Equation via Mild Space Augmentation." pith.science (2026). https://pith.science/paper/LEO5NOXQ

@misc{pith2026260325233,
  author       = {Pith},
  title        = {Pith review of: Highly Efficient Rank-Adaptive Sweep-based SI-DSA for the Radiative Transfer Equation via Mild Space Augmentation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LEO5NOXQ}},
  note         = {Machine review of arXiv:2603.25233}
}
read the original abstract

Low-rank methods have emerged as a promising strategy for reducing the memory footprint and computational cost of discrete-ordinates discretizations of the radiative transfer equation (RTE). However, most existing rank-adaptive approaches rely on rank-proportional space augmentation, which can negate efficiency gains when the effective solution rank becomes moderately large. To overcome this limitation, we develop a rank-adaptive sweep-based source iteration with diffusion synthetic acceleration (SI-DSA) for the first-order steady-state RTE. The core of our method is a sweep-based low-rank SI with an inner-loop iteration that performs efficient rank adaptation via mild space augmentation. In each inner iteration, the spatial basis is augmented with a small, rank-independent number of basis vectors without truncation, while a single truncation is performed only after the inner loop converges. Efficient rank adaptation is achieved through residual-based greedy angular subsampling strategy together with incremental updates of projection operators, enabling non-intrusive reuse of existing transport-sweep implementations. In the outer iteration, a DSA preconditioner is applied to accelerate convergence. Numerical experiments show that the proposed solver achieves accuracy and iteration counts comparable to those of full-rank SI-DSA while substantially reducing memory usage and runtime, even for challenging multiscale problems in which the effective rank reaches 30-45% of the full rank.

Figures

Figures reproduced from arXiv: 2603.25233 by the authors.

Figure 4.1
Figure 4.1. Full-rank reference scalar flux for the homogeneous prob [PITH_FULL_IMAGE:figures/full_fig_p018_4_1.png] view at source ↗
Figure 4.2
Figure 4.2. Configuration of scattering cross section and scalar fluxe [PITH_FULL_IMAGE:figures/full_fig_p019_4_2.png] view at source ↗
Figure 4.3
Figure 4.3. Convergence history, effective rank and oversampling rat [PITH_FULL_IMAGE:figures/full_fig_p019_4_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4.4
Figure 4.4. Figure 4.4: Configuration of scattering cross section and scalar fluxe [PITH_FULL_IMAGE:figures/full_fig_p021_4_4.png]
Figure 4.5
Figure 4.5. Figure 4.5: Oversampling ratio during low-rank SI for the variable scatt [PITH_FULL_IMAGE:figures/full_fig_p022_4_5.png]
Figure 4.6
Figure 4.6. Figure 4.6: Configuration of scattering cross section and scalar fluxe [PITH_FULL_IMAGE:figures/full_fig_p023_4_6.png]
Figure 4.7
Figure 4.7. Figure 4.7: Convergence history, effective rank and oversampling rat [PITH_FULL_IMAGE:figures/full_fig_p023_4_7.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An Asymptotic-Preserving Dynamical Low-Rank Semi-Lagrangian Method for Multiscale Linear Kinetic Transport Equations

    math.NA 2026-07 conditional novelty 6.0 of 10

    An asymptotic-preserving dynamical low-rank semi-Lagrangian solver with QDEIM angular sampling cuts the cost of multiscale kinetic transport simulations while preserving the diffusion limit.

Reference graph

Works this paper leans on

36 extracted references · 5 linked inside Pith · cited by 1 Pith paper

  1. [1]

    O. Koch, C. Lubich, Dynamical low-rank approximation, S IAM Journal on Matrix Analysis and Applications 29 (2) (2007) 434–454

    2007

  2. [2]

    Dektor, A

    A. Dektor, A. Rodgers, D. Venturi, Rank-adaptive tensor methods for high-dimensional non- linear PDEs, Journal of Scientific Computing 88 (2) (2021) 36

    2021

  3. [3]

    Guo, J.-M

    W. Guo, J.-M. Qiu, A low rank tensor representation of lin ear transport and nonlinear Vlasov solutions and their associated flow maps, Journal of Computa tional Physics 458 (2022) 111089

    2022

  4. [4]

    Z. Peng, R. G. McClarren, M. Frank, A low-rank method for t wo-dimensional time-dependent radiation transport calculations, Journal of Computation al Physics 421 (2020) 109735

    2020

  5. [5]

    Z. Peng, R. G. McClarren, A sweep-based low-rank method f or the discrete ordinate transport equation, Journal of Computational Physics 473 (2023) 1117 48

    2023

  6. [6]

    T. Haut, J. Loffeld, L. Einkemmer, P. Guthrey, S. Brunner, W. Schill, Efficient SN-like and PN-like Dynamic Low Rank methods for Thermal Radiative Tran sfer, arXiv preprint arXiv:2601.18705 (2026)

    arXiv 2026

  7. [7]

    Einkemmer, J

    L. Einkemmer, J. Hu, Y. W ang, An asymptotic-preserving d ynamical low-rank method for the multi-scale multi-dimensional linear transport equation , Journal of Computational Physics 439 (2021) 110353

    2021

  8. [8]

    Einkemmer, J

    L. Einkemmer, J. Hu, J. Kusch, Asymptotic-preserving an d energy stable dynamical low-rank approximation, SIAM Journal on Numerical Analysis 62 (1) (2 024) 73–92

Show all 36 references
  1. [9]

    Frank, J

    M. Frank, J. Kusch, C. Patwardhan, Asymptotic-preservi ng and energy stable dynamical low- rank approximation for thermal radiative transfer equatio ns, Multiscale Modeling & Sim- ulation 23 (1) (2025) 278–312

    2025

  2. [10]

    W. A. Sands, W. Guo, J.-M. Qiu, T. Xiong, High-order adap tive rank integrators for multi- scale linear kinetic transport equations in the hierarchic al Tucker format, arXiv preprint arXiv:2406.19479 (2024)

    2024 arXiv

  3. [11]

    Z. Peng, R. G. McClarren, A high-order/low-order (HOLO ) algorithm for preserving conserva- tion in time-dependent low-rank transport calculations, J ournal of Computational Physics 447 (2021) 110672. 25

    2021

  4. [12]

    C. D. Hauck, S. Schnake, A predictor-corrector strateg y for adaptivity in dynamical low-rank approximations, SIAM Journal on Matrix Analysis and Applic ations 44 (3) (2023) 971– 1005

    2023

  5. [13]

    Z. Ding, L. Einkemmer, Q. Li, Dynamical low-rank integr ator for the linear Boltzmann equa- tion: error analysis in the diffusion limit, SIAM Journal on N umerical Analysis 59 (4) (2021) 2254–2285

    2021

  6. [14]

    P. Yin, E. Endeve, C. Hauck, S. Schnake, Towards dynamic al low-rank approximation for neutrino kinetic equations. Part I: Analysis of an idealize d relaxation model, Mathematics of Computation 94 (353) (2025) 1199–1233

    2025

  7. [15]

    Bachmayr, R

    M. Bachmayr, R. Bardin, M. Schlottbom, Low-rank tensor product Richardson iteration for radiative transfer in plane-parallel geometry, arXiv prep rint arXiv:2403.14229 (2024)

    2024 arXiv

  8. [16]

    W. Guo, Z. Peng, An Inexact Low-Rank Source Iteration fo r Steady-State Radiative Transfer Equation with Diffusion Synthetic Acceleration, arXiv prep rint arXiv:2509.00805 (2025)

    2025 arXiv

  9. [17]

    Einkemmer, K

    L. Einkemmer, K. Kormann, J. Kusch, R. G. McClarren, J.- M. Qiu, A review of low-rank methods for time-dependent kinetic simulations, Journal o f Computational Physics (2025) 114191

    2025

  10. [18]

    Bachmayr, Low-rank tensor methods for partial differ ential equations, Acta Numerica 32 (2023) 1–121

    M. Bachmayr, Low-rank tensor methods for partial differ ential equations, Acta Numerica 32 (2023) 1–121

    2023

  11. [19]

    M. L. Adams, E. W. Larsen, Fast iterative methods for dis crete-ordinates particle transport calculations, Progress in Nuclear Energy 40 (2002) 3–159

    2002

  12. [20]

    Bachmayr, R

    M. Bachmayr, R. Schneider, Iterative methods based on s oft thresholding of hierarchical tensors, Foundations of Computational Mathematics 17 (4) (2017) 103 7–1083

    2017

  13. [21]

    Ceruti, J

    G. Ceruti, J. Kusch, C. Lubich, A rank-adaptive robust i ntegrator for dynamical low-rank approximation, BIT Numerical Mathematics 62 (4) (2022) 114 9–1174

    2022

  14. [22]

    E. W. Larsen, J. E. Morel, Advances in discrete-ordinat es methodology, Nuclear computational science: A century in review (2009) 1–84

    2009

  15. [23]

    G. C. Pomraning, The equations of radiation hydrodynam ics, Courier Corporation, 2005

    2005

  16. [24]

    M. L. Adams, Discontinuous finite element transport sol utions in thick diffusive problems, Nuclear science and engineering 137 (3) (2001) 298–333

    2001

  17. [25]

    Guermond, G

    J.-L. Guermond, G. Kanschat, Asymptotic analysis of up wind discontinuous Galerkin approxi- mation of the radiative transport equation in the diffusive l imit, SIAM Journal on Numer- ical Analysis 48 (1) (2010) 53–78

    2010

  18. [26]

    Palii, M

    O. Palii, M. Schlottbom, On a convergent DSA preconditi oned source iteration for a DGFEM method for radiative transfer, Computers & Mathematics wit h Applications 79 (12) (2020) 3366–3377

    2020

  19. [27]

    Peng, Reduced order model enhanced source iteration with synthetic acceleration for para- metric radiative transfer equation, Journal of Computatio nal Physics 517 (2024) 113303

    Z. Peng, Reduced order model enhanced source iteration with synthetic acceleration for para- metric radiative transfer equation, Journal of Computatio nal Physics 517 (2024) 113303

    2024

  20. [28]

    Dektor, L

    A. Dektor, L. Einkemmer, Interpolatory dynamical low- rank approximation for the 3+ 3d Boltzmann–BGK equation, Journal of Computational Physics (2025) 114515

    2025

  21. [29]

    D. C. Sorensen, M. Embree, A deim induced cur factorizat ion, SIAM Journal on Scientific Computing 38 (3) (2016) A1454–A1482

    2016

  22. [30]

    Appelo, Y

    D. Appelo, Y. Cheng, lrAA: Low-Rank Anderson Accelerat ion, arXiv preprint arXiv:2503.03909 (2025)

    2025 arXiv

  23. [31]

    J. W. Daniel, W. B. Gragg, L. Kaufman, G. W. Stewart, Reor thogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , Mathematics of Computation 30 (136) (1976) 772–795

    1976

  24. [32]

    J. Hu, Y. W ang, An adaptive dynamical low rank method for the nonlinear Boltzmann equation, Journal of Scientific Computing 92 (2) (2022) 75

    2022

  25. [33]

    Brunner, L

    S. Brunner, L. Einkemmer, T. Haut, Domain decompositio n dynamical low-rank for multi- dimensional radiative transfer equations, arXiv preprint arXiv:2602.14854 (2026)

    2026

  26. [34]

    Olivier, W

    S. Olivier, W. Pazner, T. S. Haut, B. C. Yee, A family of in dependent Variable Eddington Factor methods with efficient preconditioned iterative solv ers, Journal of Computational Physics 473 (2023) 111747

    2023

  27. [35]

    R. G. McClarren, T. S. Haut, Data-driven acceleration o f thermal radiation transfer calculations with the dynamic mode decomposition and a sequential singul ar value decomposition, Journal of Computational Physics 448 (2022) 110756

    2022

  28. [36]

    N. Tang, Z. Peng, Synthetic Acceleration Precondition ers for Parametric Radiative Trans- fer Equations based on Trajectory-Aware Reduced Order Mode ls, arXiv preprint arXiv:2509.05001 (2025). 26

    2025 arXiv

Pith tools

Reviewed July 15, 2026 · model on record in the stance chip above.