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

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

DSpace Repository

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

Show full item record

View       (407.0Kb)

    
Lebtahi, Leila; Romero, Óscar; Thome, Néstor
This document is a artículoDate2013

Este documento está disponible también en : http://hdl.handle.net/10550/57746
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

This item appears in the following Collection(s)

Show full item record

Search DSpace

Advanced Search

Browse

Statistics