A comparison of parallel solvers for diagonally dominant and general narrow-banded linear systems II

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1685 LNCS, Issue , 1999, Pages 1078-1087

  Arbenz, Peter ^a   Cleary, Andrew ^b   Dongarra, Jack ^c   Hegland, Markus ^d  

^a ETH ZURICH   (Switzerland)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^c University of Tennessee Knoxville   (United States)

^d AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BANDED SYSTEMS; DIAGONALLY DOMINANT; LINEAR SYSTEMS OF EQUATIONS; NARROW BANDED; NUMERICAL EXPERIMENTS; PARALLEL SOLVER; SCALAPACK;

LINEAR SYSTEMS;

EID: 84878665905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_151     Document Type: Conference Paper

References (11)

1. P. Arbenz, On experiments with a parallel direct solver for diagonally dominant banded linear systems, in Euro-Par '96, L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, eds., Springer, Berlin, 1996, pp. 11-21. (Lecture Notes in Computer Science, 1124). (Pubitemid 126116243)
2. P. Arbenz, A. Cleary, J. Dongarra, and M. Hegland, A comparison of parallel solvers for diagonally dominant and general narrow-banded linear systems, Tech. Report 312, ETH Zürich, Computer Science Department, January 1999. (Available at URL http://www.inf.ethz.ch/publications/. Submitted to Parallel and Distributed Computing Practices (PCDP)).
3. P. Arbenz and W. Gander, A survey of direct parallel algorithms for banded linear systems, Tech. Report 221, ETH Zürich, Computer Science Department, October 1994. Available at URL http://www.inf.ethz.ch/publications/.
4. P. Arbenz and M. Hegland, Scalable stable solvers for non-symmetric narrow-banded linear systems, in Seventh International Parallel Computing Workshop (PCW'97), P. Mackerras, ed., Australian National University, Canberra, Australia, 1997, pp. P2-U-1-P2-U-6.
5. -, On the stable parallel solution of general narrow banded linear systems, in High Performance Algorithms for Structured Matrix Problems, P. Arbenz, M. Paprzycki, A. Sameh, and V. Sarin, eds., Nova Science Publishers, Commack, NY, 1998, pp. 47-73.
6. A. Cleary and J. Dongarra, Implementation in ScaLAPACK of divide-and-conquer algorithms for banded and tridiagonal systems, Tech. Report CS-97-358, University of Tennessee, Knoxville, TN, April 1997. (Available as LAPACK Working Note #125 from URL http://www.netlib.org/lapack/lawns/.
7. ScaLAPACK is available precompiled for the SP/2 from the archive of prebuilt ScaLAPACK libraries at http://www.netlib.org/scalapack/.
8. M. J. Daydé and I. S. Duff, The use of computational kernels in full and sparse linear solvers, efficient code design on high-performance RISC processors, in Vector and Parallel Processing - VECPAR'96, J. M. L. M. Palma and J. Dongarra, eds., Springer, Berlin, 1997, pp. 108-139. (Lecture Notes in Computer Science, 1215). (Pubitemid 127061887)
9. G. H. Golub and C. F. van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 2nd ed., 1989.
10. M. Hegland, Divide and conquer for the solution of banded linear systems of equations, in Proceedings of the Fourth Euromicro Workshop on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 394-401.
11. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing, Benjamin/Cummings, Redwood City CA, 1994.