On the iterative solution of a class of nonsymmetric algebraic Riccati equations (Q2706263)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the iterative solution of a class of nonsymmetric algebraic Riccati equations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the iterative solution of a class of nonsymmetric algebraic Riccati equations |
scientific article |
Statements
19 March 2001
0 references
nonsymmetric algebraic Riccati equations
0 references
M-matrices
0 references
Newton's method
0 references
fixed-point iterations
0 references
iterative solution
0 references
algorithm
0 references
transport theory
0 references
minimal positive solution
0 references
On the iterative solution of a class of nonsymmetric algebraic Riccati equations (English)
0 references
The authors present an new algorithm for iterative solution of a class of nonsymmetric algebraic Riccati equations. This class includes a class of algebraic Riccati equations arising in transport theory. Using the special structure of the corresponding coefficient matrix and the theory of the M-matrices, the authors show that Newton's method and a class of basic fixed-point iterations can be used in order to find the minimal positive solution whenever such a solution exists. Moreover, the authors present an overall algorithm for the solution of nonsymmetric algebraic Riccati equations which is a combination of Newton's method and the basic fixed-point iteration. This algorithm has two nice features: (i) it can detect that an equation actually does not have a positive solution; (ii) it can detect and solve a singular or nearly singular problem efficiently.
0 references