摘要
本文将通常数据结构中三对角矩阵压缩存储的寻址公式推广到m对角矩阵(具有m条对角线的n(>m)阶矩阵)的情况,得到了新的一般寻址公式。同时指出文献[2]中关于这个问题所给出的公式是错误的。并用具体例子加以说明。
In this paper we discuss the problem in data structure. We extend the general accessing formula for pack storage from tridiagonal matrix to m - diagonal matrix of n order (m = the number of diagonal;n> m) , which leads to another new general accessing formula. As a result,it is proven that the formula offered by references [2] on this problem is erroneous. Here detailed examples are given to explain it.
出处
《计算机与数字工程》
2000年第3期1-4,共4页
Computer & Digital Engineering
