SIGN IN
SIGN UP
An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
Full Text:
PDF
Buy this Article
Authors:
Wilfried N. Gansterer
University of Tennessee, Knoxville, TN
Robert C. Ward
University of Tennessee, Knoxville, TN
Richard P. Muller
California Institute of Technology, Pasadena, CA
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 28 Issue 1, March 2002
Pages 45-58
ACM
New York, NY
, USA
table of contents
doi>
10.1145/513001.513004
2002 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 25
· Downloads (cumulative): 630
· Citation Count: 6
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
block-tridiagonal matrix
computations on matrices
divide-and-conquer method
eigenvalues and eigenvectors
performance
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