Developments and trends in the parallel solution of linear systems

Parallel Computing

Volumn 25, Issue 13, 1999, Pages 1931-1970

  Duff, Iain S ^a   Van Der Vorst, Henk A ^b  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; ITERATIVE METHODS; LINEAR CONTROL SYSTEMS; MATRIX ALGEBRA; PARALLEL ALGORITHMS;

DENSE MATRICES; KRYLOV METHODS; SPARSE MATRICES; TRIDIAGONAL SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033285109     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00077-0     Document Type: Article

References (216)

1. G. Alaghband, Parallel sparse matrix solution and performance, Parallel Comput. 21 (9) (1995) 1407-1430.
2. G. Alléon, M. Benzi, L. Giraud, Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics, Numer. Algorithms 16 (1) (1997) 1-15.
3. F.L. Alvarado, H. Dag, Incomplete partitioned inverse preconditioners, Technical report, Department of Electrical and Computer Engineering, University of Wisconsin, Madison, 1994.
4. F.L. Alvarado, A. Pothen, R. Schreiber, Highly parallel sparse triangular solution, in: Alan George, J.R. Gilbert, J.W.H. Liu (Eds.), Graph Theory and Sparse Matrix Computation, Springer, Berlin, 1993.
5. F.L. Alvarado, R. Schreiber, Optimal parallel solution of sparse triangular systems, SIAM J. Sci. Comput. 14 (1993) 446-460.
6. -1 methods, IEEE Trans. Power Syst. 3 (1990) 452-459.
7. P.R. Amestoy, Factorization of large sparse matrices based on a multifrontal approach in a multiprocessor environment, INPT Ph.D. thesis TH/PA/91/2, CERFACS, Toulouse, France, 1991.
8. P.R. Amestoy, I.S. Duff, Vectorization of a multiprocessor multifrontal code, Inter. J. Supercomputer Appl. 3 (1989) 41-59.
9. P.R. Amestoy, I.S. Duff, J.Y. L'Excellent, Multifrontal solvers within the PARASOL environment, in: B. Kågström, J. Dongarra, E. Elmroth, J. Waśniewski (Eds.), Applied Parallel Computing, PARA'98, Lecture Notes in Computer Science, No. 1541, Springer, Berlin, 1998, pp. 7-11.
10. P.R. Amestoy, I.S. Duff, C. Puglisi, Multifrontal QR factorization in a multiprocessor environment, Numer. Linear Algebra with Appl. 3 (4) (1996) 275-300.
11. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. DuCroz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, D. Sorensen, LAPACK Users' Guide, Second ed., SIAM, Philadelphia, PA, 1995.
12. E.C. Anderson, Y. Saad, Solving sparse triangular systems on parallel computers, Inter. J. High Speed Comput. 1 (1989) 73-95.
13. M. Arioli, I.S. Duff, J. Noailles, D. Ruiz, A block projection method for sparse matrices, SIAM J. Sci. Statist. Comput. 13 (1992) 47-70.
14. S.F. Ashby, Minimax polynomial preconditioning for Hermitian linear systems, SIAM J. Matrix Anal. Appl. 12 (1991) 766-789.
15. C. Ashcraft, S.C. Eisenstat, J.W.H. Liu, A fan-in algorithm for distributed sparse numerical factorization, SIAM J. Sci. Statist. Comput. 11 (1990) 593-599.
16. C. Ashcraft, S.C. Eisenstat, J.W.H. Liu, A.H. Sherman, A comparison on three column-based distributed sparse factorization schemes, Technical Report CS-90-09, Department of Computer Science, York University, York, Ontario, Canada, 1990.
17. C. Ashcraft, J.W.H. Liu, Robust ordering of sparse matrices using multisection, Technical Report ISSTECH-96-002, Boeing Information and Support Services, Seattle, 1996, also Report CS-96-01, Department of Computer Science, York University, Ontario, Canada.
18. O. Axelsson, Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.
19. I. Babuska, Numerical stability in problems of linear algebra, SIAM J. Numer. Anal. 9 (1972) 53-77.
20. Z. Bai, D. Hu, L. Reichel, A Newton basis GMRES implementation, IMA J. Numer. Anal. 14 (1991) 563-581.
21. S.T. Barnard, L.M. Bernardo, H.D. Simon, An MPI implementation of the SPAI preconditioner on the T3E, Technical Report LBNL-40794 UC405, Lawrence Berkeley National Laboratory, 1997.
22. S.T. Barnard, R.L. Clay, A portable MPI implementation of the SPAI preconditioner in ISIS++, in: Michael Heath, Virginia Torczon, Greg Astfalk, Petter E. Björstad, Alan H. Karp, Charles H. Koebel, V. Kumar, R.F. Lucas, Layne T. Watson, David E. Womble (Eds.), Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997, pp. xxx-yyy.
23. S.T. Barnard, A. Pothen, H. Simon, A spectral algorithm for envelope reduction of sparse matrices, Numer. Linear Algebra Appl. 2 (4) (1995) 317-334.
24. P. Bastian, G. Horton, Parallelization of robust multigrid methods: ILU factorization and frequency decomposition method, SIAM J. Sci. Statist. Comput. 6 (1991) 1457-1470.
25. M. Benzi, C.D. Meyer, M. Tůma, A sparse approximate inverse preconditioner for the Conjugate Gradient method, SIAM J. Sci. Comput. 17 (1996) 1135-1149.
26. M. Benzi, J. Marín, M. Tůma, A two-level parallel preconditioner based on sparse approximate inverses, in: D.R. Kincaid, A.C. Elster (Eds.), Iterative Methods in Scientific Computation, II, IMACS, 1999, pp. 1-11.
27. M. Benzi, M. Tůma, Numerical experiments with two sparse approximate inverse preconditioners, BIT 38 (1998) 234-241.
28. M. Benzi, M. Tůma, A sparse approximate inverse preconditioner for non-symmetric linear systems, SIAM J. Sci. Comput. 19 (3) (1998) 968-994.
29. A. Berger, J. Mulvey, E. Rothberg, R. Vanderbei, Solving multistage stochastic programs using tree dissection, Technical Report SOR-97-07, Programs in Statistics and Operations Research, Princeton University, Princeton, New Jersey, 1995.
30. H. Berryman, J. Saltz, W. Gropp, R. Mirchandaney, Krylov methods preconditioned with incompletely factored matrices on the CM-2, J. Par. Dist. Comp. 8 (1990) 186-190.
31. R.H. Bisseling, T.M. Loup, L.D.J.C. Loyens, A parallel Interior Point algorithm for linear programming on a network of transputers, Annal. Oper. Res. 43 (1993) 51-86.
32. R.H. Bisseling, W.F. McColl, Scientific computing on bulk synchronous parallel architectures, in: B. Pehrson, I. Simon (Eds.), Technology and Foundations: Information Processing '94, vol. I, IFIP Trans. A, Elsevier, Amsterdam, 51, 1994, pp. 509-514.
33. L.S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, R.C. Whaley, ScaLAPACK Users' Guide, SIAM, Philadelphia, PA, 1997.
34. S. Bondeli, Divide and Conquer: parallele Algorithmen zur Losing tridiagonaler Gleichungssysteme, Ph.D. thesis, ETH Zürich, Zürich, 1991.
35. R. Bramley, A. Sameh, Row projection methods for large non-symmetric linear systems, SIAM J. Sci. Statist. Comput. 13 (1992) 168-193.
36. H.M. Bücker, M. Sauren, A parallel version of the unsymmetric Lanczos algorithm and its application to QMR, Technical Report KFA-ZAM-IB-9605, Forschungszentrum Jülich Gmbh, Jülich, Germany, 1996.
37. B.L. Buzbee, G.H. Golub, C.W. Nielson, On direct methods for solving Poisson's equations, SIAM J. Numer. Anal. 7 (1970) 627-656.
38. D.A. Calahan, Parallel solution of sparse simultaneous linear equations, in: Proceedings of the 11th Annual Allerton Conference on Circuits and System Theory, University of Illinois, 1973, pp. 729-735.
39. T.F. Chan, E. Gallopoulos, V. Simoncini, T. Szeto, C.H. Tong, A quasi-minimal residual variant of the Bi-CGSTAB algorithm for non-symmetric systems, SIAM J. Sci. Comput. 15 (1994) 338-347.
40. T.F. Chan, D. Goovaerts, A note on the efficiency of domain decomposed incomplete factorizations, SIAM J. Sci. Statist. Comput. 11 (1990) 794-803.
41. T.F. Chan, H.A. van der Vorst, Approximate and incomplete factorizations, in: D.E. Keyes, A. Sameh, V. Venkatakrishnan (Eds.), Parallel Numerical Algorithms, ICASE/LaRC Interdisciplinary Series in Science and Engineering, Kluwer, Dordrecht, 1997, pp. 167-202.
42. S.C. Chen, D.J. Kuck, A.H. Sameh, Practical parallel band triangular system solvers, ACM Trans. Math. Softw. 4 (1978) 270-277.
43. H. Choi, D.B. Szyld, Threshold ordering for preconditioning non-symmetric problems with highly varying coefficients, Technical Report 96-51, Department of Mathematics, Temple University, Philadelphia, 1996.
44. E. Chow, Y. Saad, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput. 19 (1998) 995-1023.
45. A.T. Chronopoulos, Towards efficient parallel implementation of the CG method applied to a class of block tridiagonal linear systems, in: Supercomputing '91, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 578-587.
46. A.T. Chronopoulos, C.W. Gear, s-Step iterative methods for symmetric linear systems, J. Comput. Appl. Math. 25 (1989) 153-168.
47. A.T. Chronopoulos, S.K. Kim, s-Step Orthomin and GMRES implemented on parallel computers, Technical Report 90/43R, UMSI, Minneapolis, 1990.
48. A.T. Chronopoulos, S.K. Kim, Towards efficient parallel implementation of Krylov subspace iterative methods, Supercomputer 47 (1992) 4-17.
49. A.T. Chronopoulos, C.D. Swanson, Parallel iterative s-step methods for unsymmetric linear systems, Parallel Comput. 22 (1996) 623-641.
50. P. Concus, G.H. Golub, G. Meurant, Block preconditioning for the Conjugate Gradient method, SIAM J. Sci. Statist. Comput. 6 (1985) 220-252.
51. P. Concus, G. Meurant, On computing INV block preconditionings for the Conjugate Gradient method, BIT, 1986, pp. 493-504.
52. J.M. Conroy, S.G. Kratzer, R.F. Lucas, Data-parallel sparse matrix factorization, in: J.G. Lewis (Ed.), Proceedings of the Fifth SIAM Conference on Linear Algebra, SIAM, Philadelphia, PA, 1994, pp. 377-381.
53. J.D.F. Cosgrove, J.C. Diaz, A. Griewank, Approximate inverse preconditionings for sparse linear systems, Inter. J. Comput. Math. 44 (1992) 91-110.
54. L. Crone, H. van der Vorst, Communication aspects of the Conjugate Gradient method on distributed-memory machines, Supercomputer X(6) (1993) 4-9.
55. T.A. Davis, I.S. Duff, An unsymmetric-pattern multifrontal method for sparse LU factorization, SIAM J. Matrix Anal. Appl. 18 (1) (1997) 140-158.
56. T.A. Davis, P.C. Yew, A non-deterministic parallel algorithm for general unsymmetric sparse LU factorization, SIAM J. Matrix Anal. Appl. 11 (1990) 383-402.
57. E.F. D'Azevedo, V. Eijkhout, C. Romine, LAPACK working note 56: Reducing communication costs in the Conjugate Gradient algorithm on distributed memory multiprocessor, Technical report, Computer Science Department, University of Knoxville, Knoxville, TN, 1993.
58. E.F. D'Azevedo, C. Romine, Reducing communication costs in the Conjugate Gradient algorithm on distributed memory multiprocessors, Technical Report ORNL/TM-12192, Oak Ridge National Lab, Oak Ridge, TN, 1992.
59. P.P.N. de Groen, Base p-cyclic reduction for tridiagonal systems of equations, Appl. Numer. Math. 8 (1991) 117-126.
60. J. De Keyser, D. Roose, Distributed mapping of SPMD programs with a generalized Kernighan-Lin heuristic, in: W. Gentzsch, U. Harms (Eds.), High-Performance Computing and Networking, Lecture Notes in Computer Science, Springer, Berlin, 797, 1994, pp. 227-232.
61. E. de Sturler, A parallel restructured version of GMRES(m), Technical Report 91-85, Delft University of Technology, Delft, 1991.
62. E. de Sturler, Iterative methods on distributed memory computers, Ph.D. thesis, Delft University of Technology, Delft, The Netherlands, 1994.
63. E. de Sturler, A performance model for Krylov subspace methods on mesh-based parallel computers, Parallel Comput. 22 (1996) 57-74.
64. E. de Sturler, H.A. van der Vorst, Reducing the effect of global communication in GMRES(m) and CG on parallel distributed memory computers, Appl. Numer. Math. 18 (1995) 441-459.
65. J.W. Demmel, M.T. Heath, H.A. van der Vorst, Parallel numerical linear algebra, in: Acta Numerica 1993 Cambridge University Press, Cambridge, 1993.
66. J.W. Demmel, S.C. Eisenstat, J.R. Gilbert, X.S. Li, J.W.H. Liu, A supernodal approach to sparse partial pivoting, SIAM J. Matrix Anal. Appl. 20 (1999) 720-755.
67. J.W. Demmel, J.R. Gilbert, X.S. Li, SuperLU users' guide, Technical report, Computer Science Division, UC Berkeley, Berkeley, California, February 1995 (available from netlib).
68. S. Doi, On parallelism and convergence of incomplete LU factorizations, Appl. Numer. Math. 7 (1991) 417-436.
69. S. Doi, A. Hoshi, Large numbered multicolor MILU preconditioning on SX-3/14, Inter. J. Comput. Math. 44 (1992) 143-152.
70. J.J. Dongarra, Performance of various computers using standard linear algebra software, Technical Report CS-89-85, University of Tennessee, Knoxville, Tennessee, 1999. Updated version at Web address http://www.netlib.org/benchmark/performance. ps.
71. J.J. Dongarra, J.R. Bunch, C.B. Moler, G.W. Stewart, LINPACK User's Guide, SIAM, Philadelphia, 1979.
72. J.J. Dongarra, J.J. Du Croz, S. Hammarling, R.J. Hanson, An extented set of Fortran basic linear algebra subprogramsm, ACM Trans. Math. Softw. 14 (1988) 1-17.
73. J.J. Dongarra, J.J. Du Croz, I.S. Duff, S. Hammarling, A set of Level 3 basic linear algebra subprograms, ACM Trans. Math. Softw. 16 (1990) 1-17.
74. J.J. Dongarra, I.S. Duff, D.C. Sorensen, H.A. van der Vorst, Numerical Linear Algebra for High-Performance Computers, SIAM Press, Philadelphia, 1998.
75. P. Dubois, G. Rodrigue, An analysis of the recursive doubling algorithm, in: D.J. Kuck, A.H. Sameh (Eds.), High Speed Computer and Algorithm Organization, Academic Press, New York, 1977.
76. P.F. Dubois, A. Greenbaum, G.H. Rodrigue, Approximating the inverse of a matrix for use in iterative algorithms on vector processors, Computing 22 (1979) 257-268.
77. I.S. Duff, The use of vector and parallel computers in the solution of large sparse linear equations, in: P. Deuflhard, B. Engquist (Eds.), Large Scale Scientific Computing, Progress in Scientific Computing, vol. 7, Boston, Birkhäuser, 1986, pp. 331-348.
78. I.S. Duff, The influence of vector and parallel computers in the solution of large sparse linear equations, in: M.J.D. Powell, A. Iserles (Eds.), The State of the Art in Numerical Analysis, Oxford University Press, Oxford, 1987, pp. 359-407.
79. I.S. Duff, A.M. Erisman, C.W. Gear, J.K. Reid, Sparsity structure and Gaussian elimination, SIGNUM Newsletter 23 (2) (1988) 2-8.
80. I.S. Duff, A.M. Erisman, J.K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, Oxford, England, 1986.
81. I.S. Duff, J. Koster, The design and use of algorithms for permuting large entries to the diagonal of sparse matrices, SIAM J. matrix Anal. Appl. 20 (1999) 889-901.
82. I.S. Duff, M. Marrone, G. Radicati, C. Vittoli, Level 3 basic linear algebra subprograms for sparse matrices: a user level interface, ACM Trans. Math. Softw. 23 (3) (1997) 379-401.
83. I.S. Duff, G.A. Meurant, The effect of ordering on preconditioned Conjugate Gradient, BIT 29 (1989) 635-657.
84. I.S. Duff, J.K. Reid, The multifrontal solution of indefinite sparse symmetric linear systems, ACM Trans. Math. Softw. 9 (1983) 302-325.
85. B. Dumitrescu, M. Doreille, J.-L. Roch, D. Trystram, Two-dimensional block partitioning for the parallel sparse Cholesky factorization, Numer. Algorithms 16 (1997) 17-38.
86. V. Eijkhout, Beware of unperturbed modified incomplete point factorizations, in: R. Beauwens, P. de Groen (Eds.), Iterative Methods in Linear Algebra, Amsterdam, 1992, pp. 583-591; IMACS Int. Symp., Brussels, Belgium, North-Holland, Amsterdam, 1991, pp. 2-4.
87. V. Eijkhout, Beware of unperturbed modified incomplete point factorizations, in: R. Beauwens, P. de Groen (Eds.), Iterative Methods in Linear Algebra, Amsterdam, 1992, pp. 583-591; IMACS Int. Symp., Brussels, Belgium, North-Holland, Amsterdam, 1991, pp. 2-4.
88. V. Faber, T.A. Manteuffel, Necessary and sufficient conditions for the existence of a Conjugate Gradient method, SIAM J. Numer. Anal. 21 (2) (1984) 352-362.
89. R. Fletcher, Conjugate Gradient methods for indefinite systems, Lecture Notes Math., vol. 506, Springer, Berlin, New York, 1976, pp. 73-89.
90. R.W. Freund, N.M. Nachtigal, QMR: A quasi-minimal residual method for non-Hermitian linear systems, Numer. Math. 60 (1991) 315-339.
91. R. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput. 14 (1993) 470-482.
92. K.A. Gallivan, B.A. Marsolf, H.A.G. Wijshoff, Solving large non-symmetric sparse linear systems using MCSPARSE, Parallel Comput. 22 (1996) 1291-1333.
93. A. Geist, E. Ng, Task scheduling for parallel sparse Cholesky factorization, Inter. J. Parallel Programming 18 (1989) 291-314.
94. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal. 10 (1973) 345-363.
95. A. George, M.T. Heath, J.W.H. Liu, E. Ng, Solution of sparse positive-definite systems on a shared memory multiprocessor, Inter. J. Parallel Programming 15 (1986) 309-325.
96. A. George, M.T. Heath, J.W.H. Liu, E. Ng, Sparse Cholesky factorization on a local-memory multiprocessor, SIAM J. Sci. Statist. Comput. 9 (1988) 327-340.
97. A. George, M.T. Heath, J.W.H. Liu, E. Ng, Solution of sparse positive definite systems on a hypercube, J. Comput. Appl. Math. 27 (1989) 129-156.
98. A. George, J.W.H. Liu, The design of a user interface for a sparse matrix package, ACM Trans. Math. Softw. 5 (2) (1979) 139-162.
99. A. George, J.W.H. Liu, E.G. Ng, User's guide for SPARSPAK: Waterloo sparse linear equations package, Technical Report CS-78-30 (Revised), University of Waterloo, Canada, 1980.
100. A. George, E. Ng, Shared versus local memory in parallel sparse matrix computations, SIGNUM Newsletter 23 (2) (1988) 9-13.
101. A. George, J.W. Poole, R. Voigt, Incomplete nested dissection for solving n-by-n grid problems, SIAM J. Numer. Anal. 15 (1978) 663-673.
102. J.P. Geschiere, H.A.G. Wijshoff, Exploiting large grain parallelism in a sparse direct linear system solver, Parallel Comput. 21 (8) (1995) 1339-1364.
103. J.R. Gilbert, J.W.H. Liu, Elimination structures for unsymmetric sparse LU factors, SIAM J. Matrix Anal. Appl. 14 (1993) 334-354.
104. J.R. Gilbert, R. Schreiber, Highly parallel sparse Cholesky factorization, SIAM J. Sci. Statist. Comput. 13 (1992) 1151-1172.
105. J.R. Gilbert, E. Zmijewski, A parallel graph partitioning algorithm for a message-passing multiprocessor, Inter. J. Parallel Programming 16 (1987) 427-449.
106. G.H. Golub, C.F. Van Loan, Matrix Computations, Third ed. The Johns Hopkins University Press, Baltimore, 1996.
107. N.I.M. Gould, J.A. Scott, Sparse approximate-inverse preconditioners using norm-minimization techniques, SIAM J. Sci. Comput. 19 (2) (1998) 605-625.
108. A. Greenbaum, Iterative Methods for Solving Linear Systems, SIAM, Philadelphia, 1997.
109. M. Grote, H. Simon, Parallel preconditioning and approximate inverses on the connection machine, in: R.F. Sincovec, D.E. Keyes, M.R. Leuze, L.R. Petzold, D.A. Reed (Eds.), Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1993, pp. 519-523.
110. M.J. Grote, T. Huckle, Parallel preconditionings with sparse approximate inverses, SIAM J. Sci. Comput. 18 (1997) 838-853.
111. A. Gupta, M. Joshi, V. Kumar, WSSMP: Watson Symmetric Sparse Matrix Package, Users Manual: Version 2.0β, Technical Report RC 20923 (92669), IBM T.J. Watson Research Centre, P.O. Box 218, Yorktown Heights, NY 10598, July 1997.
112. A. Gupta, G. Karypis, V. Kumar, Highly scalable parallel algorithms for sparse matrix factorization, IEEE Trans. Parallel and Distributed Systems 8 (1997) 502-520.
113. I. Gustafsson, G. Lindskog, A preconditioning technique based on element matrix factorizations, Comput. Meth. Appl. Mech. Engrg. 55 (1986) 201-220.
114. I. Gustafsson, G. Lindskog, Completely parallelizable preconditioning methods, Numer. Linear Algebra Appl. 2 (1995) 447-465.
115. M.H. Gutknecht, Variants of BICGSTAB for matrices with complex spectrum, SIAM J. Sci. Comput. 14 (1993) 1020-1033.
116. M.H. Gutknecht, Lanczos-type solvers for non-symmetric linear systems of equations, in: Acta Numerica 1997, Cambridge University Press, Cambridge, 1997, pp. 271-397.
117. G. Haase, Parallel incomplete Cholesky preconditioners based on the non-overlapping data distribution, Parallel Comput. 24 (1998) 1685-1703.
118. M.T. Heath, E.G.Y. Ng, B.W. Peyton, Parallel algorithms for sparse linear systems, SIAM Review 33 (1991) 420-460.
119. M.T. Heath, P. Raghavan (Eds.), Performance of a fully parallel sparse solver, in: IEEE, Proceedings of SHPCC '94, Scalable High-Performance Computing Conference, May 23-25, 1994; IEEE Computer Society Press, Knoxville, Tennessee, Los Alamitos, California, 1994, pp. 334-341.
120. M.T. Heath, P. Raghavan (Eds.), Performance of a fully parallel sparse solver, in: IEEE, Proceedings of SHPCC '94, Scalable High-Performance Computing Conference, May 23-25, 1994; IEEE Computer Society Press, Knoxville, Tennessee, Los Alamitos, California, 1994, pp. 334-341.
121. B. Heisse, M. Jung, Parallel solvers for non-linear elliptic problems based on domain decomposition ideas, Parallel Comput. 22 (1997) 1527-1544.
122. D. Heller, Some aspects of the cyclic reduction algorithm for block tridiagonal linear systems, SIAM J. Numer. Anal. 13 (1978) 484-496.
123. B. Hendrickson, R. Leland, The CHACO User's Guide, Version 2.0. Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, October 1994.
124. B. Hendrickson, E. Rothberg, Improving the runtime and quality of nested dissection ordering, SIAM J. Sci. Comput. 20 (1998) 468-489.
125. M.R. Hestenes, E. Stiefel, Methods of Conjugate Gradients for solving linear systems, J. Res. Natl. Bur. Stand. 49 (1954) 409-436.
126. T.J.R. Hughes, I. Levit, J. Winget, An element-by-element solution algorithm for problems of structural and solid mechanics, J. Comput. Meth. Appl. Mech. Engrg. 36 (1983) 241-254.
127. Z. Johan, Data Parallel Finite Element Techniques for Large-Scale Computational Fluid Dynamics, Ph.D. thesis, Stanford University, Stanford, CA, 1992.
128. Z. Johan, K.K. Mathur, S.L. Johnsson, T.J.R. Hughes, Mesh decomposition and communication procedures for finite element applications on the connection machine CM-5 system, in: W. Gentzsch, U. Harms (Eds.), High-Performance Computing and Networking, Lecture Notes in Computer Science, Springer, Berlin, 797, 1994, pp. 233-240.
129. O.G. Johnson, C.A. Micheli, G. Paul, Polynomial preconditioning for Conjugate Gradient calculations, SIAM J. Numer. Anal. 20 (1983) 363-376.
130. M.T. Jones, P.E. Plassmann, The efficient parallel iterative solution of large sparse linear systems, in: A. George, J.R. Gilbert, J.W.H. Liu (Eds.), Graph Theory and Sparse Matrix Computations, IMA vol 56, Springer, Berlin, 1994.
131. G. Karypis, V. Kumar, METIS: unstructured graph partitioning and sparse matrix ordering system, Technical report, Department of Computer Science, University of Minnesota, 1995.
132. G. Karypis, V. Kumar, Parallel multilevel graph partitioning, Technical Report TR-95-036, Department of Computer Science, University of Minnesota, May 1995.
133. D.R. Kincaid, T.C. Oppe, Recent vectorization and parallelization of ITPACKV, in: O. Axelsson, L.Yu. Kolotilina (Eds.), Preconditioned Conjugate Gradient Methods, Berlin, 1990, pp. 58-74; Lecture Notes in Mathematics 1457, Nijmegen 1989, Springer, Berlin.
134. D.R. Kincaid, T.C. Oppe, Recent vectorization and parallelization of ITPACKV, in: O. Axelsson, L.Yu. Kolotilina (Eds.), Preconditioned Conjugate Gradient Methods, Berlin, 1990, pp. 58-74; Lecture Notes in Mathematics 1457, Nijmegen 1989, Springer, Berlin.
135. L.Y. Kolotilina, A.Y. Yeremin, Factorized sparse approximate inverse preconditionings, SIAM J. Matrix Anal. Appl. 14 (1993) 45-58.
136. J. Koster, R.H. Bisseling, Parallel sparse LU decomposition on a distributed-memory multiprocessor, 1994, submitted to SIAM J. Scientific Computing.
137. J.C.C. Kuo, T.F. Chan, Two-color Fourier analysis of iterative algorithms for elliptic problems with red/black ordering, SIAM J. Sci. Statist. Comput. 11 (1990) 767-793.
138. J.J. Lambiotte, R.G. Voigt, The solution of tridiagonal linear systems on the CDC-STAR-100 computer, Technical report, ICASE-NASA Langley Research Center, Hampton, VA, 1974.
139. C. Lanczos, Solution of systems of linear equations by minimized iterations, J. Res. Natl. Bur. Stand 49 (1952) 33-53.
140. C.L. Lawson, R.J. Hanson, D.R. Kincaid, F.T. Krogh, Basic linear algebra subprograms for Fortran usage, ACM Trans. Math. Softw. 5 (1979) 308-323.
141. G. Li, A block variant of the GMRES method on massively parallel processors, Parallel Comput. 23 (1997) 1005-1019.
142. X.S. Li, J.W. Demmel, Making sparse Gaussian elimination scalable by static pivoting, in: Proceedings of Supercomputing Orlando, Florida, November 1998.
143. J.W.H. Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Trans. Math. Softw. 12 (1987) 249-264.
144. J.W.H. Liu, Reordering sparse matrices for parallel elimination, Parallel Comput. 11 (1989) 73-91.
145. N.K. Madsen, G.H. Rodrigue, J.I. Karush, Matrix multiplication by diagonals on a vector/parallel processor, Inform. Process. Lett. 5 (1976) 41-45.
146. F. Manne, H. Hafsteinsson, Efficient sparse Cholesky factorization on a massively parallel SIMD computer, SIAM J. Sci. Comput. 16(4) (1995) 934-950.
147. H.M. Markowitz, The elimination form of the inverse and its application to linear programming, Management Science, 3, 1957, pp. 255-269.
148. O.A. McBryan, E.F. van de Velde, Hypercube algorithms and implementations, SIAM J. Sci. Statist. Comput. 8 (1987) 227-287.
149. V. Mehrmann, Divide and conquer methods for block tridiagonal systems, Technical Report Bericht Nr. 68, Inst. für Geometrie und Prakt. Math., RWTH, Aachen, 1991.
150. U. Meier, A parallel partition method for solving banded systems of linear equations, Parallel Comput. 2 (1985) 33-43.
151. U. Meier, A. Sameh, The behavior of Conjugate Gradient algorithms on a multivector processor with a hierarchical memory, Technical Report CSRD 758, University of Illinois, Urbana, IL, 1988.
152. J.A. Meijerink, H.A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comput. 31 (1977) 148-162.
153. G. Meurant, The block preconditioned Conjugate Gradient method on vector computers, BIT 24 (1984) 623-633.
154. G. Meurant, Numerical experiments for the preconditioned Conjugate Gradient method on the CRAY X-MP/2, Technical Report LBL-18023, University of California, Berkeley, CA, 1984.
155. G. Meurant, The Conjugate Gradient method on vector and parallel supercomputers, Technical Report CTAC-89, University of Brisbane, July 1989.
156. P.H. Michielse, Parallelism in Adaptive Multigrid Solvers, Ph.D. thesis, Delft University of Technology, Delft, 1990.
157. P.H. Michielse, H.A. van der Vorst, Data transport in Wang's partition method, Parallel Comput. 7 (1988) 87-95.
158. E.G. Ng, B.W. Peyton, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Comput. 14 (1993) 1034-1056.
159. E.G. Ng, B.W. Peyton, A supernodal Cholesky factorization algorithm for shared-memory multiprocessors, SIAM J. Sci. Comput. 14 (1993) 761-769.
160. D.P. O'Leary, The block Conjugate Gradient algorithm and related methods, Linear Algebra Appl. 29 (1980) 293-322.
161. D.P. O'Leary, Parallel implementation of the Block Conjugate Gradient Algorithm, Parallel Comput. 5 (1987) 127-140.
162. J.M. Ortega, Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York, London, 1988.
163. C.C. Paige, M.A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975) 617-629.
164. B.W. Peyton, A. Pothen, X. Yuan, Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution, Technical Report ORNL/TM-12270, Engineering Physics and Mathematics Division, Oak Ridge National Laboratory, Tennessee, December 1992.
165. C. Pommerell, Solution of large unsymmetric systems of linear equations, Ph.D. thesis, Swiss Federal Institute of Technology, Zürich, 1992.
166. C. Pommerell, M. Annaratone, W. Fichtner, A set of new mapping and coloring heuristics for distributed-memory parallel computers, SIAM J. Sci. Statist. Comput. 13 (1992) 194-226.
167. A. Pothen, C. Sun, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput. 14(5) (1993) 1253-1257, timely communication.
168. G. Radicati di Brozolo, Y. Robert, Parallel Conjugate Gradient-like algorithms for solving sparse non-symmetric systems on a vector multiprocessor, Parallel Comput. 11 (1989) 223-239.
169. G. Radicati di Brozolo, M. Vitaletti, Sparse matrix-vector product and storage representations on the IBM 3090 with Vector Facility, Technical Report, IBM-ECSEC, Rome, July 1986, pp. 513-4098.
170. P. Raghavan, Efficient parallel sparse triangular solution with selective inversion, Technical Report CS-95-314, Department of Computer Science, University of Tennessee, Knoxville, Tennessee, 1995.
171. P. Raghavan, Parallel ordering using edge contraction, Parallel Computing 23 (1997) 1045-1067.
172. E. Rothberg, Exploring the tradeoff between imbalance and separator size in nested dissection ordering, Technical Report Unnumbered, Silicon Graphics Inc, 1996.
173. E. Rothberg, Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers, SIAM J. Sci. Comput. 17 (3) (1996) 699-713.
174. E. Rothberg, A. Gupta, An evaluation of left-looking, right-looking and multifrontal approaches to sparse Cholesky factorization on hierarchical-memory machines, Technical Report STAN-CS-91-1377, Department of Computer Science, Stanford University, 1991.
175. E. Rothberg, A. Gupta, An efficient block-oriented approach to parallel sparse Cholesky factorization, SIAM J. Sci. Comput. 15(6) (1994) 1413-1439.
176. E. Rothberg, R. Schreiber, Improved load distribution in parallel sparse Cholesky factorization, Technical Report 94-13, Research Institute for Advanced Computer Science, 1994.
177. Y. Saad, Practical use of polynomial preconditionings for the Conjugate Gradient method, SIAM J. Sci. Statist. Comput. 6 (1985) 865-881.
178. Y. Saad, Krylov subspace methods on supercomputers, Technical report, RIACS, Moffett Field, CA, September 1988.
179. Y. Saad, Iterative methods for sparse linear systems, PWS Publishing Company, Boston, 1996.
180. Y. Saad, M.H. Schultz, GMRES: a generalized minimal residual algorithm for solving non-symmetric linear systems, SIAM J. Sci. Statist. Comput. 7 (1986) 856-869.
181. J.J.F.M. Schlichting, H.A. van der Vorst, Solving bidiagonal systems of linear equations on the CDC CYBER 205, Technical Report NM-R8725, CWI, Amsterdam, The Netherlands, 1987.
182. J.J.F.M. Schlichting, H.A. van der Vorst, Solving 3-D block bidiagonal linear systems on vector computers, J. Comput. Appl. Math. 27 (1989) 323-330.
183. R. Schreiber, Scalability of sparse direct solvers, in: A. George, J.R. Gilbert, J.W.H. Liu (Eds.), Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications, Springer, Berlin, New York, 56, 1993, pp. 191-209.
184. H.D. Simon, Partitioning of unstructured problems for parallel processing, Technical Report RNR-91-008, NASA Ames Research Center, Moffett Field, CA, 1991.
185. V. Simoncini, E. Gallopoulos, An iterative method for non-symmetric systems with multiple right-hand sides, SIAM J. Sci. Comput. 16 (1995) 917-933.
186. G.L.G. Sleijpen, D.R. Fokkema, BICGSTAB (ℓ) for linear equations involving unsymmetric matrices with complex spectrum, ETNA 1 (1993) 11-32.
187. G.L.G. Sleijpen, H.A. van der Vorst, Reliable updated residuals in hybrid Bi-CG methods, Computing 56 (1996) 141-163.
188. G.L.G. Sleijpen, H.A. van der Vorst, D.R. Fokkema, Bi-CGSTAB (ℓ) other hybrid Bi-CG methods, Numer. Algorithms 7 (1994) 75-109.
189. P. Sonneveld, CGS: a fast Lanczos-type solver for non-symmetric linear systems, SIAM J. Sci. Statist. Comput. 10 (1989) 36-52.
190. H.S. Stone, An efficient parallel algorithm for the solution of a tridiagonal linear system of equations, J. Assoc. Comput. Mach. 20 (1973) 27-38.
191. K. Sumiyoshin, T. Ebisuzaki, Performance of parallel solution of a block-tridiagonal linear system on a Fujitsu VPP 500, Parallel Comput. 24 (1998) 287-304.
192. C. Sun, Efficient parallel solutions of large sparse SPD systems on distributed-memory multiprocessors, Technical Report CTC92TR102, Advanced Computing Research Institute, Cornell University, Ithaca, NY, 1992.
193. C. Sun, A package for solving sparse symmetric positive definite systems on distributed-memory multiprocessors, Technical Report CTC92TR114, Advanced Computing Research Institute, Cornell University, Ithaca, NY, November 1992.
194. R. Sweet, A parallel and vector variant of the cyclic reduction algorithm, Supercomputer 22 (1987) 18-25.
195. X.-H. Sun, H.-Z. Sun, L. Ni, Parallel algorithms for solution of tridiagonal systems on multicomputers, Technical report, Dept. of Computer Science, Michigan State University, 1989.
196. K.H. Tan, Local coupling in domain decomposition, Ph.D. thesis, Utrecht University, Utrecht, The Netherlands, 1995.
197. W.F. Tinney, J.W. Walker, Direct solutions of sparse network equations by optimally ordered triangular factorization, Proc. IEEE 55 (1967) 1801-1809.
198. A.F. van der Stappen, R.H. Bisseling, J.G.G. van de Vorst, Parallel sparse LU decomposition on a mesh network of transputers, SIAM J. Matrix Anal. Appl. 14 (1993) 853-879.
199. H.A. van der Vorst, A vectorizable variant of some ICCG methods, SIAM J. Sci. Statist. Comput. 3 (1982) 86-92.
200. H.A. van der Vorst, The performance of Fortran implementations for preconditioned Conjugate Gradients on vector computers, Parallel Comput. 3 (1986) 49-58.
201. H.A. van der Vorst, Large tridiagonal and block tridiagonal linear systems on vector and parallel computers, Parallel Comput. 5 (1987) 45-54.
202. H.A. van der Vorst, High performance preconditioning, SIAM J. Sci. Statist. Comput. 10 (1989) 1174-1185.
203. H.A. van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems, SIAM J. Sci. Statist. Comput. 13 (1992) 631-644.
204. H.A. van der Vorst, J.M. van Kats, The performance of some linear algebra algorithms in FORTRAN on CRAY-1 and Cyber-205 supercomputers, Technical report, Academisch Computer Centrum, Utrecht, 1984.
205. A.C.N. van Duin, Parallel Sparse Matrix Computations, Ph.D. thesis, Leiden University, Leiden, The Netherlands, 1998.
206. M.B. van Gijzen, Iterative solution methods for linear equations in finite element computations, Ph.D. thesis, Delft University of Technology, Delft, The Netherlands, 1994.
207. C. Vuik, R.R.P. van Nooyen, P. Wesseling, Parallelism in
208. H.H. Wang, A parallel method for tridiagonal equations, ACM Trans. Math. Softw. 7 (1989) 170-183.
209. T. Washio, K. Hayami, Parallel block preconditioning based on SSOR and MILU, Numer. Linear Algebra Appl. 1 (1994) 533-553.
210. R.C. Whaley, Lapack working note 73 : Basic linear algebra communication subprograms: Analysis and implementation across multiple parallel architectures. Technical Report CS-94-234, Computer Science Department, University of Tennessee, Knoxville, Tennessee, May 1994.
211. J.H. Wilkinson, C. Reinsch, Handbook for automatic computation, Linear Algebra, vol. II, Springer, Berlin, 1971.
212. J. Zhang, A sparse approximate inverse technique for parallel preconditioning of general sparse matrices, Technical Report 281-98, Department of Computer Science, University of Kentucky, KY, 1998.
213. Z. Zlatev, J. Waśniewski, P.C. Hansen, Tz. Ostromsky, PARASPAR: a package for the solution of large linear algebraic equations on parallel computers with shared memory, Technical Report 95-10, Tech Univ Denmark, Lyngby, 1995.
214. Z. Zlatev, J. Waśniewski, K. Schaumburg, Introduction to PARASPAR, solution of large and sparse systems of linear algebraic equations, specialised for parallel computers with shared memory. Technical Report 93-02, Tech Univ Denmark, Lyngby, 1993.
215. E. Zmijewski, Sparse Cholesky Factorization on a Multiprocessor, Ph.D. thesis, Cornell University, 1987.
216. E. Zmijewski, J.R. Gilbert, A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor, Parallel Comput. 7 (1988) 199-210.