LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Bo Kågström Umea˚ Univ., Umea˚, Sweden
Peter Poromaa Umea˚ Univ., Umea˚, Sweden
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 22 Issue 1, March 1996
Pages 78-103
ACM New York, NY, USA
table of contents doi>10.1145/225545.225552
LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 17
· Downloads (cumulative): 529
· Citation Count: 10


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder