A perturbation analysis shows that if a numerically stable
procedure is used to compute the matrix sign function, then it is competitive
with conventional methods for computing invariant subspaces.
Stability analysis of the Newton iteration improves an earlier result of Byers
and confirms that ill-conditioned iterates may cause numerical
instability. Numerical examples demonstrate the theoretical results.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:ch1-199800619 |
| Date | 30 October 1998 |
| Creators | Byers, R., He, C., Mehrmann, V. |
| Contributors | TU Chemnitz, SFB 393 |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | application/pdf, application/postscript, text/plain, application/zip |
Page generated in 0.0019 seconds