Abstract
An efficient permutation algorithm is developed for a certain class of matrices; namely, those that possess constant and variable elements. A partitioning technique is employed that separates the constant portion from the variable part. A number of tests are developed to maintain an optimum bandwidth. The algorithm has been tested for several hundred sparse matrices and results show that an optimum bandwidth is maintained for the L/U decomposition of the matrix.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
