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)
Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations. (English) Zbl 1174.65382
Summary: The consistency conditions and the general expressions about the Hermitian solutions of the linear matrix equations AXB=C and (AX,XB)=(C,D) are studied, where A, B, C, and D are given matrices of suitable sizes. The Hermitian minimum F-norm solutions are obtained for these matrix equations using the Moore-Penrose generalized inverses, respectively. For both matrix equations, we design iterative methods according to the fundamental idea of the classical conjugate direction method for a standard system of linear equations. Numerical results show that these iterative methods are feasible and effective in actual computations of the solutions of the above-mentioned matrix equations.

MSC:
65F30Other matrix algorithms
65F20Overdetermined systems, pseudoinverses (numerical linear algebra)
15A24Matrix equations and identities