Parallel Direct Methods for Sparse Linear Systems
暂无分享,去创建一个
[1] John R. Gilbert,et al. Highly Parallel Sparse Cholesky Factorization , 1992, SIAM J. Sci. Comput..
[2] Michael T. Heath,et al. Distributed solution of sparse symmetric positive definite systems , 1993, Proceedings of Scalable Parallel Libraries Conference.
[3] A. George,et al. Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987 , 1986 .
[4] Cleve Ashcraft,et al. A Fan-In Algorithm for Distributed Sparse Numerical Factorization , 1990, SIAM J. Sci. Comput..
[5] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .
[6] Cleve Ashc Raft. The fan-both family of column-based distributed Cholesky factorization algorithms , 1993 .
[7] F. Gustavson,et al. Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine , 1984 .
[8] Iain S. Duff,et al. The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .
[9] P. Raghavan. Line and plane separators , 1993 .
[10] Michael T. Heath,et al. Sparse Cholesky factorization on a local-memory multiprocessor , 1988 .
[11] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .
[12] Alan George,et al. The Evolution of the Minimum Degree Ordering Algorithm , 1989, SIAM Rev..
[13] Vipin Kumar,et al. A Scalable Parallel Algorithm for Sparse Matrix Factorization , 1994 .
[14] Jack J. Dongarra,et al. Solving linear systems on vector and shared memory computers , 1990 .
[15] Anoop Gupta,et al. Parallel ICCG on a hierarchical memory multiprocessor - Addressing the triangular solve bottleneck , 1990, Parallel Comput..
[16] Iain S. Duff,et al. Concurrent Multifrontal Methods: Shared Memory, Cache, and Frontwidth Issues , 1987 .
[17] Yousef Saad,et al. Solving Sparse Triangular Linear Systems on Parallel Computers , 1989, Int. J. High Speed Comput..
[18] Jochen A. G. Jess,et al. A Data Structure for Parallel L/U Decomposition , 1982, IEEE Transactions on Computers.
[19] John R. Rice,et al. A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes , 1992, SIAM J. Sci. Comput..
[20] James Demmel,et al. Parallel numerical linear algebra , 1993, Acta Numerica.
[21] Barry W. Peyton,et al. Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers , 1987 .
[22] Roy D. Williams,et al. Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..
[23] Joel H. Saltz,et al. Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors , 1990, SIAM J. Sci. Comput..
[24] Robert F. Lucas,et al. A Parallel Solution Method for Large Sparse Systems of Equations , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[25] D. Rose,et al. Generalized nested dissection , 1977 .
[26] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .
[27] T. K. Hellen. A frontal solution program for finite element analysis , 1971 .
[28] Laurie A. Hulbert,et al. Limiting Communication in Parallel Sparse Cholesky Factorization , 1991, SIAM J. Sci. Comput..
[29] Joseph W. H. Liu,et al. The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..
[30] Fernando L. Alvarado,et al. Optimal Parallel Solution of Sparse Triangular Systems , 1993, SIAM J. Sci. Comput..
[31] Joseph W. H. Liu,et al. Computational models and task scheduling for parallel sparse Cholesky factorization , 1986, Parallel Comput..
[32] Gary L. Miller,et al. A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[33] Michael T. Heath,et al. Parallel Algorithms for Sparse Linear Systems , 1991, SIAM Rev..
[34] W H LiuJoseph. The multifrontal method for sparse matrix solution , 1992 .
[35] Michael T. Heath,et al. Performance of a Fully Parallel Sparse Solver , 1997, Int. J. High Perform. Comput. Appl..
[36] Edward Rothberg. Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers , 1996, SIAM J. Sci. Comput..
[37] Michael T. Heath,et al. Parallel solution of triangular systems on distributed-memory multiprocessors , 1988 .
[38] Yves Robert. The Impact of Vector and Parallel Architectures on the Gaussian Elimination Algorithm , 1991 .
[39] Vipin Kumar,et al. A high performance sparse Cholesky factorization algorithm for scalable parallel computers , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.
[40] W. Greub. Linear Algebra , 1981 .
[41] A. George,et al. Solution of sparse positive definite systems on a hypercube , 1989 .
[42] John K. Reid,et al. The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.
[43] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[44] Robert Schreiber,et al. Scalability of Sparse Direct Solvers , 1993 .
[45] Bruce Hendrickson,et al. The Chaco user`s guide. Version 1.0 , 1993 .
[46] Joseph W. H. Liu. The role of elimination trees in sparse factorization , 1990 .
[47] Joseph W. H. Liu,et al. A Comparison of Three Column-Based Distributed Sparse Factorization Schemes. , 1990 .
[48] Joseph W. H. Liu,et al. Reordering sparse matrices for parallel elimination , 1989, Parallel Comput..
[49] J. Ortega. Introduction to Parallel and Vector Solution of Linear Systems , 1988, Frontiers of Computer Science.
[50] J. G. Lewis,et al. A fast algorithm for reordering sparse matrices for parallel factorization , 1989 .
[51] Iain S. Duff,et al. Parallel implementation of multifrontal schemes , 1986, Parallel Comput..
[52] Alan George,et al. Communication results for parallel sparse Cholesky factorization on a hypercube , 1989, Parallel Comput..