A modified large-scale structure-preserving doubling algorithm for a large-scale Riccati equation from transport theory

TL;DR

This paper introduces a modified large-scale structure-preserving doubling algorithm tailored for a specific large-scale Riccati equation from transport theory, effectively reducing computational complexity and demonstrating improved efficiency through numerical experiments.

Contribution

A novel modification of the structure-preserving doubling algorithm that halves the computational operations for large-scale Riccati equations in transport theory.

Findings

Reduced flop operations by half compared to original SDA",

,

,

Abstract

We consider the large scale nonsymmetric algebraic Riccati equation arising in transport theory, where the $n\times n$ coefficient matrices $B, C$ are symmetric and low-ranked and $A, E$ are rank one updates of nonsingular diagonal matrices. By introducing a balancing strategy and setting appropriate initial matrices carefully, we can simplify the large-scale structure-preserving doubling algorithm (SDA\_ls) for this special equation. We give modified large-scale structure-preserving doubling algorithm, which can reduce the flop operations of original SDA\_ls by half. Numerical experiments illustrate the effectiveness of our method.