ACM Home Page
Please provide us with feedback. Feedback
Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems
Full text PdfPdf (619 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 8 ,  Issue 3  (September 1982) table of contents
Pages: 277 - 289  
Year of Publication: 1982
ISSN:0098-3500
Authors
Tateaki Sasaki  The Institute of Physical and Chemical Research, Wako-shi, Saitama 351, Japan
Hirokazu Murao  Department of Information Science, Faculty of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 80,   Citation Count: 5
Additional Information:

references   cited by   index terms   collaborative colleagues  

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/356004.356007
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
BAREISS, E.H. Sylvester's identity and multlstep integer-preserving Gaussian elimination. Math. Comput 22 (1968) 565-578.
2
3
 
4
HEARN, A.C. REDUCE 2 User's Manual. University of Utah, Salt Lake City, 1973.
5
6
 
7
SANO, M The new method for obtaining the upper triangular matrix with the parameter element (in Japanese). Bull Inst. Elec Eng. Japan Alll (1981), 359-366.
 
8
SMIT, J The efficient calculation of symbolic determinants In Proc. 1976ACM Syrup. Symbolw and Algebraic Computation (Yorktown Heights, N Y., August 10-12, 1976), ACM, New York, pp. 105-113.
9


Collaborative Colleagues:
Tateaki Sasaki: colleagues
Hirokazu Murao: colleagues