ACM Home Page
Please provide us with feedback. Feedback
Some Complexity Results for Matrix Computations on Parallel Processors
Full text PdfPdf (292 KB)
Source Journal of the ACM (JACM) archive
Volume 25 ,  Issue 1  (January 1978) table of contents
Pages: 112 - 115  
Year of Publication: 1978
ISSN:0004-5411
Author
W. Morven Gentleman  University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 38,   Citation Count: 19
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322047.322057
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
CSANKY, L Fast parallel matrix reversion algorithms Conf. Rec 16th Annual IEEE Symp. on Foundations of Comptr Scl, 1975, pp 11-12
 
3
KtrcK, D J, AND SAMEH, A H Parallel computations of elgenvalues of real matrices Information Processing 71, North-Holland Pub Co , Amsterdam, 1972, pp 1266-1272.
 
4
MIRANKER, W L A survey of parallehsm in numerical analysis SIAM Rev 13, 4 (Oct 1971), 524- 547
5
 
6
POOLE, W G Jl~, AND VOIGT, R G B~bhography 35 Numerical algorithms for parallel and vector computers An annotated blbhography Comptng Rev 15, 10 (Oct 1974), 379-388
7
 
8
STONE, H S Parallel processing with the perfect shuffle IEEE Trans on Comptrs. C-20, 2 (Feb 1971), 153-161
 
9
STgASSEN, V Gausslan ehmlnatlon is not optimal Num Math 13, 4 (1969), 354-356.
10

CITED BY  19
 
 
 
 
 
 

Collaborative Colleagues:
W. Morven Gentleman: colleagues

Peer to Peer - Readers of this Article have also read: