Issue No. 06 - June (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24290
The inherent strong seriality of closely coupled systems is circumvented by defining a family of permutations for reordering equation sets whose matrix of coefficients is Hermitian block tridiagonal. The authors show how these permutations can be used to achieve relatively high concurrency in the Cholesky factorization of banded systems at the expense of introducing limited extra computations d
permutations; concurrent factorization; block tridiagonal matrices; closely coupled systems; equation sets; Hermitian block tridiagonal; Cholesky factorization; speedup; efficiency; computational complexity; matrix algebra; parallel algorithms.
M. Salama, R. Melosh and S. Utku, "A Family of Permutations for Concurrent Factorization of Block Tridiagonal Matrices," in IEEE Transactions on Computers, vol. 38, no. , pp. 812-824, 1989.