Algorithms for {K, s+1}-potent matrix constructions

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:249

Article

Lebtahi, Leila¹  Romero, Oscar²  Thome, Nestor¹ 

[1] Univ Politecn Valencia, Inst Univ Matemat Multidisciplinar, Valencia 46022, Spain

[2] Univ Politecn Valencia, Dept Comunicac, Valencia 46022, Spain

关键词: Potent matrices;    Involutory matrices;    Linear combinations;    Eigenvalues;   

DOI  :  10.1016/j.cam.2012.01.019

来源: Elsevier

【 摘 要 】

In this paper, we deal with {K, s + 1}-potent matrices. These matrices generalize all the following classes of matrices: k-potent matrices, periodic matrices, idempotent matrices, involutory matrices, centrosymmetric matrices, mirrorsymmetric matrices, circulant matrices, among others. Several applications of these classes of matrices can be found in the literature. We develop algorithms in order to compute {K, s + 1}-potent matrices and {K, s + 1}-potent linear combinations of {K, s + 1}-potent matrices. In addition, some examples are presented in order to show the numerical performance of the method. (C) 2012 Elsevier B.V. All rights reserved.

【 授权许可】

Free