
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C.W. Ho, R.C.T. Lee, "A Parallel Algorithm for Solving Sparse Triangular Systems," IEEE Transactions on Computers, vol. 39, no. 6, pp. 848852, June, 1990.  
BibTex  x  
@article{ 10.1109/12.53610, author = {C.W. Ho and R.C.T. Lee}, title = {A Parallel Algorithm for Solving Sparse Triangular Systems}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {6}, issn = {00189340}, year = {1990}, pages = {848852}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.53610}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Parallel Algorithm for Solving Sparse Triangular Systems IS  6 SN  00189340 SP848 EP852 EPD  848852 A1  C.W. Ho, A1  R.C.T. Lee, PY  1990 KW  parallel algorithm; sparse triangular systems; banded linear systems; directed graph; worstcase timecomplexity; coefficient matrix; triangular banded matrix; computational complexity; directed graphs; parallel algorithms. VL  39 JA  IEEE Transactions on Computers ER   
A fast parallel algorithm, which is generalized from the parallel algorithms for solving banded linear systems, is proposed to solve sparse triangular systems. The original problem is transformed into a directed graph. The solving procedure then consists of eliminating edges in this graph. The worstcase timecomplexity of this parallel algorithm is O(log/sup 2/n) where n is the size of the coefficient matrix. When the coefficient matrix is a triangular banded matrix with bandwidth m, then the timecomplexity of the algorithm is O(log(m)*log(n)).
[1] C. P. Arnold, M. I. Parr, and M. B. Dewe, "An efficient parallel algorithm for the solution of large sparse linear matrix equations,"IEEE Trans. Comput., vol. C32, no. 3, pp. 265273, Mar. 1983.
[2] S. C. Chen and D. J. Kuck, "Time and parallel bounds for linear recurrence systems,"IEEE Trans. Comput., vol. C24, no. 7, pp. 701717, 1975.
[3] J. J. Dongarra, F. G. Gustavson, and A. Karp, "Implementing linear algebra algorithms for dense matrix on a vector pipeline machine,"SIAM Rev., vol. 26, no. 1, pp. 91112, Jan. 1984.
[4] S. Fortune and J. Wyllie, "Parallelism in random access machines," inProc. 10th Annu. ACM Symp. Theory Comput., 1978, pp. 114118.
[5] Z. Galil and W. J. Paul, "An efficient generalpurpose parallel computer,"J. ACM, vol. 30, no. 2, pp. 360387, 1983.
[6] M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth, "Complexity results for bandwidth minimization,"SIAM J. Appl. Math., vol. 34, no. 3, pp. 477495, 1978.
[7] A. George, G. W. Stewart, and R. Voigt, Eds., a Special Volume on Parallel Computing,Linear Alg. Its Appl., vol. 77, May 1986.
[8] L. M. Goldschlager, "A universal interconnection pattern for parallel computers,"J. ACM, vol. 29, pp. 10731086, Oct. 1982.
[9] A. C. Greenberg, R. E. Ladner, M. S. Paterson, and Z. Galil, "Efficient parallel algorithms for linear recurrence computation,"Inform. Processing Lett., vol. 15, no. 1, pp. 3135, Aug. 1982.
[10] D. Heller, "A survey of parallel algorithms in numerical linear algebra,"SIAM Rev., vol. 20, no. 4, pp. 740777, Oct. 1978.
[11] R. W. Hockney, "A fast direct solution of Poisson's equation using Fourier analysis,"J. ACM, vol. 12, pp. 95113, 1965.
[12] R. W. Hockney, "The potential calculation and some applications,"Methods Computat. Phys., vol. 9, pp. 135221, 1970.
[13] T. L. Jordan, "A guide to parallel computation and some CRAYI experiences," inParallel Computations, G. Rodrigue Ed. New York: Academic, 1982, pp. 150.
[14] D. R. Kincaid, T. C. Oppe, and D. M. Young, "Vector computations for sparse linear systems,"SIAM J. Alg. Discrete Methods, vol. 7, no. 1, pp. 99112, Jan. 1986.
[15] J. M. Ortega and R. G. Voigt, "Solution of partial differential equations on vector and parallel computers,"SIAM Rev., vol. 27, no. 2, pp. 149240, June 1985.
[16] G. H. Rodrigue, N. K. Madsen, and J. I. Karush, "Oddeven reduction for banded linear equations,"J. ACM, vol. 26, no. 1, pp. 7281, Jan. 1979.
[17] A. H. Sameh and R. P. Brent, "Solving triangular systems on a parallel computer,"SIAM J. Numer. Anal., vol. 14, no. 6, pp. 11011113, Dec. 1977.
[18] J. T. Schwartz, "Ultracomputers,"ACM Trans. Programming Languages Syst., vol. 2, no. 4, pp. 484521, Oct. 1980.
[19] H. S. Stone, "An efficient parallel algorithm for the solution of a tridiagonal linear system of equations,"J. ACM, vol. 20, no. 1, pp. 2738, Jan. 1973.
[20] O. Wing, "A contentaddressable systolic array for sparse matrix computation,"J. Parallel Distributed Comput., vol. 2, pp. 170181, 1985.
[21] O. Wing and J. W. Huang, "A computation model of parallel solution of linear equations,"IEEE Trans. Comput., vol. 29, no. 7, pp. 632638, 1980.
[22] W.H. Yu,LU Decomposition on a Multiprocessing System with Commmunication Delay, doctoral dissertation, Dept. of Electrical Eng. and Computer Sciences, Univ. of California at Berkeley, 1984.