Algorithms for {K, s+1}-potent matrix constructions
NAGIOS: RODERIC FUNCIONANDO

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

Repositori DSpace/Manakin

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

Mostra el registre complet de l'element

Visualització       (407.0Kb)

Exportar a Refworks
    
Lebtahi, Leila; Romero, Óscar; Thome, Néstor
Aquest document és un/a article, creat/da en: 2013
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.

    Lebtahi, Leila Romero, Óscar Thome, Néstor 2013 Algorithms for {K, s+1}-potent matrix constructions Journal of Computational and Applied Mathematics 249 157 162
http://dx.doi.org/10.1016/j.cam.2012.01.019
distribuït sota llicència Creative Commons de Reconeixement-NoComercial 3.0 No adaptada

Aquest element apareix en la col·lecció o col·leccions següent(s)

Mostra el registre complet de l'element

Cerca a RODERIC

Cerca avançada

Visualitza

Estadístiques