REVIEW
Large-Scale Algebraic Riccati Equations with High-Rank Nonlinear Terms and Constant Terms
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
Large-Scale Algebraic Riccati Equations with High-Rank Nonlinear Terms and Constant Terms
read the original abstract
For large-scale discrete-time algebraic Riccati equations (DAREs) with high-rank nonlinear and constant terms, the stabilizing solutions are no longer numerically low-rank, resulting in the obstacle in the computation and storage. However, in some proper control problems such as power systems, the potential structure of the state matrix -- banded-plus-low-rank, might make the large-scale computation essentially workable. In this paper, a factorized structure-preserving doubling algorithm (FSDA) is developed under the frame of the banded inverse of nonlinear and constant terms. The detailed iterations format, as well as a deflation process of FSDA, are analyzed in detail. A partial truncation and compression technique is introduced to shrink the dimension of columns of low-rank factors as much as possible. The computation of residual, together with the termination condition of the structured version, is also redesigned.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.