Blame | Last modification | View Log | Download | RSS feed
@string{SIMAX = "{SIAM} J. Matrix Anal. Applic."}@string{TOMS = "{ACM} Trans. Math. Softw."}@string{SIAMJSC = "{SIAM} J. Sci. Comput."}@article{DavisHager99,author={Davis, T. A. and Hager, W. W.},title={Modifying a sparse {C}holesky factorization},journal=SIMAX,year={1999},volume={20},number={3},pages={606--627}}@article{DavisHager01,author={Davis, T. A. and Hager, W. W.},title={Multiple-Rank Modifications of a Sparse {C}holesky Factorization},journal=SIMAX,year={2001},volume={22},number={4},pages={997--1013}}@article{DavisHager05,author={Davis, T. A. and Hager, W. W.},title={Row modifications of a sparse {Cholesky} factorization},journal=SIMAX,year={2005},volume={26},number={3},pages={621--639}}@article{AmestoyDavisDuff96,author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.},title={An approximate minimum degree ordering algorithm},journal=SIMAX,year={1996},volume={17},number={4},pages={886--905}}@article{Davis05,author={Davis, T. A.},title={Algorithm 8xx: A concise sparse {Cholesky} algorithm},journal=TOMS,year={to appear}}@article{DavisGilbertLarimoreNg00,author={Davis, T. A. and Gilbert, J. R. and Larimore, S. I. and Ng, E. G.},title={A column approximate minimum degree ordering algorithm},journal=TOMS,year={2004},volume={30},number={3},pages={353--376}}@article{DavisGilbertLarimoreNg00_algo,author={Davis, T. A. and Gilbert, J. R. and Larimore, S. I. and Ng, E. G.},title={Algorithm 836: {COLAMD}, a column approximate minimum degree ordering algorithm},journal=TOMS,year={2004},volume={30},number={3},pages={377--380}}@article{NgPeyton91b,author={Ng, E. and Peyton, B.},title={Block sparse {C}holesky algorithms on advanced uniprocessor computers},journal=SIAMJSC,year={1993},volume={14},pages={1034--1056}}@article{Liu86c,author={Liu, J. W. H.},title={A Compact Row Storage Scheme for {C}holesky Factors Using Elimination Trees},journal=TOMS,year={1986},volume={12},number={2},pages={127--148},}@article{Liu90a,author={Liu, J. W. H.},title={The Role of Elimination Trees in Sparse Factorization},journal=SIMAX,year={1990},volume={11},number={1},pages={134--172}}@article{GilbertNgPeyton94,author={Gilbert, J. R. and Ng, E. G. and Peyton, B. W.},title={An efficient algorithm to compute row and column counts for sparse {C}holesky factorization},journal=SIMAX,year={1994},volume={15},number={4},pages={1075--1091}}@article{GilbertLiNgPeyton01,author={Gilbert, J. R. and Li, X. S. and Ng, E. G. and Peyton, B. W.},title={Computing row and column counts for sparse {QR} and {LU} factorization},journal={{BIT}},year={2001},volume={41},number={4},pages={693--710}}@book{LAPACK,author={Anderson, E. and Bai, Z. and Bischof, C. and Blackford, S. and Demmel, J. and Dongarra, J. and {Du Croz}, J. and Greenbaum, A. and Hammarling, S. and McKenny, A. and Sorensen, D.},title={{LAPACK} Users' Guide, 3rd ed.},publisher={{SIAM}},year={1999}}@article{ACM679a,author={Dongarra, J. J. and {Du Croz}, J. and Duff, I. S. and Hammarling, S.},title={A set of level-3 basic linear algebra subprograms},journal=TOMS,year={1990},volume={16},number={1},pages={1--17}}@article{KarypisKumar98,author={Karypis, G. and Kumar, V.},title={A fast and high quality multilevel scheme for partitioning irregular graphs},journal=SIAMJSC,year=1998,volume={20},number={1},pages={359--392}}@article{GilbertMolerSchreiber,author={Gilbert, J. R. and Moler, C. and Schreiber, R.},title={Sparse matrices in {MATLAB}: design and implementation},journal=SIMAX,year={1992},volume={13},number={1},pages={333--356}}@article{AmestoyDavisDuff03,author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.},title={Algorithm 837: {AMD}, an approximate minimum degree ordering algorithm},journal=TOMS,year={2004},volume={30},number={3},pages={381-388}}