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

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 appli...

Full description

Bibliographic Details
Authors: Lebtahi Ep-Kadi-Hahifi, Leila, Romero Martínez, José Oscar|||0000-0003-4081-9005, Thome, Néstor|||0000-0001-5328-6637
Format: article
Publication Date:2013
Country:España
Institution:Universitat Politècnica de València (UPV)
Repository:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Language:English
OAI Identifier:oai:riunet.upv.es:10251/50960
Online Access:https://riunet.upv.es/handle/10251/50960
Access Level:Open access
Keyword:Potent matrices
Involutory matrices
Linear combinations
Eigenvalues
INGENIERIA TELEMATICA
MATEMATICA APLICADA
Description
Summary: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.