2021
DOI: 10.1016/j.jcp.2021.110672
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(9 citation statements)
references
References 65 publications
0
9
0
Order By: Relevance
“…Another open question in low-rank methods is conserving the intrinsic properties of the underlying problem such as conservation of particles or the appropriate asymtotic limits. As in our previous work [15], the high-order/loworder (HOLO) algorithm is one way to perform the fix. The implementation is straightforward since we can also calculate the Eddington tensor with the lowrank S N solution.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Another open question in low-rank methods is conserving the intrinsic properties of the underlying problem such as conservation of particles or the appropriate asymtotic limits. As in our previous work [15], the high-order/loworder (HOLO) algorithm is one way to perform the fix. The implementation is straightforward since we can also calculate the Eddington tensor with the lowrank S N solution.…”
Section: Discussionmentioning
confidence: 99%
“…In previous work, the authors applied the DLR method to transport calculations with a spherical harmonics expansion and an explicit time scheme [14]. Later, a high-order/low-order algorithm was developed in [15] to overcome the conservation loss in the low-rank evolution.…”
Section: Introductionmentioning
confidence: 99%
“…Such an approach has been shown to be effective for both kinetic equations that appear in plasma physics (such as the Vlasov-Poisson [19,28] or Vlasov-Maxwell [22] equations) and in a number of transport problems (e.g. radiation transport problems [49,12,48,37] or the Boltzmann-BGK equation [16,24,8]). In all of these cases ξ 1 contains the spatial variables and ξ 2 contains all the velocity variables.…”
Section: Dynamical Low-rank Algorithmmentioning
confidence: 99%
“…While such methods can be applied in a rather generic way to ordinary or partial differential equation, an efficient algorithm is only obtained if a suitable decomposition of variables is chosen that allows us to run the simulation with a small to moderate rank. For kinetic problems primarily a decomposition between spatial and velocity variables has been performed (see [16,22,23,49,48,12,8,38]; some work on tensor decomposition also exists [36,19,1,28]). It turns out that for kinetic problems this has a number of advantages.…”
Section: Introductionmentioning
confidence: 99%
“…To leverage the opportunity presented by the inherent structure of the equation in the diffusive regime and address the challenge especially of high dimensionality, projection based ROMs and tensor decomposition based low rank algorithms have been designed for the stationary and time-dependent RTE. Along the line of low rank algorithms based on tensor decomposition, dynamical low rank algorithm (DLRA) [35,14,34]and the proper generalized decomposition (PGD) [1,37,13] have been designed. Projection based ROMs have also been actively developed in the recent few years, for example the proper orthogonal decomposition (POD) and its variations [5,11,12,40,3,10,19], the dynamical mode decomposition (DMD) [26,27].…”
Section: Introductionmentioning
confidence: 99%