“…Available iteration algorithms are the Newton's method [4-6, 10, 16, 20], the fixed-point iteration method [1,2,8,14,15] and the structure-preserving doubling algorithm [3,7,9,11,17,19].…”
A large scale nonsymmetric algebraic Riccati equation XCX−XE−AX+ B = 0 arising in transport theory is considered, 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 structurepreserving doubling algorithm, which can reduce the flop count of original SDA ls by half. Numerical experiments illustrate the effectiveness of our method.
“…Available iteration algorithms are the Newton's method [4-6, 10, 16, 20], the fixed-point iteration method [1,2,8,14,15] and the structure-preserving doubling algorithm [3,7,9,11,17,19].…”
A large scale nonsymmetric algebraic Riccati equation XCX−XE−AX+ B = 0 arising in transport theory is considered, 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 structurepreserving doubling algorithm, which can reduce the flop count of original SDA ls by half. Numerical experiments illustrate the effectiveness of our method.
“…In recent years, efficient numerical algorithms for finding the minimal positive solution of Equation have been extensively studied (e.g., see previous studies). On the other hand, these algorithms rely on floating point arithmetic, so that rounding errors are included in the obtained result.…”
Section: Introductionmentioning
confidence: 99%
“…Here • is the Hadamard product, T = (T ij ) = (1∕( i + d j )), and u and v satisfy the vector equations In recent years, efficient numerical algorithms for finding the minimal positive solution of Equation 1 have been extensively studied (e.g., see previous studies 2,[4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19] ). On the other hand, these algorithms rely on floating point arithmetic, so that rounding errors are included in the obtained result.…”
Summary
A fast algorithm for enclosing the solution of the nonsymmetric algebraic Riccati equation arising in transport theory is proposed. The equation has a special structure, which is taken into account to reduce the complexity. By exploiting the structure, the enclosing process involves only quadratic complexity under a reasonable assumption. The algorithm moreover verifies the uniqueness and minimal positiveness of the enclosed solution. Numerical results show the efficiency of the algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.