Two iteration processes for computing positive definite solutions of the equation \(X-A^*X^{-n}A=Q\) (Q5948734): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Hermitian solutions of the equation \(X=Q+NX^{-1}N^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative solution of two matrix equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of a positive definite solution of the matrix equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of a positive definite solution of the matrix equation \(X+A^ T X^{-1} A=I\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the matrix equation \(X+A^ TX^{-1}A=I\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of positive definite solutions of the equation \(X+A^*X^{-2}A=I\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an Iteration Method for Solving a Class of Nonlinear Matrix Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-sided iterative method for computing positive definite solutions of a nonlinear matrix equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank

Revision as of 20:16, 3 June 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
    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

    Identifiers