Abstract
Consider an iterative modification of the linearized Newton method for computing the minimal nonnegative solution of a a nonsymmetric Nash-Riccati equation. The equation has arisen in linear quadratic games for positive systems. The Newton procedure for computing the minimal nonnegative solution is well known in the the literature. Our proposal is effective one because it employs small number of matrix multiplication at each iteration step and there is a variant to exploit the block structure of matrix coefficients of the Nash-Riccati equation. Moreover, in this reason, it is easy to extend the proposed iterative modification depending on the number of players of a given game model. We provide a numerical example where compare the results from experiment with the proposed iteration an the linearized Newton method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Iraqi Journal for Computer Science and Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
