Kaixiang Zhong. A sparse matrix package using the standard template library. Master's thesis, University of Notre Dame, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999) (2 citations) (Correct)
....in higher level languages such as C or C , performance concerns (which are often paramount in scientific computing) have continued to restrict implementations of sparse matrix ordering algorithms to Fortran. Efforts to develop sparse matrix orderings with modern programming techniques include [2] and [3] These were based on an object oriented, rather than generic, programming paradigm and although they were well programmed, the reported performance was still a factor of 4 5 slower than Fortran 77 implementations. This work was supported by NSF grants ASC94 22380 and CCR95 02710. 2 ....
Kaixiang Zhong. A sparse matrix package using the standard template library. Master's thesis, University of Notre Dame, 1996.
Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999) (2 citations) (Correct)
No context found.
Kaixiang Zhong. A sparse matrix package using the standard template library. Master's thesis, University of Notre Dame, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC