An optimal parallel algorithm for sparse matrix bandwidth reduction on a linear array

I. Devi Prasad Department of Electrical Engineering, Indian Institute of Science, Bangalore, 560012, India

L.M. Patnaik Microprocessor and Applications Laboratory, Indian Institute of Science, Bangalore, 560012, India

I.S.N. Murthy Department of Electrical Engineering, Indian Institute of Science, Bangalore, 560012, India

References

Tewarson , R.P. 1973 . Sparse Matrices, Mathematics in Science and Engineering , Vol. 99 , Academic Press .
Google Scholar
Stewart , G.W. 1973 . Introduction to Matrix Computations, Computer Science and Applied Mathematics , Academic Press .
Google Scholar
Puttonen , Jari . 1982 . Simple and efficient bandwidth reduction algorithm . International Journal for Numerical Methods in Engineering , 19 : 1139 – 1152 .
Google Scholar
Akhras , G. and Dhatt , G. 1976 . An automatic node relabelling scheme for minimizing a matrix or network bandwidth . International Journal for Numerical Methods in Engineering , 10 : 787 – 797 .
Google Scholar
Grooms , H.R. 1972 . Algorithm for matrix bandwidth reduction . Journal of Structural Division, A.S.C.E , 98 ( STI ) : 203 – 214 .
Google Scholar
Akl , S.G. 1986 . Parallel sorting algorithms , Academic Press .
Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

An optimal parallel algorithm for sparse matrix bandwidth reduction on a linear array

References

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

An optimal parallel algorithm for sparse matrix bandwidth reduction on a linear array

References

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date