The Matrix Sign Function Method and the Computation of Invariant Subspaces

The Matrix Sign Function Method and the Computation of Invariant Subspaces

Show other versions (1)

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-c...

Full description

Bibliographic Details
Main Authors: Byers, R., He, C., Mehrmann, V.
Other Authors: TU Chemnitz, SFB 393
Format: Others
Language:English
Published: Universitätsbibliothek Chemnitz 1998
Subjects:
matrix sign function
invariant subspaces
stability
Newton
iteration
numerical examples
MSC 65F30
MSC 65F15
ddc:510
Online Access:http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800619
http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800619
http://www.qucosa.de/fileadmin/data/qucosa/documents/4140/data/b025.pdf
http://www.qucosa.de/fileadmin/data/qucosa/documents/4140/data/b025.ps
http://www.qucosa.de/fileadmin/data/qucosa/documents/4140/19980061.txt

Internet

http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800619
http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800619
http://www.qucosa.de/fileadmin/data/qucosa/documents/4140/data/b025.pdf
http://www.qucosa.de/fileadmin/data/qucosa/documents/4140/data/b025.ps
http://www.qucosa.de/fileadmin/data/qucosa/documents/4140/19980061.txt

Similar Items