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

Authors:
Leila Lebtahi;íScar Romero;NéStor Thome
Affiliations:
Instituto Universitario de Matemática Multidisciplinar, Universitat Politècnica de València, Camino de Vera s/n, 46022, Valencia, Spain;Departamento de Comunicaciones, Universitat Politècnica de València, Camino de Vera s/n, 46022, Valencia, Spain;Instituto Universitario de Matemática Multidisciplinar, Universitat Politècnica de València, Camino de Vera s/n, 46022, Valencia, Spain
Venue:
Journal of Computational and Applied Mathematics
Year:
2013

Citing 4
Cited 0

On the reducibility of centrosymmetric matrices—applications in engineering problems

Circuits, Systems, and Signal Processing
Mirrorsymmetric Matrices, Their Basic Properties, and an Application on Odd/Even-Mode Decomposition of Symmetric Multiconductor Transmission Lines

SIAM Journal on Matrix Analysis and Applications
A Spectral Characterization of Generalized Real Symmetric Centrosymmetric and Generalized Real Symmetric Skew-Centrosymmetric Matrices

SIAM Journal on Matrix Analysis and Applications
Matrix Analysis

Matrix Analysis

Quantified Score

Hi-index	7.29

Visualization

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.