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)
Backward error, sensitivity, and refinement of computed solutions of algebraic Riccati equations. (English) Zbl 0829.65042

A new backward error criterion, together with a sensitivity measure, is presented for assessing solution accuracy of algebraic Riccati equations of the form AX+XB-XFX+G=0. The usual approach is to employ standard perturbation and sensitivity results for linear systems and to extend them for Riccati equations. The approach considered here is to take account of the underlying structure of these matrix equations. The backward error of an approximation to the solution is computed, and conventional perturbation theory is used to define structured condition numbers for these matrix equations. Backward error and condition numbers provide accurate estimates for the sensitivity of solutions. Optimal perturbations are used in an intuitive iterative procedure to refine approximations of actual solutions.

The results are derived for symmetric and non-symmetric algebraic Riccati equations and make it possible to establish similar results for Sylvester equations, Lyapunov equations and linear systems.

MSC:
65F30Other matrix algorithms
15A24Matrix equations and identities
65F35Matrix norms, conditioning, scaling (numerical linear algebra)