1@string{TOMS = "{ACM} Trans. Math. Softw."} 2@string{SIMAX = "{SIAM} J. Matrix Anal. Applic."} 3@string{SIAMJSC = "{SIAM} J. Sci. Comput."} 4@string{SIAMJSSC = "{SIAM} J. Sci. Statist. Comput."} 5 6@article{AmestoyDavisDuff96, 7 author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.}, 8 title={An approximate minimum degree ordering algorithm}, 9 journal=SIMAX, 10 year={1996} 11 ,volume={17} 12 ,number={4} 13 ,pages={886-905} 14 } 15 16@article{AmestoyDavisDuff03, 17 author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.}, 18 title={Algorithm 837: {AMD}, an approximate minimum degree ordering algorithm}, 19 journal=TOMS, 20 year={2004} 21 ,volume={30} 22 ,number={3} 23 ,pages={381-388}} 24 25@article{Davis05, 26 author={Davis, T. A}, 27 title={Algorithm 849: a concise sparse Cholesky factorization package}, 28 journal=TOMS, 29 year={2005}, 30 volume={31}, 31 number={4}, 32 pages={587--591} 33 } 34 35@article{GeorgeLiu79, 36 author={George, A. and Liu, J. W. H.}, 37 month={Jun.}, 38 year={1979}, 39 title={The Design of a User Interface for a Sparse Matrix Package}, 40 journal=TOMS, 41 annote={f}, 42 volume={5}, 43 number={2}, 44 pages={139-162}, 45 keywords={software user interface SPARSPAK}} 46 47@book{GeorgeLiu, 48 author={George, A. and Liu, J. W. H.}, 49 year={1981}, 50 title={Computer Solution of Large Sparse Positive Definite Systems}, 51 address={Englewood Cliffs, New Jersey}, 52 publisher={Prentice-Hall}, 53 keywords={ positive definite systems}, 54 annote={sh} 55 } 56 57@article{GilbertMolerSchreiber, 58 author={Gilbert, J. R. and Moler, C. and Schreiber, R.}, 59 title={Sparse matrices in {MATLAB}: design and implementation}, 60 journal=SIMAX, 61 year={1992} 62 ,volume={13} 63 ,number={1} 64 ,pages={333-356} 65 ,annote={f} 66 } 67 68@article{GilbertNgPeyton94, 69 author={Gilbert, J. R. and Ng, E. G. and Peyton, B. W.}, 70 title={An efficient algorithm to compute row and column counts for sparse {C}holesky factorization}, 71 journal=SIMAX, 72 year={1994} 73 ,volume={15} 74 ,number={4} 75 ,pages={1075-1091} 76 ,annote={f} 77 } 78 79@article{GilbertPeierls88, 80 author={Gilbert, J. R. and Peierls, T.}, 81 year={1988}, 82 title={Sparse Partial Pivoting in Time Proportional to Arithmetic Operations}, 83 journal=SIAMJSSC, 84 annote={f}, 85 volume={9}, 86 pages={862-874}, 87 keywords={316 partial pivoting, graph algorithms}} 88 89@article{Liu86c, 90 author={Liu, J. W. H.}, 91 month={Jun.}, 92 year={1986}, 93 title={A Compact Row Storage Scheme for {C}holesky Factors Using Elimination Trees}, 94 journal=TOMS, 95 volume={12}, 96 number={2}, 97 pages={127-148}, 98 annote={f. previously Report CS-84-02, Dept. Computer Science, York University (1984)}} 99 100@article{Liu90a, 101 author={Liu, J. W. H.}, 102 title={The Role of Elimination Trees in Sparse Factorization}, 103 journal=SIMAX, 104 year={1990} 105 ,volume={11} 106 ,number={1} 107 ,pages={134-172} 108 ,annote={f} 109 } 110 111@article{Liu91, 112 author={Liu, J. W. H.}, 113 title={A generalized envelope method for sparse factorization by rows}, 114 journal=TOMS, 115 year={1991} 116 ,volume={17} 117 ,number={1} 118 ,pages={112-129} 119 ,annote={f} 120 } 121 122@article{NgPeyton93, 123 author={Ng, E. G. and Peyton, B. W.}, 124 title={A supernodal {Cholesky} factorization algorithm for shared-memory multiprocessors}, 125 journal=SIAMJSC, 126 year={1993} 127 ,volume={14} 128 ,pages={761-769} 129 ,annote={f} 130 } 131 132@article{RothbergGupta91, 133 author={Rothberg, E. and Gupta, A.}, 134 title={Efficient sparse matrix factorization on high-performance workstations - {E}xploiting the memory hierarchy}, 135 journal=TOMS, 136 year={1991} 137 ,volume={17} 138 ,number={3} 139 ,pages={313-334} 140 ,annote={f} 141 } 142 143@techreport{Stewart03, 144 author={Stewart, G. W.}, 145 title={Building an old-fashioned sparse solver}, 146 institution={Univ. Maryland (www.umd.cs.edu/$\sim$stewart)}, 147 year={2003} 148 ,annote={f} 149 } 150 151