Two iteration processes for computing positive definite solutions of the equation \(X-A^*X^{-n}A=Q\) (Q5948734): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0898-1221(00)00301-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092962117 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article; zbMATH DE number 1671958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two iteration processes for computing positive definite solutions of the equation \(X-A^*X^{-n}A=Q\) |
scientific article; zbMATH DE number 1671958 |
Statements
Two iteration processes for computing positive definite solutions of the equation \(X-A^*X^{-n}A=Q\) (English)
0 references
12 November 2001
0 references
This paper deals with positive definite solutions of the nonlinear matrix equation \(X- A^* X^{-n}A= Q\). Sufficient conditions for existence of the solutions are obtained. Two iterative methods are proposed. These iterations are fixed-point iterative methods. The first one is suitable for obtaining a positive definite solution when \(A\) is a normal matrix. The second one is suitable to general matrix \(A\) but \(Q= 1\) and \(n= 2^m\). Numerical examples are given illustrate the performance of the algorithm.
0 references
numerical examples
0 references
positive definite solutions
0 references
nonlinear matrix equation
0 references
fixed-point iterative methods
0 references
performance
0 references
algorithm
0 references
0 references
0 references
