Algorithms 41: Evaluation of determinant

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithms 41: Evaluation of determinant

Full text

Pdf (571 KB)

Source

Communications of the ACM archive
Volume 4 , Issue 4 (April 1961) table of contents

Page: 176

Year of Publication: 1961

ISSN:0001-0782

Author

Josef G. Solomon

RCA Digital Computation and Simulation Group, Moorestown, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 15, Citation Count: 1

Additional Information:

references cited by

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355578.366333 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.

J. H. WILKINSON, Theory and practice in linear systems. In John W. Cart III (editor), Application of Advanced Numerical Analysis to Digital Computers, pp. 43-100 (Lectures given at the University of Michigan, Summer 1958, College of Engineering, Engineering Summer Conferences, Ann Arbor, Michigan {1959}).

CITED BY

S. Y. Ku , R. J. Adler, Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm, Communications of the ACM, v.12 n.1, p.23-30, Jan. 1969

Adobe Acrobat

QuickTime

Windows Media Player

Real Player