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)
Weighted least squares solutions to general coupled Sylvester matrix equations. (English) Zbl 1161.65034

The paper is devoted to the weighted least squares solutions problem for general coupled Sylvester matrix equations. By adopting the gradient search principle in optimization theory, the authors provide a general gradient based iterative algorithm to solve this problem. The method used in the paper is quite different from the well known one. Especially, the authors introduce a necessary and sufficient condition to guarantee the convergence of the proposed algorithm. Based on this necessary and sufficient condition, a sufficient but wieldy condition can be induced. In deriving some of the results, they discover that a related result in the literature is in fact incorrect. Moreover, they suggest a method to choose the optimal step size in the algorithm, such that the proposed iteration converges fastest. They also provide several numerical examples to show the effectiveness of the proposed approach.

The paper is organized as follows. The problem formulation and some preliminary results are given in the beginning. The main results of the paper are shown next. Then, numerical examples are provided to illustrate the effectiveness of the proposed algorithm. Some concluding remarks are finally given.

The paper will be useful for all students, specialists and researchers, working in the area of weighted least squares solutions for coupled Sylvester matrix equations. It also is suitable for practitioners who wish to brush up these fundamental concepts.

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