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)
A matrix LSQR iterative method to solve matrix equation $AXB=C$. (English) Zbl 1195.65056
Summary: This paper is a matrix iterative method presented to compute the solutions of the matrix equation, $AXB=C$, with unknown matrix $X\in \cal S$, where $\cal S$ is the constrained matrices set like symmetric, symmetric-$R$-symmetric and $(R, S)$-symmetric. By this iterative method, for any initial matrix $X_{0}\in S$, a solution $X^*$ can be obtained within finite iteration steps if exact arithmetics were used, and the solution $X^*$ with the minimum Frobenius norm can be obtained by choosing a special kind of initial matrix. The solution $\hat X$, which is nearest to a given matrix $\tilde X$ in Frobenius norm, can be obtained by first finding the minimum Frobenius norm solution of a new compatible matrix equation. The numerical examples given here show that the iterative method proposed in this paper has faster convergence and higher accuracy than the iterative methods proposed in earlier papers.

65F30Other matrix algorithms
65F10Iterative methods for linear systems
Full Text: DOI