| 期刊論文| 1. | Graham, R. L.(1969)。Bounds on multiprocessing timing anomalies。SIAM Journal on Applied Mathematics，17，416-429。   | | 2. | George, A.、Heath, M. T.、Liu, J.、Ng, E.(1988)。Sparse Cholesky factorization on a local-memory multiprocessor。SIAM Journal on Scientific and Statistical Computing，9(2)，327-340。 | | 3. | Gill, P. E.、Murray, W.、Saunders, M. A.、Tomlin, J. A.、Wright, M. H.(1986)。On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method。Mathematical Programming，36(2)，183-209。 | | 4. | Heath, M. T.、Romine, C. H.(1988)。Parallel solution of triangular systems on distributed-memory multiprocessors。SIAM Journal on Scientific and Statistical Computing，9(3)，558-588。 | | 5. | Ho, J. K.(1984)。Convergence behavior of decomposition algorithms for linear programming。Operations Research Letters，3，91-94。 | | 6. | Ho, J. K.、Lee, T. C.、Sundarraj, R. P.(1988)。Decomposition of linear programs using parallel computation。Mathematical Programming，42，391-405。 | | 7. | Ipsen, I. C. F.、Saad, Y.、Schultz, M. H.(1986)。Complexity of dense linear system solution on a multiprocessor ring。Linear Algebra Appl.，77，205-239。 | | 8. | Karmarkar, N.(1984)。A new polynoial-time algorithm for linear programming。Combinatorica，4(4)，373-395。 | | 9. | McShane, K. A.、Monma, C. L.、Shanno, D.(1989)。An implementation of a primal-dual interior point method for linear programming。ORSA Journal on Computing，1，70-83。 | | 10. | Medhi, D.(1990)。Parallel bundle-based decomposition for large-scale structured mathematical programming problems。Annals of Operations Research，22，101-127。 | | 11. | Rosen, J. B.、Maier, R. S.(1990)。Parallel solution of large-scale, block-angular linear programs。Annals of Operations Research，22，23-41。 | | 12. | Torabi, M.(1990)。Decomposed block Cholesky factorization in the Karmarkar algorithm: Solving a class of super large LP problems。Computers & Mathematics with Applications，20(2)，1-7。 | 研究報告| 1. | Adler, I.、Karmarkar, N.、Resende, M. G. C.、Veiga, G.(1987)。Data structures and programming techniques for the implementation of Karmarkar's algorithm。Berkeley, CA：Department of IEOR, University of California。 | | 2. | George, A.、Heath, M. T.、Liu, J.、Ng, E.(1988)。Solution of sparse positive definite systems on a hypercube。Oak Ridge, Tennessee：Oak Ridge National Laboratory。 | | 3. | Lustig, I. J.、Marsten, R. E.、Shanno, D. F.(1989)。The primal-dual interior point method on the Cray supercomputer。Atlanta, GA：School of IEOR, Georgia Tech。 | 圖書| 1. | Akl, S. G.(1989)。The Design and Analysis of Parallel Algorithms。Englewood Cliffs, NJ：Prentice-Hall。 | | 2. | Bertsekas, D. P.、Tsitsiklis, J. N.(1989)。Parallel and Distributed computation: Numerical Methods。Englewood Cliffs, NJ：Prentice-Hall。 | | 3. | George, A.、Liu, J. W.(1981)。Computer Solution of Large Sparse Positive Definite Systems。Englewood Cliffs, NJ：Prentice-Hall。 | | 4. | Hwang, K.、Degroot, D.(1989)。Parallel Processing for Supercomputers and Artificial Intelligence。New York：McGraw-Hill Publishing Company。 | | 5. | Golub, Gene H.、Van Loan, Charles F.(1989)。Matrix Computations。The Johns Hopkins University Press。 | 圖書論文| 1. | Geist, G. A.、Heath, M. T.(1986)。Matrix factorization on a hypercube multiprocessor。Hypercube Multiprocessors 1986。Philadelphia, PA：Society for Industrial and Applied Mathematics。 | | 2. | Tomlin, J. A.(1989)。A note on comparing simplex and interior methods for linear programming。Progress in Mathematical Programming。New York：Springer-Verlag。 | |