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)
On Smith-type iterative algorithms for the Stein matrix equation. (English) Zbl 1179.15016
Summary: This note studies the iterative solution to the Stein matrix equation. Firstly, it is shown that the recently developed Smith$\left(l\right)$ iteration converges to the exact solution for arbitrary initial condition whereas a special initial condition is required in the literature. Secondly, by presenting a new accelerative Smith iteration named the $r$-Smith iteration that includes the well-known ordinary Smith accelerative iteration as a special case, we have shown that the $r$-Smith accelerative iteration requires less computation than the Smith iteration and the Smith$\left(l\right)$ iteration, and the ordinary Smith accelerative iteration requires the least computations comparing with other Smith-type iterations.
MSC:
 15A24 Matrix equations and identities
mctoolbox