%0 Journal Article %1 356494 %A Sherman, Andrew H %C New York, NY, USA %D 1978 %I ACM %J ACM Trans. Math. Softw. %K large math matrix scale svd %N 4 %P 330--338 %T Algorithms for sparse Gaussian elimination with partial pivoting %U http://portal.acm.org/citation.cfm?id=356494 %V 4 %X Algorithms for sparse Gaussian elimination with partial pivoting
ÄCM HeBIS: Universitaetsbibliothek Kassel
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ÄCM
Please provide us with feedback. Feedback
Algorithms for sparse Gaussian elimination with partial pivoting
Full text PdfPdf (564 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 4 ,  Issue 4  (December 1978) table of contents
Pages: 330 - 338  
Year of Publication: 1978
ISSN:0098-3500
Author
Andrew H Sherman  Department of Computer Sciences, Painter 328, The University of Texas at Austin, Austin, TX
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 58,   Citation Count: 2
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/356502.356494
What is a DOI?

REFERENCES
 
1
Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
 
2
CURTIS, A.R., AND REID, J.K. FORTRAN subroutines for the solution of sparse sets of hnear equations. AERE Rep. R6844, AERE HarweU, England, 1971.
 
3
CURTIS, A.R, AND REID, J.K The solution of large sparse unsymmetnc systems of hnear equations. Information Processing '71 (1971), 1240-1245.
 
4
DUFF, I.S., AND REID, J.K A comparison of sparsity ordermgs for obtaining a pivotal sequence in Gausslan elm~matlon. AERE Rep. T.P. 526, AERE Harwell, England, 1973
5
Stanley C. Eisenstat , Andrew H. Sherman, Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting (abstract), ACM SIGNUM Newsletter, v.10 n.4, p.26-29, December 1975  doi>10.1145/1053205.1053217
 
6
FORSYTHE, G.E., AND MOLER, C B Computer Solutton of Linear Algebraic Systems Prentice- Hall, Englewood Cliffs, N J, 1967
 
7
Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998

CITED BY  2
Andrew H. Sherman, Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting F4, ACM Transactions on Mathematical Software (TOMS), v.4 n.4, p.391-398, December 1978
Jing Li , Tao Jiang, Efficient rule-based haplotyping algorithms for pedigree data, Proceedings of the seventh annual international conference on Research in computational molecular biology, p.197-206, April 10-14, 2003, Berlin, Germany

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.3 Numerical Linear Algebra
          Subjects: Sparse, structured, and very large systems (direct and iterative methods)

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.3 Numerical Linear Algebra
          Subjects: Linear systems (direct and iterative methods)


General Terms:
Algorithms


Keywords:
analysis of algorithms, linear equations, pivoting algorithms, sparse Gaussian elimination, sparse linear systems

Collaborative Colleagues:
Andrew H Sherman: colleagues

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

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player