A Sweep-Based Low-Rank Method for the Discrete Ordinate Transport Equation

  title={A Sweep-Based Low-Rank Method for the Discrete Ordinate Transport Equation},
  author={Zhuogang Peng and Ryan G. McClarren},
  journal={SSRN Electronic Journal},
The dynamical low-rank (DLR) approximation is an efficient technique to approximate the solution to matrix differential equations. Recently, the DLR method was applied to radiation transport calculations to reduce memory requirements and computational costs. This work extends the low-rank scheme for the time-dependent radiation transport equation in 2-D and 3-D Cartesian geometries with discrete ordinates discretization in angle (SN method). The reduced system that evolves on a low-rank manifold… 

A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations

A predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems is presented and applied to several versions of DLRA methods found in the literature, as well as a new variant.



A low-rank method for two-dimensional time-dependent radiation transport calculations

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

Dynamical Low-Rank Integrator for the Linear Boltzmann Equation: Error Analysis in the Diffusion Limit

This work investigates the error analysis for a dynamical low-rank algorithm applied to the multi-scale linear Boltzmann equation (a classical model in kinetic theory) to showcase the validity of the application of dynamical high-rank algorithms to kinetic theory.

A Quasilinear Implicit Riemann Solver for the Time-Dependent Pn Equations

An implicit Riemann solver for the one- and two-dimensional time-dependent spherical harmonics approximation to the linear transport equation is presented, which produces smaller errors in less time than both a first-order scheme and a method that solves the full nonlinear system using a Newton-Krylov method.

A projector-splitting integrator for dynamical low-rank approximation

This work proposes and analyze a fully explicit, computationally inexpensive integrator that is based on splitting the orthogonal projector onto the tangent space of the low-rank manifold and enjoys robustness properties that are not shared by any standard numerical integrator.

An unconventional robust integrator for dynamical low-rank approximation

A numerical integrator that computes a low-rank approximation to large time-dependent matrices that are either given explicitly via their increments or are the unknown solution to a matrix differential equation is proposed and analysed.

Discretized Dynamical Low-Rank Approximation in the Presence of Small Singular Values

An error analysis is provided which provides an error analysis which unifies the properties of the Lie--Trotter and Strang projector-splitting methods when given time-dependent matrices or tensors which are already of the prescribed rank.

Dynamical Low-Rank Approximation

It is shown that the increment-based computational approach gives locally quasi-optimal low-rank approximations that are well suited for numerical integration.