Pith. sign in

REVIEW

A high-order / low-order (HOLO) algorithm for preserving conservation in time-dependent low-rank transport calculations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.06072 v1 pith:442S35V5 submitted 2020-11-11 physics.comp-ph

A high-order / low-order (HOLO) algorithm for preserving conservation in time-dependent low-rank transport calculations

classification physics.comp-ph
keywords high-orderlow-orderconservationsolutionalgorithmclosurehololow-rank
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Dynamical low-rank (DLR) approximation methods have previously been developed for time-dependent radiation transport problems. One crucial drawback of DLR is that it does not conserve important quantities of the calculation, which limits the applicability of the method. Here we address this conservation issue by solving a low-order equation with closure terms computed via a high-order solution calculated with DLR. We observe that the high-order solution well approximates the closure term, and the low-order solution can be used to correct the conservation bias in the DLR evolution. We also apply the linear discontinuous Galerkin method for the spatial discretization to obtain the asymptotic limit. We then demonstrate with the numerical results that this so-called high-order / low-order (HOLO) algorithm is conservative without sacrificing computational efficiency and accuracy.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.