In this papers a class of algorithm for determining determinants of sparse banded matrix is suggested. The computing speed of this algorithm is 2--5 times faster than of column pivot Gaussian elimination method. Some ...In this papers a class of algorithm for determining determinants of sparse banded matrix is suggested. The computing speed of this algorithm is 2--5 times faster than of column pivot Gaussian elimination method. Some munerical experiments are discussed. This algorithm is adapted for parallel evaluation too.展开更多
文摘In this papers a class of algorithm for determining determinants of sparse banded matrix is suggested. The computing speed of this algorithm is 2--5 times faster than of column pivot Gaussian elimination method. Some munerical experiments are discussed. This algorithm is adapted for parallel evaluation too.
