0000000000546181
AUTHOR
Néstor Thome
showing 17 related works from this author
A note on k-generalized projections
2007
Abstract In this note, we investigate characterizations for k -generalized projections (i.e., A k = A ∗ ) on Hilbert spaces. The obtained results generalize those for generalized projections on Hilbert spaces in [Hong-Ke Du, Yuan Li, The spectral characterization of generalized projections, Linear Algebra Appl. 400 (2005) 313–318] and those for matrices in [J. Benitez, N. Thome, Characterizations and linear combinations of k -generalized projectors, Linear Algebra Appl. 410 (2005) 150–159].
Properties of a matrix group associated to a {K,s+1}-potent matrix
2012
In a previous paper, the authors introduced and characterized a new kind of matrices called {K,s+1}-potent. In this paper, an associated group to a {K, s+1}-potent matrix is explicitly constructed and its properties are studied. Moreover, it is shown that the group is a semidirect product of Z_2 acting on Z_{(s+1)^2-1}. For some values of s, more specifications on the group are derived. In addition, some illustrative examples are given.
The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem
2016
The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.
The diamond partial order in rings
2013
In this paper we introduce a new partial order on a ring, namely the diamond partial order. This order is an extension of a partial order defined in a matrix setting in [J.K. Baksalary and J. Hauke, A further algebraic version of Cochran's theorem and matrix partial orderings, Linear Algebra and its Applications, 127, 157--169, 1990]. We characterize the diamond partial order on rings and study its relationships with other partial orders known in the literature. We also analyze successors, predecessors and maximal elements under the diamond order.
Inverse eigenvalue problem for normal J-hamiltonian matrices
2015
[EN] A complex square matrix A is called J-hamiltonian if AT is hermitian where J is a normal real matrix such that J(2) = -I-n. In this paper we solve the problem of finding J-hamiltonian normal solutions for the inverse eigenvalue problem. (C) 2015 Elsevier Ltd. All rights reserved.
Spectral study of {R,s+1,k}- and {R,s+1,k,∗}-potent matrices
2020
Abstract The { R , s + 1 , k } - and { R , s + 1 , k , ∗ } -potent matrices have been studied in several recent papers. We continue these investigations from a spectral point of view. Specifically, a spectral study of { R , s + 1 , k } -potent matrices is developed using characterizations involving an associated matrix pencil ( A , R ) . The corresponding spectral study for { R , s + 1 , k , ∗ } -potent matrices involves the pencil ( A ∗ , R ) . In order to present some properties, the relevance of the projector I − A A # where A # is the group inverse of A is highlighted. In addition, some applications and numerical examples are given, particularly involving Pauli matrices and the quaterni…
Further results on generalized centro-invertible matrices
2019
[EN] This paper deals with generalized centro-invertible matrices introduced by the authors in Lebtahi et al. (Appl. Math. Lett. 38, 106¿109, 2014). As a first result, we state the coordinability between the classes of involutory matrices, generalized centro-invertible matrices, and {K}-centrosymmetric matrices. Then, some characterizations of generalized centro-invertible matrices are obtained. A spectral study of generalized centro-invertible matrices is given. In addition, we prove that the sign of a generalized centro-invertible matrix is {K}-centrosymmetric and that the class of generalized centro-invertible matrices is closed under the matrix sign function. Finally, some algorithms ha…
Special elements in a ring related to Drazin inverses
2013
In this paper, the existence of the Drazin (group) inverse of an element a in a ring is analyzed when amk = kan, for some unit k and m; n 2 N. The same problem is studied for the case when a* = kamk-1 and for the fk; s+1g-potent elements. In addition, relationships with other special elements of the ring are also obtained
Generalized centro-invertible matrices with applications
2014
Centro-invertible matrices are introduced by R.S. Wikramaratna in 2008. For an involutory matrix R, we define the generalized centro-invertible matrices with respect to R to be those matrices A such that RAR = A^−1. We apply these matrices to a problem in modular arithmetic. Specifically, algorithms for image blurring/deblurring are designed by means of generalized centro-invertible matrices. In addition, if R1 and R2 are n × n involutory matrices, then there is a simple bijection between the set of all centro-invertible matrices with respect to R1 and the set with respect to R2.
Matrices A such that A^{s+1}R = RA* with R^k = I
2018
[EN] We study matrices A is an element of C-n x n such that A(s+1)R = RA* where R-k = I-n, and s, k are nonnegative integers with k >= 2; such matrices are called {R, s+1, k, *}-potent matrices. The s = 0 case corresponds to matrices such that A = RA* R-1 with R-k = I-n, and is studied using spectral properties of the matrix R. For s >= 1, various characterizations of the class of {R, s + 1, k, *}-potent matrices and relationships between these matrices and other classes of matrices are presented. (C) 2018 Elsevier Inc. All rights reserved.
Characterizations of {K,s+1}-Potent Matrices and Applications
2012
Recently, situations where a matrix coincides with some of its powers have been studied. This kind of matrices is related to the generalized inverse matrices. On the other hand, it is possible to introduce another class of matrices that involve an involutory matrix, generalizing the well-known idempotent matrix, widely useful in many applications. In this paper, we introduce a new kind of matrices called {K,s+1}-potent, as an extension of the aforementioned ones. First, different properties of {K,s+1}-potent matrices have been developed. Later, the main result developed in this paper is the characterization of this kind of matrices from a spectral point of view, in terms of powers of the ma…
On a matrix group constructed from an {R,s+1,k}-potent matrix
2014
Let R is an element of C-nxn be a {k}-involutory matrix (that is, R-k = I-n) for some integer k >= 2, and let s be a nonnegative integer. A matrix A is an element of C-nxn is called an {R,s + 1, k}-potent matrix if A satisfies RA = A(s+1)R. In this paper, a matrix group corresponding to a fixed {R,s + 1, k}-potent matrix is explicitly constructed, and properties of this group are derived and investigated. This group is then reconciled with the classical matrix group G(A) that is associated with a generalized group invertible matrix A.
Spectral study of {R, s + 1, k}- and {R, s + 1, k, *}-potent matrices
2020
[EN] The {R, s +1, k}- and {R, s +1, k, *}-potent matrices have been studied in several recent papers. We continue these investigations from a spectral point of view. Specifically, a spectral study of {R, s + 1, k} -potent matrices is developed using characterizations involving an associated matrix pencil (A, R). The corresponding spectral study for {R, s+ 1, k, *}-potent matrices involves the pencil (A*, R). In order to present some properties, the relevance of the projector I - AA(#). where A(#) is the group inverse of A is highlighted. In addition, some applications and numerical examples are given, particularly involving Pauli matrices and the quaternions.
Algorithms for solving the inverse problem associated with KAK =A^(s+1)
2017
In previous papers, the authors introduced and characterized a class of matrices called {K,s+1}-potent. Also, they established a method to construct these matrices. The purpose of this paper is to solve the associated inverse problem. Several algorithms are developed in order to find all involutory matrices K satisfying K A^(s+1) K = A for a given matrix A∈C^(n×n) and a given natural number s. The cases s=0 and s≥ are separately studied since they produce different situations. In addition, some examples are presented showing the numerical performance of the methods.
Relations between {K, s + 1}-potent matrices and different classes of complex matrices
2013
In this paper, {K,s+1}-potent matrices are considered. A matrix A∈C^(n×n) is called {K,s+1}-potent when K A^(s+1) K = A where K is an involutory matrix and s∈{1,2,3,¿}. Specifically, {K,s+1}-potent matrices are analyzed considering their relations to different classes of complex matrices. These classes of matrices are: {s+1}-generalized projectors, {K}-Hermitian matrices, normal matrices, and matrices B∈C^(n×n) (anti-)commuting with K or such that KB is involutory, Hermitian or normal. In addition, some new relations for K-generalized centrosymmetric matrices have been derived.
Algorithms for {K, s+1}-potent matrix constructions
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. (C) 2012 Elsevier B.V. All rights reserved.
Matrices A such that R A = A^{s + 1} R when R^k = I
2013
This paper examines matrices A∈C^(n×n) such that R A = A^(s+1) R where R^k = I, the identity matrix, and where s and k are nonnegative integers with k⩾2. Spectral theory is used to characterize these matrices. The cases s = 0 and s⩾1 are considered separately since they are analyzed by different techniques.