Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
General Matrix Pencil Techniques for Solving Discrete-Time Nonsymmetric Algebraic Riccati Equations
SIAM Journal on Matrix Analysis and Applications
Alternating-directional Doubling Algorithm for $M$-Matrix Algebraic Riccati Equations
SIAM Journal on Matrix Analysis and Applications
On the numerical solution of a structured nonsymmetric algebraic Riccati equation
Performance Evaluation
Monotone convergence of Newton-like methods for M-matrix algebraic Riccati equations
Numerical Algorithms
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We consider the iterative solution of a class of nonsymmetric algebraic Riccati equations, which includes a class of algebraic Riccati equations arising in transport theory. For any equation in this class, Newton's method and a class of basic fixed-point iterations can be used to find its minimal positive solution whenever it has a positive solution. The properties of these iterative methods are studied and some practical issues are addressed. An algorithm is then proposed to find the minimal positive solution efficiently. Numerical results are also given.