SIGN IN
SIGN UP
The generalized Schur decomposition of an arbitrary pencil A–&lgr;B—robust software with error bounds and applications. Part II: software and applications
Full Text:
PDF
Buy this Article
Authors:
James Demmel
Univ. of California, Berkeley
Bo Kågström
Univ. of Umeaˆ, Umeaˆ, Sweden
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 19 Issue 2, June 1993
Pages 175-201
ACM
New York, NY
, USA
table of contents
doi>
10.1145/152613.152616
1993 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 57
· Downloads (cumulative): 698
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithm design and analysis
algorithms
conditioning
controllable subspace
eigenvalues and eigenvectors
generalized eigenvalues
ill-posed problem
kronecker canonical form
matrix pencils
reducing subspaces
reliability
schur decomposition
theory
uncontrollable modes
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder