zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
On the positive definite solutions of the matrix equations X s ±A T X -t A=I n . (English) Zbl 1025.15018
The paper deals with the matrix equations X s +σA X -t A=I n , where σ=±1, s,t are positive integers, I n is the identity n×n matrix and X n×n is the solution. The case s=1 is well studied in the literature. Using the Brouwer fixed point principle the authors prove theorems for the existence of symmetric positive definite solutions. Condition numbers for the solutions of these equations are derived and other perturbation results are also obtained. Finally the authors consider the iterative schemes X k+1 =(I n -σA X k -t A) 1/s for computing the solutions.

15A24Matrix equations and identities
65F30Other matrix algorithms
65H10Systems of nonlinear equations (numerical methods)