Abstract
A fast iterative algorithm is proposed for numerically computing an interval matrix containing the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation associated with M-matrix. This algorithm involves only cubic complexity per iteration, and moreover verifies the uniqueness of the contained solution. Numerical results show properties of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have