m条对角线的n阶对角矩阵压缩存储的通用寻址公式  

The General Accessing Formula for Pack Storage of n Order Matrix with m Diagonal Lines

作　　者：刘明杰[1] 杨文茂[2] 

机构地区：[1]武汉大学数学计算机科学学院 [2]福建泉州市仰恩大学

出　　处：《计算机与数字工程》2000年第3期1-4,共4页Computer & Digital Engineering

摘　　要：本文将通常数据结构中三对角矩阵压缩存储的寻址公式推广到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.

关 键 词：m条对角线 n阶对角矩阵 通用寻址公式 数据结构 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]