A cogredient Algorithm for the m-th Power of r-Circulant Matrices

被引：2

作者：

Zhao, Guangyuan ^{[1
]}

机构：

[1] Shandong Univ Technol, Coll Comp Sci & Technol, Tai An 255049, Shandong, Peoples R China

来源：

PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT, VOL 2 | 2009年

关键词：

circulant matrix; non singularity; elementary transformation; inverse matrix;

D O I：

10.1109/ICCTD.2009.216

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Let A be an n x n r-Circulant matrices. The r-circulant matrices have wide application in numerical computation, molecular vibration, image process, signal processing, coding theory, low-density parity-check codes and oil investigation etc in recent years. Motivated by 131, in this paper, by using elementary transformation of row and column, we present a fast cogredient algorithm for the m-th power of circulant Matrices, and give a numerical example in order to show the effectiveness of our algorithm finally.

引用

页码：557 / 560

页数：4

共 14 条

[1]

Cline R. E., 1974, Linear Algebra and Its Applications, V8, P25, DOI 10.1016/0024-3795(74)90004-4

[2]

Davis P.J., 1979, Circulant Matrices

[3]

DENG YH, 1995, J HENGYANG NORMAL U, V3, P31

[4]

Horn R., 2005, MATRIX ANAL

[5]

Jiang Jiaqing, 2008, J JIANGXI I ED COMPR, V3, P5

[6]

Jiang Z-L., 1999, Circulant matrices

[7]

JIANG ZL, 2003, NUMERICAL MATH J CHI, V3, P227

[8]

JIANG ZL, 2003, J BAOJI COLL ARTS SC, V23, P5

[9]

JIANG ZL, 1995, MATH PRACTICE THEORY, V2, P52

[10]

LAI YX, 2008, J BAOJI U ARTS SCI N, V24, P262

← 1 2 →