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 simple item record

dc.contributor.author Lebtahi, Leila
dc.contributor.author Romero, Óscar
dc.contributor.author Thome, Néstor
dc.date.accessioned 2017-03-21T18:31:59Z
dc.date.available 2017-03-21T18:31:59Z
dc.date.issued 2013
dc.identifier.uri http://hdl.handle.net/10550/57746
dc.description.abstract 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.
dc.language.iso eng
dc.relation.ispartof Journal of Computational and Applied Mathematics, 2013, vol. 249, p. 157-162
dc.rights.uri info:eu-repo/semantics/openAccess
dc.source 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
dc.subject Matrius (Matemàtica)
dc.subject Matemàtica aplicada
dc.title Algorithms for {K, s+1}-potent matrix constructions
dc.type info:eu-repo/semantics/article
dc.date.updated 2017-03-21T18:31:59Z
dc.identifier.doi http://dx.doi.org/10.1016/j.cam.2012.01.019
dc.identifier.idgrec 114148

View       (407.0Kb)

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search

Browse

Statistics