We present a linear-time algorithm for sparse symmetric matrices which converts a matrix into pentadiagonal form (“bandwidth 2”), whenever it is possible to do so using simultaneous row and column permutations. On t...
详细信息
We present a linear-time algorithm for sparse symmetric matrices which converts a matrix into pentadiagonal form (“bandwidth 2”), whenever it is possible to do so using simultaneous row and column permutations. On the other hand when an arbitrary integer k and graph G are given, we show that it is NP-complete to determine whether or not there exists an ordering of the vertices such that the adjacency matrix has bandwidth
bandwidth
directed bandwidth
linear algorithm
NP-complete problems
optimum permutations
siphonophora
A class of linear algorithms for Volterra Integro-Differential Equations is studied. The concept of the associated canonical fraction is extended to this class and leads to an algebraic criterion forA-stability.
A class of linear algorithms for Volterra Integro-Differential Equations is studied. The concept of the associated canonical fraction is extended to this class and leads to an algebraic criterion forA-stability.
暂无评论