# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Properties of positive definite solutions of the equation $X+A^*X^{-2}A=I$. (English) Zbl 0935.65041
Summary: We discuss some properties of a positive definite solution of the matrix equation $X+ A^*X^{-2}A= I$. Two effective iterative methods for computing a positive definite solution of this equation are proposed. Necessary and sufficient conditions for the existence of a positive definite solution are derived. Numerical experiments are executed with these methods.

##### MSC:
 65F30 Other matrix algorithms 65F10 Iterative methods for linear systems 15A24 Matrix equations and identities
Full Text:
##### References:
 [1] Jr., W. N. Anderson; Morley, T. D.; Trapp, G. E.: Positive solution to X = A - bx-1 b\ast. Linear algebra appl. 134, 53-62 (1990) · Zbl 0702.15009 [2] Engwerda, J. C.; Andre, C. M. Ran; Rijkeboer, A. L.: Necessary and sufficient conditions for the existence of a positive definite solution of the matrix equation X + a\astx-1 A = Q. Linear algebra appl. 186, 255-275 (1993) · Zbl 0778.15008 [3] Engwerda, J. C.: On the existence of a positive definite solution of the matrix equation X + ATX-1 A = I. Linear algebra appl. 194, 91-108 (1993) · Zbl 0798.15013 [4] Buzbee, B. L.; Golub, G. H.; Nielson, C. W.: On direct methods for solving Poisson’s equations. SIAM J. Numer. anal. 7, 627-656 (1970) · Zbl 0217.52902 [5] Housholder, A. S.: The theory of matrices in numerical analysis. (1964) [6] Parodi, M.: La localisation des valeurs caracteristiques des matrices et ses applications. (1959) · Zbl 0087.01602 [7] Petkov, M.: On the matrix equations $A0Xm + a1xm-1 + \dots + am = 0, (A0{\lambda}m + a1{\lambda}$m-1 + … + am)x = 0. Ann. sofia university kl. Okhridski 72, 159-164 (1978) [8] Wilkinson, J. H.: The algebraic eigenvalue problem. (1965) · Zbl 0258.65037 [9] Petkov, M.: An iterative method for computing A. Numerical methods and applications’84 (1985) [10] El-Sayed, M. Salah: The study on special matrices and numerical methods for special matrix equations. Ph.d. thesis (1996) · Zbl 1034.65502 [11] Lancaster, P.: Theory of matrices. (1969) · Zbl 0186.05301 [12] El-Sayed, M. Salah: Theorems for the existence and computing of positive definite solutions for two nonlinear matrix equations. Proceedings of 25th spring conference of the union of bulgarian mathematicians (1996)