A modified large-scale structure-preserving doubling algorithm for a large-scale Riccati equation from transport theory
Abstract
We consider the large scale nonsymmetric algebraic Riccati equation arising in transport theory, where the n× 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.