Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. Complexity of Sparse Elimination

Complexity of Sparse Elimination

File(s)
73-166.pdf (1.78 MB)
73-166.ps (797.06 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6012
Collections
Computer Science Technical Reports
Author
Bunch, James R.
Abstract

This paper surveys some of the recent research on the applications of the algebraic and combinatorial properties of Gaussian elimination on sparse matrices. Keywords: sparse matrix, Gaussian elimination, graph theory, computational complexity, triangulation, optimal ordering, optimum ordering, grid graph, band matrix.

Date Issued
1973-04
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-166
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance