Modifikasi Baris Dari Matriks Sparse Faktorisasi Cholesky
DAFTAR PUSTAKA
Bennett, J.M. 1965. Triangular factors of modified matrices., 7 : 217–221.
Davis, T.A., dan Hager, W. W. 1999 . Modifying a sparse Cholesky factorization.
SIAM J. Matrix Anal. Appl., 20 : 606–627.
Davis, T.A., dan Hager, W. W. 2001. Multiple-rank modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl., 22 : 997–1013.
Davis, T.A., dan Hager, W. W. 2003. Modifying a sparse Cholesky factorization.
SIAM J. Matrix Anal. Appl., 22 : 997–1013.
Duff, S., dan Reid, J. K. 1986. Direct Method for Sparse Matrices. Clarendon Press.
Oxford.
George, A. dan Liu, J. W. H. 1980. An optimal algorithm for symbolic factorization
of symmetric matrices. SIAM J. Computing. 9 : 583–593.
GillP.E., Golub. G. H., Murray W dan Saunders M. A 1974. Methods for modifying
matrix factorizations. Math. Comp., 28,pp 505-535.
Gilbert J.R dan Peierls T. 1988. Sparse partial pivoting in time proportional to
arithmetic operations, SIAM J. Sci.Statist. Comput., 9 pp. 862-874.
Golub, G. H., dan Loan C. F. V. 1989. Matrix Computations. The John Hopkins
University Press. Maryland.
Grondelle, J. V., 1999. Symbolic Sparse Cholesky Factorization Using Elimination
Trees. Utrecht.
Hager, W. W. 1988. Applied Linear Algebra. Prentice Hall, Inc, Englewood Cliff.
New Jersey.
Hager, W. W. 1989. Updating the inverse of a matrix. SIAM Review. 31 : 221–239
Rice, John, R., 1981. Matrix Computations and Mathematical Software. McGrawHill Book Company. New York.
Schreiber, R., 1982. A new implementation of sparse Gaussian elimination. ACM
Trans. Math. Software. 8 : 256-276.
Wilson, R., 1988 , An introduction to dynamic data structure. McGraw-Hill. London.
27
Bennett, J.M. 1965. Triangular factors of modified matrices., 7 : 217–221.
Davis, T.A., dan Hager, W. W. 1999 . Modifying a sparse Cholesky factorization.
SIAM J. Matrix Anal. Appl., 20 : 606–627.
Davis, T.A., dan Hager, W. W. 2001. Multiple-rank modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl., 22 : 997–1013.
Davis, T.A., dan Hager, W. W. 2003. Modifying a sparse Cholesky factorization.
SIAM J. Matrix Anal. Appl., 22 : 997–1013.
Duff, S., dan Reid, J. K. 1986. Direct Method for Sparse Matrices. Clarendon Press.
Oxford.
George, A. dan Liu, J. W. H. 1980. An optimal algorithm for symbolic factorization
of symmetric matrices. SIAM J. Computing. 9 : 583–593.
GillP.E., Golub. G. H., Murray W dan Saunders M. A 1974. Methods for modifying
matrix factorizations. Math. Comp., 28,pp 505-535.
Gilbert J.R dan Peierls T. 1988. Sparse partial pivoting in time proportional to
arithmetic operations, SIAM J. Sci.Statist. Comput., 9 pp. 862-874.
Golub, G. H., dan Loan C. F. V. 1989. Matrix Computations. The John Hopkins
University Press. Maryland.
Grondelle, J. V., 1999. Symbolic Sparse Cholesky Factorization Using Elimination
Trees. Utrecht.
Hager, W. W. 1988. Applied Linear Algebra. Prentice Hall, Inc, Englewood Cliff.
New Jersey.
Hager, W. W. 1989. Updating the inverse of a matrix. SIAM Review. 31 : 221–239
Rice, John, R., 1981. Matrix Computations and Mathematical Software. McGrawHill Book Company. New York.
Schreiber, R., 1982. A new implementation of sparse Gaussian elimination. ACM
Trans. Math. Software. 8 : 256-276.
Wilson, R., 1988 , An introduction to dynamic data structure. McGraw-Hill. London.
27