Pasar al contenido principal

RED TEMATICA DE ALGEBRA LINEAL, ANALISIS MATRICIAL Y APLICACIONES

MTM2017-90682-REDT

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Redes Investigación /Redes Excelencia
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 59
Encontrada(s) 1 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Quadratic realizability of palindromic matrix polynomials

  • Terán Vergara, Fernando de
  • Martínez Dopico, Froilán César
  • Mackey, D. Steven
  • Perović, Vasilije
Let L = (L-1 , L-2) be a list consisting of a sublist L(1 )of powers of irreducible (monic) scalar polynomials over an algebraically closed field F, and a sublist L-2 of nonnegative integers. For an arbitrary such list L, we give easily verifiable necessary and sufficient conditions for L to be the list of elementary divisors and minimal indices of some T-palindromic quadratic matrix polynomial with entries in the field F. For L satisfying these conditions, we show how to explicitly construct a T-palindromic quadratic matrix polynomial having L as its structural data; that is, we provide a T-palindromic quadratic realization of L. Our construction of T-palindromic realizations is accomplished by taking a direct sum of low bandwidth T-palindromic blocks, closely resembling the Kronecker canonical form of matrix pencils. An immediate consequence of our in-depth study of the structure of T-palindromic quadratic polynomials is that all even grade T-palindromic matrix polynomials have a T-palindromic strong quadratification. Finally, using a particular Mobius transformation, we show how all of our results can be easily extended to quadratic matrix polynomials with T-even structure.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

A comparison of eigenvalue condition numbers for matrix polynomials

  • Anguas Márquez, Luis Miguel
  • Bueno Cachadiña, María Isabel
  • Martínez Dopico, Froilán César
In this paper, we consider the different condition numbers for simple eigenvalues of matrix polynomials used in the literature and we compare them. One of these condition numbers is a generalization of the Wilkinson condition number for the standard eigenvalue problem. This number has the disadvantage of only being defined for finite eigenvalues. In order to give a unified approach to all the eigenvalues of a matrix polynomial, both finite and infinite, two (homogeneous) condition numbers have been defined in the literature. In their definition, very different approaches are used. One of the main goals of this note is to show that, when the matrix polynomial has a moderate degree, both homogeneous condition numbers are essentially the same and one of them provides a geometric interpretation of the other. We also show how the homogeneous condition numbers compare with the "Wilkinson-like" eigenvalue condition number and how they extend this condition number to zero and infinite eigenvalues. .
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Tesis doctoral (DoctoralThesis)

Linearizations of rational matrices

  • Quintana Ponce, María del Carmen
Mención Internacional en el título de doctor, This PhD thesis belongs to the area of Numerical Linear Algebra. Specifically, to the numerical solution of the Rational Eigenvalue Problem (REP). This is a type of eigenvalue problem associated with rational matrices, which are matrices whose entries are rational functions. REPs appear directly from applications or as approx imations to arbitrary Nonlinear Eigenvalue Problems (NLEPs). Rational matrices also appear in linear systems and control theory, among other applications. Nowa days, a competitive method for solving REPs is via linearization. This is due to the fact that there exist backward stable and efficient algorithms to solve the linearized problem, which allows to recover the information of the original rational problem. In particular, linearizations transform the REP into a generalized eigenvalue pro blem in such a way that the pole and zero information of the corresponding rational matrix is preserved. To recover the pole and zero information of rational matrices, it is fundamental the notion of polynomial system matrix, introduced by Rosenbrock in 1970, and the fact that rational matrices can always be seen as transfer functions of polynomial system matrices. This thesis addresses different topics regarding the problem of linearizing REPs. On the one hand, one of the main objectives has been to develop a theory of li nearizations of rational matrices to study the properties of the linearizations that have appeared so far in the literature in a general framework. For this purpose, a definition of local linearization of rational matrix is introduced, by developing as starting point the extension of Rosenbrock’s minimal polynomial system matrices to a local scenario. This new theory of local linearizations captures and explains rigor ously the properties of all the different linearizations that have been used from the 1970’s for computing zeros, poles and eigenvalues of rational matrices. In particu lar, this theory has been applied to a number of pencils that have appeared in some influential papers on solving numerically NLEPs through rational approximation. On the other hand, the work has focused on the construction of linearizations of rational matrices taking into account different aspects. In some cases, we focus on preserving particular structures of the corresponding rational matrix in the li nearization. The structures considered are symmetric (Hermitian), skew-symmetric (skew-Hermitian), among others. In other cases, we focus on the direct construc tion of the linearizations from the original representation of the rational matrix. The representations considered are rational matrices expressed as the sum of their polynomial and strictly proper parts, rational matrices written as general trans fer function matrices, and rational matrices expressed by their Laurent expansion around the point at infinity. In addition, we describe the recovery rules of the information of the original rational matrix from the information of the new lineari zations, including in some cases not just the zero and pole information but also the information about the minimal indices. Finally, in this dissertation we tackle one of the most important open problems related to linearizations of rational matrices. That is the analysis of the backward stability for solving REPs by running a backward stable algorithm on a linearization. On this subject, a global backward error analysis has been developed by considering the linearizations in the family of “block Kronecker linearizations”. An analysis of this type had not been developed before in the literature., Este trabajo ha sido desarrollado en el Departamento de Matemáticas de la Universidad Carlos III de Madrid (UC3M) bajo la dirección del profesor Froilán Martínez Dopico y codirección de la profesora Silvia Marcaida Bengoechea. Se contó durante cuatro años con un contrato predoctoral FPI, referencia BES-2016-076744, asociado al proyecto ALGEBRA LINEAL NUMERICA ESTRUCTURADA PARA MATRICES CONSTANTES, POLINOMIALES Y RACIONALES, referencia MTM2015-65798-P, del Ministerio de Economía y Competitividad, y cuyo investigador principal fue Froilán Martínez Dopico. Asociado a este contrato, se contó con una ayuda para realizar parte de este trabajo durante dos es tancias internacionales de investigación. La primera estancia de investigación se realizó del 30 de enero de 2019 hasta el 1 de marzo de 2019 en el Department of Mathematical En gineering, Université catholique de Louvain (Bélgica), bajo la supervisión del profesor Paul Van Dooren. La segunda estancia de investigación se realizó del 15 de septiembre de 2019 hasta el 19 de noviembre de 2019 en el Department of Mathematical Sciences, University of Montana (EEUU), bajo la supervisión del profesor Javier Pérez Alvaro. Dado que la entidad beneficiaria del contrato predoctoral es la UC3M mientras que el otro codirector de tesis, la profesora Silvia Marcaida Bengoechea, pertenece al Departamento de Matemáticas de la Universidad del País Vasco (UPV/EHU), el trabajo con la profesora Silvia Marcaida se reforzó mediante visitas a la UPV/EHU, financiadas por ayudas de la RED temática de Excelencia ALAMA (Algebra Lineal, Análisis Matricial y Aplicaciones) asociadas al los proyectos MTM2015-68805-REDT y MTM2017-90682-REDT., Programa de Doctorado en Ingeniería Matemática por la Universidad Carlos III de Madrid, Presidente: Ion Zaballa Tejada.- Secretario: Fernando de Terán Vergara.- Vocal: Vanni Noferini
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Tesis doctoral (DoctoralThesis)

Polynomial and rational spectral problems: conditioning, backward errors and inverse problems

  • Anguas Márquez, Luis Miguel
Mención Internacional en el título de doctor, This PhD thesis belongs to the areas of Matrix Analysis and Numerical Linear Algebra and has been devoted to solve problems that have arisen as a consequence of the development of new applications during the last two decades. More precisely, these problems belong to two related areas: polynomial eigenvalue problems (PEPs) and rational eigenvalue problems (REPs). Due to the mentioned recent interest into the numerical solution of the PEP, several condition numbers for simple eigenvalues of regular matrix polynomials have appeared in the literature. In order to study the conditioning of all the eigenvalues of a matrix polynomial in a unified framework, some of these eigenvalue condition numbers consider the matrix polynomial to be expressed in homogeneous form. Then, the first problem we address in the field of matrix polynomials is to obtain a relationship between the two main homogeneous eigenvalue condition numbers that have appeared in the literature. Furthermore, we also obtain a relationship between the non-homogeneous and the former homogeneous eigenvalue condition numbers. This latter relationship allows to extend results that have been proved for one of the versions of the eigenvalue condition numbers to the other. We also obtain a relationship between the homogeneous and the non-homogeneous backward errors of approximate eigenpairs that states they are essentially equivalent. Möbius transformations is a classical tool that have been used in the theory of matrix polynomials (and in their applications) since, at least, the 1950s. One of the main use of these transformations is to convert a polynomial eigenvalue problem into another that can be solved more easily. If the numerical solution of a problem is obtained by applying a Möbius transformation, an important question is to study if this transformation worsen the conditioning of the problem and/or the backward errors of the approximate solutions. In this dissertation, we present for the first time, up to our concern, a general study of the effect of Möbius transformations on the eigenvalue condition numbers and backward errors of approximate eigenpairs of matrix polynomials. The study of the effect of Möbius transformations on eigenvalue condition numbers and backward errors of approximate eigenpairs is separated in two parts: one for the homogeneous and another for the non-homogeneous version of these magnitudes. Since the homogeneous formulation allows us to obtain two clear and simple results, we perform this analysis first on the homogeneous case. We prove that for any matrix polynomial and any simple eigenvalue, if the matrix that induces the Möbius transformation is well conditioned, then the transformation approximately preserves the homogeneous eigenvalue condition numbers and backward errors of approximate eigenpairs when small perturbations of the matrix polynomial relative to the norm of the whole polynomial are considered in the definition of both the condition number and the backward error. If in the definition of the former magnitudes, perturbations in each coefficient of the matrix polynomial are small relative to the norm of that coefficient, well-conditioned matrices induce Möbius transformations that approximately preserve the eigenvalue condition numbers and backward errors of approximate eigenpairs only if a factor that depends on the norm of the coefficients of the polynomial is moderate. For the non-homogeneous versions of the eigenvalue condition number, the conclusions obtained are not so simple. Nevertheless, we present sufficient conditions depending not only on the conditioning of the matrix that induces the Möbius transformation, but also on the eigenvalue and the corresponding eigenvalue of the Möbius transform. In order to perform this analysis, we use the study realized for the homogeneous case and the relationship obtained between the homogeneous and the non-homogeneous eigenvalue condition numbers. Furthermore, the relationship between the homogeneous and the non-homogeneous backward error of approximate eigenpairs allows us to conclude that the effect of Möbius transformations is the same in the homogeneous and the non-homogeneous backward errors. We also address the problems of degree-preserving quasi-triangularization of matrix polynomials and inverse quasi-triangularization. These two problems have already been studied in the literature by Taslaman, Tisseur and Zaballa in 2013, but only for matrix polynomials de_ned over algebraically closed fields or R. In this dissertation we find preserving degree quasi-triangularizations of regular matrix polynomials defined over an arbitrary field, that is, for a given matrix polynomial P(λ), we build a block upper triangular matrix polynomial Q(λ) that is unimodularly equivalent to P(λ) and has the same size and the same degree as P(λ), as well as the same finite and infinite elementary divisors. The maximum size of the blocks of the obtained matrix polynomial Q(λ) is the maximum degree of the irreducible factors of the invariant polynomials of P(λ). Furthermore, we prove that given a list of prescribed data (including possibly infinite elementary divisors), we can find a quasi-triangular matrix polynomial of given degree d and size n×n that realizes that list and such that the maximum size of the blocks does not exceed the maximum degree of the irreducible factors of the prescribed invariant polynomials if and only if dn is equal to the sum of the degrees of the invariant polynomials and the infinite elementary divisors (if any). The rational matrices problem that we study in this PhD thesis (which has been settled recently for matrix polynomials by De Terán, Dopico and Van Dooren in 2015) consists of funding a necessary and sufficient condition for the existence of a rational matrix that realizes a prescribed complete list of structural data (finite and infinite zeros and poles together with their structural indices and the minimal indices of left and right rational nullspaces). This necessary and sufficient condition is that these data satisfy a fundamental relation appearing in Van Dooren's Index Sum Theorem., Este trabajo ha sido desarrollado en el Departamento de Matemáticas de la Universidad Carlos III de Madrid (UC3M) bajo la dirección del profesor Froilán Martínez Dopico. Se contó durante cuatro años con un contrato predoctoral FPI, referencia BES-2013-065688, asociado al proyecto MTM2012- 32542, del Ministerio de Economía y Competitividad, y cuyo investigador principal fue Froilán Martínez Dopico. Gracias a este contrato, se contó con dos ayudas para realizar parte de este trabajo durante sendas estancias de investigación. La primera estancia de investigación se realizó en el Department of Mathematics de la Western Michigan University (EEUU), bajo la supervisión del profesor D. Steven Mackey. Dicha estancia fue financiada por el programa “Ayudas a la movilidad predoctoral para la realización de estancias breves en centros de I+D”, referencia EEBB-I-16-11462, del Ministerio de Economíıa y Competitividad. La segunda estancia de investigación se realizó en el Department of Mathematics de la University of California at Santa Barbara (EEUU), bajo la supervisión de la profesora María Isabel Bueno. Dicha estancia fue financiada por el programa “Ayudas a la movilidad predoctoral para la realización de estancias breves en centros de I+D”, referencia EEBB-I-18-13037, del Ministerio de Economía y Competitividad. Además, se recibióo ayuda parcial de los proyectos de investigación: “Structured Numerical Linear Algebra: Matrix Polynomials, Special Matrices, and Conditioning” (Ministerio de Economía y Competitividad, Número de proyecto: MTM2012-32542, IP: F. M. Dopico), “Structured Numerical Linear Algebra for Constant, Polynomial and Rational Matrices” (Ministerio de Economía y Competitividad de España, Número de proyecto: MTM2015- 65798-P, IP: F. M. Dopico) y los proyectos de investigación de la red temática ALAMA (Ministerio de Economía y Competitividad, Números de proyectos: MTM2015-68805-REDT, IP: I. Zaballa, y MTM2017-90682-REDT, IP: J. Mas)., Programa de Doctorado en Ingeniería Matemática por la Universidad Carlos III de Madrid, Presidente: Paul Van Dooren.- Secretario: Fernando de Terán Vergara.- Vocal: Ion Zaballa Tejada
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems

  • Martínez Dopico, Froilán César
  • Marcaida, Silvia
  • Quintana Ponce, María del Carmen
  • Van Dooren, Paul
This paper presents a definition for local linearizations of rational matrices and studies their properties. This definition allows to introduce matrix pencils associated to a rational matrix that preserve its structure of zeros and poles in subsets of any algebraically closed field and also at infinity. This new theory of local linearizations captures and explains rigorously the properties of all the different pencils that have been used from the 1970's until 2020 for computing zeros, poles and eigenvalues of rational matrices. Particular attention is paid to those pencils that have appeared recently in the numerical solution of nonlinear eigenvalue problems through rational approximation.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Block Kronecker linearizations of matrix polynomials and their backward errors

  • Martínez Dopico, Froilán César
  • Lawrence, Piers W.
  • Van Dooren, Paul
  • Perez, Javier
We introduce a new family of strong linearizations of matrix polynomialswhich we call block Kronecker pencilsand perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any backward stable algorithm to a block Kronecker pencil, such as the staircase algorithm for singular pencils or the QZ algorithm for regular pencils. This stability analysis allows us to identify those block Kronecker pencils that yield a computed complete eigenstructure which is exactly that of a slightly perturbed matrix polynomial. The global backward error analysis in this work presents for the first time the following key properties: it is a rigorous analysis valid for finite perturbations (i.e., it is not a first order analysis), it provides precise bounds, it is valid simultaneously for a large class of linearizations, and it establishes a framework that may be generalized to other classes of linearizations. These features are related to the fact that block Kronecker pencils are a particular case of the new family of strong block minimal bases pencils, which are robust under certain perturbations and, so, include certain perturbations of block Kronecker pencils., This work was partially supported by the “Ministerio de Economía, Industria y Competitividad of Spain” and “Fondo Europeo de Desarrollo Regional (FEDER) of EU” through Grants MTM-2012-32542, MTM-2015-68805-REDT, MTM-2015-65798-P, MTM2017-90682-REDT, by the Belgian network DYSCO (Dynamical Systems, Control, and Optimization), funded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office, and by the Engineering and Physical Sciences Research Council of UK through Grant EP/I005293.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis

  • Martínez Dopico, Froilán César
  • Marcaida, Silvia
  • Quintana Ponce, María del Carmen
We construct a new family of strong linearizations of rational matrices considering the polynomial part of them expressed in a basis that satisfies a three term recurrence relation. For this purpose, we combine the theory developed by Amparan et al. (2018), and the new linearizations of polynomial matrices introduced by Fa(sic)bender and Saltenberger (2017). In addition, we present a detailed study of how to recover eigenvectors of a rational matrix from those of its linearizations in this family. We complete the paper by discussing how to extend the results when the polynomial part is expressed in other bases, and by presenting strong linearizations that preserve the structure of symmetric or Hermitian rational matrices. A conclusion of this work is that the combination of the results in this paper with those in Amparan et al. (2018), allows us to use essentially all the strong linearizations of polynomial matrices developed in the last fifteen years to construct strong linearizations of any rational matrix by expressing such a matrix in terms of its polynomial and strictly proper parts.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Van Dooren's Index Sum Theorem and Rational Matrices with Prescribed Structural Data

  • Anguas Márquez, Luis Miguel
  • Martínez Dopico, Froilán César
  • Hollister, Richard
  • Mackey, Don Steven
The structural data of any rational matrix R(\lambda ), i.e., the structural indices of its poles and zeros together with the minimal indices of its left and right nonespaces, is known to satisfy a simple condition involving certain sums of these indices. This fundamental constraint was first proved by Van Dooren in 1978; here we refer to this result as the rational index sum theorem. An analogous result for polynomial matrices has been independently discovered (and rediscovered) several times in the past three decades. In this paper we clarify the connection between these two seemingly different index sum theorems, describe a little bit of the history of their development, and discuss their curious apparent unawareness of each other. Finally, we use the connection between these results to solve a fundamental inverse problem for rational matrices---for which lists \scrL of prescribed structural data does there exist some rational matrix R(\lambda ) that realizes exactly the list \scrL ? We show that Van Dooren's condition is the only constraint on rational realizability; that is, a list \scrL is the structural data of some rational matrix R(\lambda ) if and only if \scrL satisfies the rational index sum condition.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

A compact rational Krylov method for large-scale rational eigenvalue problems

  • Martínez Dopico, Froilán César
  • González Pizarro, Javier Andrés
In this work, we propose a new method, termed as R-CORK, for the numerical solution of large-scale rational eigenvalue problems, which is based on a linearization and on a compact decomposition of the rational Krylov subspaces corresponding to this linearization. R-CORK is an extension of the compact rational Krylov method (CORK) introduced very recently in the literature to solve a family of nonlinear eigenvalue problems that can be expressed and linearized in certain particular ways and which include arbitrary polynomial eigenvalue problems, but not arbitrary rational eigenvalue problems. The R-CORK method exploits the structure of the linearized problem by representing the Krylov vectors in a compact form in order to reduce the cost of storage, resulting in a method with two levels of orthogonalization. The first level of orthogonalization works with vectors of the same size as the original problem, and the second level works with vectors of size much smaller than the original problem. Since vectors of the size of the linearization are never stored or orthogonalized, R-CORK is more efficient from the point of view of memory and orthogonalization than the classical rational Krylov method applied directly to the linearization. Taking into account that the R-CORK method is based on a classical rational Krylov method, to implement implicit restarting is also possible, and we show how to do it in a memory-efficient way. Finally, some numerical examples are included in order to show that the R-CORK method performs satisfactorily in practice.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Conditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformations

  • Anguas Márquez, Luis Miguel
  • Bueno Cachadiña, María Isabel
  • Martínez Dopico, Froilán César
We present the first general study on the effect of Möbius transformations on the eigenvalue condition numbers and backward errors of approximate eigenpairs of polynomial eigenvalue problems (PEPs). By usingthe homogeneous formulation of PEPs, we are able to obtain two clear andsimple results. First, we show that if the matrix inducing the Möbius transformation is well-conditioned, then such transformation approximately preservesthe eigenvalue condition numbers and backward errors when they are definedwith respect to perturbations of the matrix polynomial which are small relativeto the norm of the whole polynomial. However, if the perturbations in eachcoefficient of the matrix polynomial are small relative to the norm of that coefficient, then the corresponding eigenvalue condition numbers and backwarderrors are preserved approximately by the Möbius transformations induced bywell-conditioned matrices only if a penalty factor, depending on the norms ofthose matrix coefficients, is moderate. It is important to note that these simple results are no longer true if a non-homogeneous formulation of the PEP isused.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Conmutatividad de matrices con sus inversas generalizadas

  • Ferreyra, D. E.
  • Levis, F. E.
  • Priori, A. N.
  • Thome, Néstor|||0000-0001-5328-6637
Este trabajo ha sido parcialmente subvencionado por Universidad Nacional de Río Cuarto (PPI 18/C559), Universidad Nacional del Sur (24/L108), Universidad Nacional de La Pampa, Facultad de Ingeniería (Resol. Nro. 135/19), CONICET (PIP 112-201501-00433CO), ANPCyT (PICT 2018-03492) y Ministerio de Economía, Industria y Competitividad of Spain (Grant Red de Excelencia MTM2017-90682-REDT)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

From projectors to 1MP and MP1 generalized inverses and their induced partial orders

  • Hernández, M. V.
  • Lattanzi, M. B.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper deals with new generalized inverses of rectangular complex matrices, namely 1MP and MP1-inverses. They are constructed from oblique projectors represented by means of inner generalized inverses, by using an adequate equivalence relation, and then passing to the quotient set. We give characterizations and general expressions for 1MP and MP1-inverses. As applications, the binary relations induced for these new generalized inverses are proved to be partial orders., M. V. Hernández and M. B. Lattanzi: Partially supported by Universidad Nacional de La Pampa, Facultad de Ingeniería (Grant Resol. Nro. 135/19). N. Thome: Partially supported by Universidad Nacional de La Pampa, Facultad de Ingeniería (Grant Resol. Nro. 135/19), by Ministerio de Economía y Competitividad of Spain (grant Red de Excelencia MTM2017-90682-REDT), by Universidad Nacional del Sur of Argentina (Grant PGI 24/L108), and by Universidad Nacional de Río Cuarto (Grant Res. Nro. 083/2020).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Further results on generalized centro-invertible matrices

  • Lebtahi Ep-Kadi-Hahifi, Leila
  • Romero Martínez, José Oscar|||0000-0003-4081-9005
  • Thome, Néstor|||0000-0001-5328-6637
[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 have been developed for the construction of generalized centro-invertible matrices, This paper was partially supported by Ministerio de Economia y Competitividad of Spain (Grant number DGI MTM2013-43678-P and Grant Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

CÁLCULO DE LAS INVERSAS GD Y GDMP

  • Hernández, María Valeria
  • Lattanzi, Marina B.
  • Thome, Néstor|||0000-0001-5328-6637
[ES] En este trabajo se presenta un algoritmo para calcular las inversas generalizadas GD (introducidas en H.X.Wang, X.J. Liu, Partial orders based on core-nilpotent decomposition, Linear Algebra and its applications, 488, 235-248, 2016) y las inversas generalizadas GDMP (definidas por los autores en GDMP-inverses of a matrix and their duals, Linear and Multilinear Algebra, DOI: 10.1080/03081087.2020.1857678)., Parcialmente subvencionado por Universidad Nacional de La Pampa, Facultad de Ingeniería (Resol. Nro. 135/19), Ministerio de Economía, Industria y Competitividad de España (Red de Excelencia MTM2017-90682-REDT) y Universidad Nacional de Río Cuarto (PPI 18/C559)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Clases maximales que representan la inversa BT

  • Ferreyra, David
  • Orquera, V.
  • Thome, Néstor|||0000-0001-5328-6637
[ES] El principal objetivo de este trabajo es dar representaciones mediante clases maximales que permitan representar la inversa generalizada BT, introducida por Baksalary y Trenkler en 2014, utilizando la descomposición de Hartwig-Spindelböck., Este trabajo ha sido parcialmente subsidiado por los proyectos PPI 18/C472 de la Universidad Nacional de Río Cuarto, PIP 112-201501-00433CO de CONICET, Red de Excelencia MTM2017-90682-REDT del Ministerio de Economía, Industria y Competitividad de España.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Weak group inverses and partial isometries in proper *-rings

  • Zhou, Mengmeng
  • Chen, Jianlong
  • Zhou, Yukun
  • Thome, Néstor|||0000-0001-5328-6637
[EN] A weak group element is introduced in a proper ¿-ring. Several equivalent conditions of weak group elements are investigated. We prove that an element is pseudo core invertible if it is both partial isometry and weak group invertible. Reverse order law and additive property of the weak group inverse are presented. Finally, under certain assumption on a, equivalent conditions of aW a¿ = a¿aW are presented by using the normality of the group invertible part of an element in its group-EP decomposition, This research was supported by the National Natural Science Foundation of China (No. 11771076, 11871145), the Postgraduate Research and Practice Innovation Program of Jiangsu Province (No. KYCX18¿0053), the China Scholarship Council (File No. 201906090122), the Qing Lan Project of Jiangsu Province. The fourth author was partially supported by Ministerio de Economía y Competitividad of Spain (grant Red de Excelencia MTM2017-90682-REDT) and by Universidad Nacional de Río Cuarto, Argentina, Res. Rectoral N 083/2020.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Maximal classes of matrices determining generalized inverses

  • Ferreyra, David Eduardo
  • Levis, Fabian
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper derives some further results on recent generalized inverses studied in the literature, namely core EP, DMP, and CMP inverses. Our main aim is to develop maximal classes of matrices for which their representations remain valid. (C) 2018 Elsevier Inc. All rights reserved., Partially supported by a CONICET's Posdoctoral Research Fellowship, UNRC (grant PPI 18/C472) and CONICET (grant PIP 112-201501-00433CO). Partially supported by Ministerio de Economia y Competitividad of Spain (Grants DGI MTM2013-43678-P and Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Sobre el orden parcial grupo para matrices complejas

  • Rueda, Laura
  • Thome, Néstor|||0000-0001-5328-6637
[ES] En este trabajo se estudian los segmentos decrecientes del conjunto de matrices complejas, de índice a lo sumo 1, ordenado por la relación de orden grupo., Este trabajo fue parcialmente subvencionado por Universidad Nacional de La Pampa, Facultad de Ingenieria (Resol. Nro. 135/19), Universidad Nacional del Sur (24/L108). El segundo autor fue parcialmente subvencionado por Ministerio de Economia, Industria y Competitividad de España (Red de Excelencia (MTM2017-90682-REDT) y Universidad Nacional de Rio Cuarto (PPI 18/C559).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Combined matrices and conditioning

  • Bru García, Rafael
  • Gasso Matoses, María Teresa
  • Santana-De Asis, Máximo De Jesús
[EN] In this work, we study a lower bound of the condition number of a matrix by its combined matrix. In particular, we construct a special combined matrix in such a way that the sums of its columns are lower bounds of the condition number of the matrix. Cases for special matrices as unitary matrices are considered., We thank the anonymous referees for their valuable reports that have improved this work. This work was partially sup-ported by Spanish grants MTM2017-85669-P and MTM2017-90682-REDT from "Ministerio de Economa y Competitividad", and by the Dominican Republic FONDOCYT grant number 2016-2017-057.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Compact quasi-Newton preconditioners for symmetric positive definite linear systems

  • BERGAMASCHI, LUCA
  • MARTINEZ, ANGELES
  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
[EN] In this paper, preconditioners for the conjugate gradient method are studied to solve the Newton system with symmetric positive definite Jacobian. In particular, we define a sequence of preconditioners built by means of Symmetric Rank one (SR1) and Broyden-Fletcher-Goldfarb-Shanno (BFGS) low-rank updates. We develop conditions under which the SR1 update maintains the preconditioner symmetric positive definite. Spectral analysis of the SR1 preconditioned Jacobians shows an improved eigenvalue distribution as the Newton iteration proceeds. A compact matrix formulation of the preconditioner update is developed which reduces the cost of its application and is more suitable to parallel implementation. Some notes on the implementation of the corresponding Inexact Newton method are given and some numerical results on a number of model problems illustrate the efficiency of the proposed preconditioners., This work was supported by the Spanish Ministerio de Economia y Competitividad under grants MTM2014-58159-P, MTM2017-85669-P, and MTM2017-90682-REDT. The first and third authors have been also partially supported by the INdAM Research group GNCS, 2020 Project: Optimization and advanced linear algebra for problems arising from PDEs.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Characterizations and perturbation analysis of a class of matrices related to core-EP inverses

  • Zhou, Mengmeng
  • Chen, Jianlong
  • Thome, Néstor|||0000-0001-5328-6637
[EN] Let A, B is an element of C-nxn with ind(A) = k and ind(B) = s and let L-B = (BB)-B-2(sic). A new condition (C-s,C-*): R(A(k)) boolean AND N((B-s)*) = {0} and R(B-s) boolean AND N((A(k))*) = {0}, is defined. Some new characterizations related to core-EP inverses are obtained when B satisfies condition (C-s,C-*). Explicit expressions of B(sic) and BB(sic) are also given. In addition, equivalent conditions, which guarantee that B satisfies condition (C-s,C-*), are investigated. We proved that B satisfies condition (C-s,C-*) if and only if L-B has a fixed matrix form. As an application, upper bounds for the errors parallel to B(sic) - A(sic)parallel to/parallel to A(sic)parallel to and parallel to BB(sic) - AA(sic)parallel to are studied. (c) 2021 Elsevier B.V. All rights reserved., The authors thank the Editor and Reviewers sincerely for their constructive comments and suggestions which have improved the quality of the paper. This research is supported by the National Natural Science Foundation of China (Nos. 11771076, 11871145), the Postgraduate Research and Practice Innovation Program of Jiangsu Province (No. KYCX18 -0053), the China Scholarship Council (File No. 201906090122). The third author is partially supported by Ministerio de Economia y Competitividad of Spain (grant Red de Excelencia MTM2017-90682-REDT) and partially supported by Universidad de Buenos Aires, Argentina. EXP-UBA: 13.019/2017, 20020170100350BA
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Ordered matrices with nonnegative group projector

  • Herrero Debón, Alicia|||0000-0002-4348-8486
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, the most usual matrix partial orders are considered on the ring of real matrices. These orders are studied on at most index 1 matrices having nonnegative group projector by using a specific block structure. The goal of this paper is to analyze how this structure is inherited by predecessors ordered under minus, sharp, star, and one-sided orders. In addition, the case of arbitrary index (greater than 1) is also investigated by means of the cn-partial order and using the Drazin inverse., An earlier version of this paper was presented at the Conference "Linear Algebra, Matrix Analysis and Applications. ALAMA2018", held in Sant Joan d'Alacant on May/June 2018. This work has been partially supported by Ministerio de Economia, Industria y Competitividad of Spain (Grant Red de Excelencia MTM2017-90682-REDT) and by Universidad Nacional del Sur of Argentina (Grant 24/L108)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Caracterización de la inversa de grupo débil mediante una ecuación de rangos

  • Ferreyra, David Eduardo
  • Orquera, V.
  • Thome, Néstor|||0000-0001-5328-6637
[ES] Si A es una matriz de tamaño n × n compleja invertible, es conocido que se puede caracterizar la inversa de A como la única matriz X que satisface la igualdad de rangos. En este trabajo se presenta una extensión al caso de matrices singulares, precisamente para la inversa de grupo débil Aw de A, recientemente introducida en [H. Wang, J. Chen, Weak group inverse, Open Mathematics, 16 (2018), pp. 1218-1232]., Este trabajo ha sido parcialmente subsidiado por los proyectos PPI 18/C472 de la Universidad Nacional de Río Cuarto, PIP 112-201501-00433CO de CONICET y por el Ministerio de Economía, Industria y Competitividad de España (Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The W-weighted Drazin-star matrix and its dual

  • Zhou, Mengmeng
  • Chen, Jianlong
  • Thome, Néstor|||0000-0001-5328-6637
[EN] After decades studying extensively two generalized inverses, namely Moore--Penrose inverse and Drazin inverse, currently, we found immersed in a new generation of generalized inverses (core inverse, DMP inverse, etc.). The main aim of this paper is to introduce and investigate a matrix related to these new generalized inverses defined for rectangular matrices. We apply our results to the solution of linear systems., The authors wish to thank the editor and reviewers sincerely for their constructive comments and suggestions that have improved the quality of the paper. This research is supported by the Postgraduate Research and Practice Innovation Program of Jiangsu Province (No. KYCX18_0053), the China Scholarship Council (File No. 201906090122), the National Natural Science Foundation of China (No.11771076, 11871145). The third author is partially supported by Ministerio de Economía y Competitividad of Spain (grant Red de Excelencia MTM2017-90682-REDT) and Universitat Nacional de La Pampa, Facultad de Ingeniería (Grant Resol. No. 135/19)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Parametrized solutions X of the system AXA = AEA and A^k EAX = XAEA^k for a matrix A having index k

  • Ferreyra, David Eduardo
  • Latanzi, Marina
  • Levis, Fabian
  • Thome, Néstor|||0000-0001-5328-6637
[EN] Let A and E be n x n given complex matrices. This paper provides a necessary and sufficient condition for the solvability to the matrix equation system given by AXA = AEA and A(k) EAX = XAEA(k) , for k being the index of A. In addition, its general solution is derived in terms of a G-Drazin inverse of A. As consequences, new representations are obtained for the set of all G-Drazin inverses; some interesting applications are also derived to show the importance of the obtained formulas., Partially supported by Universidad Nacional de Rio Cuarto (grant PPI 18/C472) and CONICET (grant PIP 112-201501-00433CO). Partially supported by Universidad Nacional de La Pampa, Facultad de Ingenieria (grant Resol. Nro. 155/14). Partially supported by Ministerio de Economia, Industria y Competitividad of Spain (grant Red de Excelencia MTM2017-90682-REDT) and by Universidad Nacional del Sur of Argentina (grant 24/L108).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the minus partial order in control systems

  • Coll, Carmen|||0000-0002-6487-3922
  • Herrero Debón, Alicia|||0000-0002-4348-8486
  • Sánchez, Elena|||0000-0002-0972-6612
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, the minus matrix partial order is considered to introduce the concept of minus partial ordered control systems. The transmission of the reachability property under this binary relation is investigated. Furthermore, the analysis of compartmental systems leads us to consider block triangular matrices. Hence, the existence and computation of partially ordered matrices having a similar block structure are studied. These results are applied to compartmental systems to get, via feedback, related systems with the same block structure and ordered under the minus partial order., This research was partially supported by Ministerio de Economia, Industria y Competitividad of Spain (Red de Excelencia grant MTM2017-90682-REDT). The fourth author was partially supported by Universidad de Buenos Aires of Argentina (Proyecto EXP-UBA: 13.019/2017, 20020170100350BA).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Preconditioners for rank deficient least squares problems

  • Cerdán Soriano, Juana Mercedes
  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
  • Mas Marí, José|||0000-0002-2835-974X
  • Guerrero, D.
[EN] In this paper we present a method for computing sparse preconditioners for iteratively solving rank deficient least squares problems (LS) by the LSMR method. The main idea of the method proposed is to update an incomplete factorization computed for a regularized problem to recover the solution of the original one. The numerical experiments for a wide set of matrices arising from different science and engineering applications show that the preconditioner proposed, in most cases, can be successfully applied to accelerate the convergence of the iterative Krylov subspace method., This work was supported by the Spanish Ministerio de Economia, Industria y Competitividad, Spain under grants MTM2017-85669-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Sobre una generalización de las inversas G-Drazin ponderadas

  • Ferreyra, David Eduardo
  • Latanzi, Marina
  • Levis, Fabian
  • Thome, Néstor|||0000-0001-5328-6637
[ES] En este trabajo se extiende el sistema de ecuaciones matriciales que define las inversas G-Drazin de una matriz cuadrada A (que involucra una matriz fija Y ) al caso de matrices rectangulares, considerando una matriz de ponderación W. Se encuentran las soluciones del nuevo sistema., Este trabajo ha sido parcialmente subvencionado por Universidad Nacional de Río Cuarto (PPI 18/C472), CONICET (PIP 112-201501-00433CO), Universidad Nacional de La Pampa, Facultad de Ingeniería (Resol. Nro. 155/14) y Ministerio de Economía, Industria y Competitividad de España (Proyecto Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The centralizer of an endomorphism over an arbitrary field

  • Mingueza, David
  • Montoro, M. Eulàlia
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] The centralizer of an endomorphism of a finite dimensional vector space is known when the endomorphism is nonderogatory or when its minimal polynomial splits over the field. It is also known for the real Jordan canonical form. In this paper we characterize the centralizer of an endomorphism over an arbitrary field, and compute its dimension. The result is obtained via generalized Jordan canonical forms (for separable and nonseparable minimal polynomials). In addition, we also obtain the corresponding generalized Weyr canonical forms and the structure of its centralizers, which in turn allows us to compute the determinant of its elements. (C) 2020 Elsevier Inc. All rights reserved., The second author is partially supported by "Ministerio de Economía, Industria y Competitividad (MINECO)" of Spain and "Fondo Europeo de Desarrollo Regional (FEDER)" of EU through grants MTM2015-65361-P and MTM2017-90682-REDT. The third author is partially supported by "Ministerio de Economía, Industria y Competitividad (MINECO)" of Spain and "Fondo Europeo de Desarrollo Regional (FEDER)" of EU through grants MTM2017-83624-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

1D inverse and D1 inverse of square matrices

  • Sahoo, Jajati Keshari
  • Maharana, Gayatri
  • Sitha, Bibekananda
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper we introduce two new classes of inverses for square matrices, which are called 1Drazin (in short, 1D) inverse and Drazin1 (in short, D1) inverse. Next, we investigated the existence and uniqueness of 1D inverse and its dual D1 inverse. Some representation and characterizations of these inverses are derived. In addition to this, we obtain some properties of 1D and D1 inverses through idempotent and binary relations., The fourth author was partially supported by Universidad Nacional de Rio Cuarto (Grant PPI18/C559), Universidad Nacional de La Pampa, Facultad de Ingenieria (Grant Resol. Nro. 135/19), Universidad Nacional del Sur (Grant PGI 24/L108), and Ministerio de Ciencia e Innovacion of Spain ¿(Grant RED2022-134176-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

CMMSE algorithms for constructing doubly stochastic matrices with the relative gain array (combined matrix) A circle A(-T)

  • Fuster Capilla, Robert Ricard
  • Gasso Matoses, María Teresa
  • Gimenez Manglano, María Isabel
[EN] The Combined matrix of a nonsingular matrix A is defined by phi(A)=A T where degrees means the Hadamard (entrywise) product. If the matrix A describes the relation between inputs and outputs in a multivariable process control, phi(A) describes the relative gain array (RGA) of the process and it defines the Bristol method (IEEE Trans Autom Control 1:133-134, 1966) often used for Chemical processes (McAvoy in Interaction analysis: principles and applications. Instrument Society of America, Pittsburgh, 1983; Papadourakis et al. in Ind Eng Chem Res 26(6):1259-1262, 1987; Wang et al. in Chem Eng Technol, 10.1002/ceat.201500202, 2016; Kariwala et al. in Ind Eng Chem Res 45(5):1751-1757, 10.1021/ie050790r, 2006; Golender et al. in J Chem Inf Comput Sci 21(4):196-204, 10.1021/ci00032a004, 1981). The combined matrix has been studied in several works such as Bru et al. (J Appl Math, 10.1155/2014/182354, 2014), Fiedler and Markham (Linear Algebra Appl 435:1945-1955, 2011) and Johnson and Shapiro (SIAM J Algebraic Discrete Methods 7:627-644, 1986). Since phi(A)=(cij) has the property of Sigma kcik=Sigma kckj=1,i,j, when phi(A)>= 0, phi(A) is a doubly stochastic matrix. In certain chemical engineering applications a diagonal of the RGA in wchich the entries are near 1 is used to determine the pairing of inputs and outputs for further design analysis. Applications of these matrices can be found in Communication Theory, related with the satellite-switched time division multiple-access systems, and about a doubly stochastic automorphism of a graph. In this paper we present new algorithms to generate doubly stochastic matrices with the Combined matrix using Hessenberg matrices in Sect.3 and orthogonal/unitary matrices in Sect.4. In addition, we discuss what kind of doubly stochastic matrices are obtained with our algorithms and the possibility of generating a particular doubly stochastic matrix by the map phi., This work has been supported by Spanish Ministerio de Economia y Competitividad Grants MTM2014-58159-P, MTM2017-85669-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Left and right generalized Drazin invertible operators on Banach spaces and applications

  • Ferreyra, David Eduardo
  • Latanzi, Marina
  • Levis, Fabian
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, left and right generalized Drazin invertible operators on Banach spaces are defined and characterized by means of the generalized Kato decomposition. Then, new binary relations associated with these operators are presented and studied. In addition, a new characterization of the generalized Drazin pre-order and a sufficient condition for that to be a partial order are given by using a matrix operator technique., This paper was partially supported by Universidad Nacional de La Pampa, Facultad de Ingenieria (grant Resol. No 155/14), Universidad Nacional de Rio Cuarto (grant PPI 18/C472) and CONICET (grant PIP 112-201501-00433CO). Fourth author was partially supported by Ministerio de Economia y Competitividad of Spain (grant Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Rank-one perturbations of matrix pencils

  • Baragaña, Itziar
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] We solve the problem of characterizing the Kronecker structure of a matrix pencil obtained by a rank-one perturbation of another matrix pencil. The results hold over arbitrary fields. (C) 2020 Elsevier Inc. All rights reserved., Partially supported by "Ministerio de Economia, Industria y Competitividad (MINECO)" of Spain and "Fondo Europeo de Desarrollo Regional (FEDER)" of EU through grants MTM2017-83624-P and MTM2017-90682-REDT, and by UPV/EHU through grant GIU16/42. We would like to thank the Reviewer for his/her valuable comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Lattice properties of partial orders for complex matrices via orthogonal projectors

  • Cimadamore, Cecilia
  • Rueda, Laura
  • Sauras Altuzarra, Lorenzo
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper deals with left star, star, and core partial ordersfor complex matrices. For each partial order, we present an order-isomorphism between the down-set of a fixed matrix B and a certain set (depending on the partial order) of orthogonal projectors whose matrix sizes can be considerably smaller than that of the matrix B. We study the lattice structure and we give properties of the down-sets. We prove that the down-set of B ordered by the core partial order and by the star partial order are sublattices of the down-set ordered by the left star partial order. We analize the existence of supremum and infimum of two given matrices and we give characterizations of these operations (whenever they exist). Some of the results given in the paper are already known in the literature but we present a different proof based on the previously established order-isomorphism., The first, the second, and the fourth author were partially supported by Departamento de Matemática, Universidad Nacional del Sur (UNS), Argentina [project number PGI 24/L108]. The third author was partially supported by FWF Austria [project numbers I 4427 and P 31955]. The fourth author was partially supported by Ministerio de Economía y Competitividad of Spain [grant Red de Excelencia, MTM2017-90682-REDT], by Universidad Nacional de Río Cuarto [grant number PPI 083/2020], and by Universidad Nacional de La Pampa, Facultad de Ingeniería, Argentina [grant number Resol. Nro. 135/19].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

SOBRE UNA CLASE ESPECIAL DE INVERSAS EXTERIORES

  • Hernández, María Valeria
  • Lattanzi, Marina B.
  • Thome, Néstor|||0000-0001-5328-6637
[ES] El objetivo de este trabajo es presentar una clase especial de inversas exteriores para matrices rectangulares. Estas inversas generalizadas se introducen a partir del análisis de determinados proyectores oblicuos definidos en un conjunto apropiado y generalizan algunas inversas clásicas de la literatura., Parcialmente subvencionado por Universidad Nacional de La Pampa, Facultad de Ingeniería (Resol. Nro. 135/19), Ministerio de Economía, Industria y Competitividad de España (Red de Excelencia MTM2017-90682-REDT) y Universidad Nacional de Río Cuarto (PPI 18/C559)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Characterizations of k-commutative equalities for some outer generalized inverses

  • Ferreyra, David Eduardo
  • Levis, Fabian
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, we present necessary and sufficient conditions for the k-commutative equality , where X is an outer generalized inverse of the square matrix A. Also, we give new representations for core EP, DMP, and CMP inverses of square matrices as outer inverses with prescribed null space and range. In addition, we characterize the core EP inverse as the solution of a new system of matrix equations., D. E. Ferreyra F. E. Levis Partially supported by a Consejo Nacional de Investigaciones Científicas y Técnicas CONICET s Posdoctoral Research Fellowship, UNRC [grant number PPI 18/C472] and CONICET [grant number PIP 112-201501-00433CO], respectively. N. Thome Partially supported by Secretaría de Estado de Investigación, Desarrollo e Innovación Ministerio de Economía, Industria y Competitividad of Spain [grant number DGI MTM2013-43678-P and Grant Red de Excelen- cia PMTM2017-90682-REDT]. D. E. Ferreyra and N. Thome Partially supported Universidad Nacional de La Pampa (UNLPam), Facultad de Ingeniería [grant Resol. No 155/14].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Linear feedback shift registers and the minimal realization problem

  • Baragana, Itziar
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] The Berlekamp-Massey algorithm solves the problem of finding the shortest linear feedback shift register which generates a given finite sequence of scalars. This problem is reinterpreted from the point of view of the realization theory and several extensions to sequences of matrices are analyzed. We give a generalization of the result on which the Berlekamp-Massey algorithm is based in terms of the partial Brunovsky indices of a sequence of matrices and propose an algorithm to obtain them for sequences of vectors. The results we obtain hold for arbitrary fields., The first author is partially supported by grants MINECO MTM2017-83624-P, MTM2017-90682-REDT, and UPV/EHU GIU16/42. The second author is partially supported by grants MINECO MTM2017-83624-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

New characterizations of weak group matrices

  • Zhou, Mengmeng
  • Chen, Jianlong
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, we prove that a complex square matrix is weak group matrix if the m-th power of this matrix commutes with its weak group inverse, where m is an arbitrary positive integer. Firstly, some new characterizations of weak group matrices are investigated by means of core-EP decomposition. Secondly, we study new equivalent conditions of the weak group matrix by using commutator and rank equalities. Finally, the relationships between {m, k} -core EP matrices, k-EP matrices and weak group matrices are given., This research is supported by the National Natural Science Foundation of China (No. 12101315,12101539,12171083), the China Scholarship Council (File No. 201906090122), Natural Science Foundation of Jiangsu Higher Education Institutions of China (21KJB110004), the Qing Lan Project of Jiangsu Province. The third author is partially supported by Ministerio de Economía y Competitividad of Spain (grant Red de Excelencia MTM2017-90682-REDT), by Project PGI 24/L108, Departamento de Matematica, Universidad Nacional del Sur (UNS), Argentina, by Universidad Nacional de Río Cuarto (Grant PPI 083/2020), and by Universidad Nacional de La Pampa, Facultad de Ingeniería (Grant Resol. Nro. 135/19).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A weak group inverse for rectangular matrices

  • Ferreyra, David Eduardo
  • Orquera, V.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, we extend the notion of weak group inverse to rectangular matrices (called WweightedWGinverse) by using the weighted core EP inverse recently investigated. This new generalized inverse also generalizes the well-known weighted group inverse given by Cline and Greville. In addition, we give several representations of the W-weighted WG inverse, and derive some characterizations and properties., First author was partially supported by UNRC (Grant PPI 18/C472) and CONICET (Grant PIP 112-201501-00433CO). Third author was partially supported by Ministerio de Economia, Industria y Competitividad of Spain (Grants DGI MTM2013-43678-P and Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The weak core inverse

  • Ferreyra, D. E.
  • Levis, F. E.
  • Priori, A. N.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, we introduce a new generalized inverse, called weak core inverse (or, in short, WC inverse) of a complex square matrix. This new inverse extends the notion of the core inverse defined by Baksalary and Trenkler (Linear Multilinear Algebra 58(6):681-697, 2010). We investigate characterizations, representations, and properties for this generalized inverse. In addition, we introduce weak core matrices (or, in short, WC matrices) and we show that these matrices form a more general class than that given by the known weak group matrices, recently investigated by H. Wang and X. Liu., In what follows, we detail the acknowledgements. D.E. Ferreyra, F.E. Levis, A.N. Priori - Partially supported by Universidad Nacional de Rio Cuarto (Grant PPI 18/C559) and CONICET (Grant PIP 112-201501-00433CO). D.E. Ferreyra F.E. Levis - Partially supported by ANPCyT (Grant PICT 201803492). D.E. Ferreyra, N. Thome -Partially supported by Universidad Nacional de La Pampa, Facultad de Ingenieria (Grant Resol. Nro. 135/19). N. Thome -Partially supported by Ministerio de Economia, Industria y Competitividad of Spain (Grant Red de Excelencia MTM2017-90682-REDT) and by Universidad Nacional del Sur of Argentina (Grant 24/L108). We would like to thank the Referees for their valuable comments and suggestions which helped us to considerably improve the presentation of the paper
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Sharp partial order and linear autonomous systems

  • Herrero Debón, Alicia|||0000-0002-4348-8486
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper deals with autonomous linear systems and the sharp partial order. Given an autonomous linear system, we find another system, which is related to the first one by means of the sharp partial order. This relation can be interpreted in different ways: as a perturbation or as a projection of the initial system. Both points of view allow us to work with a new system with some previously selected behaviour. The solutions of the two systems are related via a matrix that gives the gap between them. We design some algorithms and analize their performance with numerical examples., This research was partially supported by Ministerio de Economia, Industria y Competitividad of Spain (Red de Excelencia MTM2017-90682-REDT) and by Universidad de Buenos Aires (EXP-UBA: 13.019/2017, 20020170100350BA).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Spectral study of {R, s + 1, k}- and {R, s + 1, k, *}-potent matrices

  • Catral, M.
  • Lebtahi, L.
  • Stuart, J.
  • Thome, Néstor|||0000-0001-5328-6637
[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., This work has been partially supported by Ministerio de Economia, Industria y Competitividad, Spain (Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The lattice of characteristic subspaces of an endomorphism with Jordan-Chevalley decomposition

  • Mingueza, David
  • Montoro, M. Eulàlia
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] Given an endomorphism A over a finite dimensional vector space having Jordan-Chevalley decomposition, the lattices of invariant and hyperinvariant subspaces of A can be obtained from the nilpotent part of this decomposition. We extend this result for lattices of characteristic subspaces. We also obtain a generalization of Shoda's theorem about the characterization of the existence of characteristic non hyperinvariant subspaces. (C) 2018 Elsevier Inc. All rights reserved., The second author is partially supported by grant MTM2015-65361-P MINECO/FEDER, UE and MTM2017-90682-REDT. The third author is partially supported by grants MTM2017-83624-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

La inversa generalizada BT de una matriz rectangular

  • Ferreyra, D. E.
  • Torigino, C.
  • Thome, Néstor|||0000-0001-5328-6637
[ES] La inversa BT (originalmente llamada inversa Core Generalizada) fue introducida en el ano 2014 por O.M. Baksalary y G. Trenkler para matrices cuadradas de ¿ndice arbitrario extendiendo el concepto de inversa Core definida 4 aos antes por los mismos autores para matrices cuadradas de ¿ndice a lo sumo 1. El objetivo de esta propuesta es realizar una extension al caso rectangular de la inversa BT. Mas precisamente, en este trabajo se introduce un nuevo tipo de inversa generalizada para matrices rectangulares, que se denomina inversa BT W-ponderada. Se analiza la existencia y unicidad de la inversa BT W-ponderada como solucion de un sistema de ecuaciones matriciales. Tambien se proporciona una representacion de esta nueva inversa usando una triangulacion simultanea del tipo Schur para el caso de matrices rectangulares., Este trabajo ha sido parcialmente subvencionado por Universidad Nacional de Rio Cuarto (PPI 18/C559), Universidad Nacional de La Pampa, Facultad de Ingenieria (Resol. Nro. 135/19), CONICET (PIP 112-201501-00433CO), ANPCyT (PICT 2018-03492) y Ministerio de Economia, Industria y Competitividad de España (Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Weierstrass Structure and Eigenvalue Placement of Regular Matrix Pencils under Low Rank Perturbations

  • Baragana Garate, Itziar
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] We solve the problem of determining the Weierstrass structure of a regular matrix pencil obtained by a low rank perturbation of another regular matrix pencil. We apply the result to find necessary and sufficient conditions for the existence of a low rank perturbation such that the perturbed pencil has prescribed eigenvalues and algebraic multiplicities. The results hold over fields with sufficient number of elements., The work of the first and second authors was partially supported by MINECO grants MTM2017-83624-P and MTM2017-90682-REDT. The work of the first author was also partially supported by UPV/EHU grant GIU16/42.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Ínfimos y supremos de matrices complejas

  • Rueda, Laura
  • Thome, Néstor|||0000-0001-5328-6637
[ES] En este artículo se calculan el ínfimo y el supremo (cuando este último existe) de dos matrices dadas para diferentes ordenes parciales, a partir del estudio de ciertos proyectores ortogonales asociados a las matrices dadas., El segundo autor fue parcialmente subvencionado por Ministerio de Industria, Economía y Competitividad de España (Proyecto Red de Excelencia MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On 2MP-, MP2- and C2MP-inverses for rectangular matrices

  • Hernández, M. V.
  • Lattanzi, Marina B.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper introduces 2MP-inverses, MP2-inverses, and C2MP-inverses, for rectangular matrices following a different approach to that used in the recent literature. These new inverses generalize some classical inverses in the literature. Instead of considering a system of matrix equations as usually, in order to define 2MP-inverses and MP2-inverses, we consider a construction from oblique projectors represented by means of outer generalized inverses. We use an adequate equivalence relation, and then we pass to the quotient set in order to get the most simple canonical representative. An interesting advantage of our extension of CMP inverses from square to rectangular matrices is that we do not need any auxiliary weight matrix, but we are using the own matrix A for doing it. In addition, some properties and representations of 2MP-, MP2-, and C2MP-inverses are given., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Matrices A such that A^(s+1)R = RA^*, with R^k = I

  • Catral, Minerva
  • Lebtahi Ep-Kadi-Hahifi, Leila
  • Stuart, Jeffrey
  • Thome, Néstor|||0000-0001-5328-6637
[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., The second and fourth authors have been partially supported by Ministerio de Economia y Competitividad of Spain (Grant MTM2013-43678-P and Red de Excelencia Grant MTM2017-90682-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

GDMP-inverses of a matrix and their duals

  • Hernández, María Valeria
  • Latanzi, Marina
  • Thome, Néstor|||0000-0001-5328-6637
[EN] This paper introduces and investigates a new class of generalized inverses, called GDMP-inverses (and their duals), as a generalization of DMP-inverses. GDMP-inverses are defined from G-Drazin inverses and the Moore-Penrose inverse of a complex square matrix. In contrast to most other generalized inverses, GDMP-inverses are not only outer inverses but also inner inverses. Characterizations and representations of GDMP-inverses are obtained by means of the core-nilpotent and the Hartwig-Spindelböck decompositions., Partially supported by Universidad Nacional de La Pampa, Facultad de Ingenieria (grant Resol. Nro. 135/19). Partially supported byMinisterio de Economia, Industria y Competitividad of Spain (Grant Red de Excelencia MTM2017-90682-REDT). Secretaria de Estado de Investigacion, Desarrollo e Innovacion.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Fixed rank perturbations of regular matrix pencils

  • BARAGAÑA GARATE, ITZIAR
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] A characterization of the structure of a regular matrix pencil obtained by a bounded rank perturbation of another regular matrix pencil has been recently obtained. The result generalizes the solution for the bounded rank perturbation problem of a square constant matrix. When comparing the fixed rank perturbation problem of a constant matrix with the bounded rank perturbation problem we realize that both problems are of different nature; the first one is more restrictive. In this paper we characterize the structure of a regular matrix pencil obtained by a fixed rank perturbation of another regular matrix pencil. We apply the result to find necessary and sufficient conditions for the existence of a fixed rank perturbation such that the perturbed pencil has a prescribed determinant. The results hold over fields with sufficient number of elements. (C) 2019 Elsevier Inc. All rights reserved., The first author was partially supported by "Ministerio de Economia, Industria y Competitividad (MINECO)" of Spain and "Fondo Europeo de Desarrollo Regional (FEDER)" of EU through grants MTM2017-83624-P and MTM2017-90682-REDT, and by UPV/EHU through grant GIU16/42. The second author was partially supported by "Ministerio de Economia, Industria y Competitividad (MINECO)" of Spain and "Fondo Europeo de Desarrollo Regional (FEDER)" of EU through grants MTM2017-83624-P and MTM2017-90682-REDT. We would like to thank the Reviewer for his/her valuable remarks and comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the maximum rank of totally nonnegative matrices

  • Cantó Colomina, Rafael|||0000-0002-1341-2800
  • Urbano Salvador, Ana María|||0000-0001-8590-1243
[EN] Let A is an element of R-nxn be a totally nonnegative matrix with principal rank p, that is, every minor of A is nonnegative and p is the size of the largest invertible principal submatrix of A. We introduce the sequence of the first p-indices of A as the first initial row and column indices of a p x p invertible principal submatrix of A with rank p. Then, we study the linear dependence relations between the rows and columns indexed by the sequence of the first p-indices of A and the remaining of its rows and columns. These relations, together with the irreducibility property of some submatrices of A, allow us to present an algorithm that calculates the maximum rank of A as a function of the distribution of the first p-indices. Finally, we present a method to construct n x n totally nonnegative matrices with given rank r, principal rank p and a specific sequence of the first p-indices. (C) 2018 Elsevier Inc. All rights reserved., This research was supported by the Spanish DGI grants MTM2013-43678-P, MTM2017-85669-P and MTM2017-90682-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Bounded rank perturbations of regular pencils over arbitrary fields

  • Baragana, Itziar
  • Dodig, Marija
  • Stosic, Marko
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] In this paper we solve the bounded rank perturbation problem for regular pencils over arbitrary fields. The solution is obtained by reducing the problem to a row completion problem for matrix pencils. The result generalizes the main result of [1], where a solution to the problem was given requiring a condition on the underlying field. (C) 2020 Elsevier Inc. All rights reserved., The authors would like to thank the referee for the comments and suggestions that have improved the presentation of the paper. This work was done within the activities of CEAFEL and was partially supported by Fundacao para a Ciencia e a Tecnologia, project UIDB/04721/2020 (M.D.), by "Ministerio de Economia, Industria y Competitividad (MINECO)" of Spain and Fondo Europeo de Desarrollo Regional (FEDER)" of EU through grants MTM2017-83624-P (I.B., A.R.), MTM2017-90682-REDT (I.B., A.R.), by UPV/EHU through grant GIU16/42 (I.B.), and by the Ministry of Education, Science and Technological Development of the Republic of Serbia, project no. 174020 (M.D.) and no. 174012 (M.S.).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Diagonal entries of the combined matrix of sign regular matrices of arder three

  • Gasso Matoses, María Teresa
  • Gil, Ivan
  • Gimenez Manglano, María Isabel
  • Santana-De Asis, Máximo De Jesús
  • Segura, Elaine
[EN] The study of the diagonal entries of the combined matrix of a nonsingular matrix A has been considered by different authors for the classes of Mmatrices, positive definite matrices and totally positive (negative) matrices. This problem appears to be difficult as the results have been done only for matrices of order three. In this work, we continue to give the characterization ofthe diagonal entries ofthe combined matrix ofthe remainder sign regular matrices. Thus, the problem is closed for all possible sign regular matrices of order three., Supported by Spanish Ministerio de Economía y Competitividad grants MTM2017-85669-P and MTM2017-90682-REDT and Dominican Republic FONDOCYT grant number 2015-1D2-166
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving an open problem about the G-Drazin partial order

  • Ferreyra, D. E.
  • Lattanzi, M.
  • Levis, F. E.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] G-Drazin inverses and the G-Drazin partial order for square matrices have been both recently introduced by Wang and Liu. They proved the following implication: If A is below B under the G-Drazin partial order, then any G-Drazin inverse of B is also a G-Drazin inverse of A. However, this necessary condition could not be stated as a characterization and the validity (or not) of the converse implication was posed as an open problem. In this paper, this problem is completely solved. It is obtained that the converse, in general, is false, and a form to construct counterexamples is provided. It is also proved that the converse holds under an additional condition (which is also necessary) as well as for some special cases of matrices., Partially supported by Universidad Nacional de Río Cuarto (Grant PPI 18/C472), CONICET (Grant PIP 112-201501-00433CO), and by ANPCyT (Grant PICT 2018-03492) Partially supported by Universidad Nacional de La Pampa, Facultad de Ingeniería (Grant Resol. Nro. 155/14) Partially supported by Ministerio de Economía, Industria y Competitividad of Spain (Grant Red de Excelencia MTM2017-90682-REDT), and by Universidad Nacional del Sur of Argentina (Grant 24/L108)
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Implementation of the hybrid exchange-correlation functionals in the SIESTA code

  • Pouillon, Yann
  • Oyomo, Bill Clintone
  • Sifuna, James
  • Camarasa-Gómez, María
  • Qin, Xinming
  • Beltrán, Carlos
  • Gómez-Ortiz, Fernando
  • Shang, Honghui
  • Junquera, Javier
Data will be made available on request., We present an efficient and accurate implementation of hybrid exchange-correlation (XC) functionals in the siesta code, enabling large-scale simulations based on Hartree-Fock-type exact exchange combined with strictly localized numerical atomic orbitals (NAOs). Our approach exploits a fitted representation of the NAOs in terms of Gaussian-type orbitals (GTOs), which allows for the analytical evaluation of four-center electron repulsion integrals (ERIs) via the libint library. This framework is seamlessly integrated with siesta’s real-space grid and sparse-matrix infrastructure, and is combined with multiple screening techniques to control the computational complexity. We also introduce a fully analytical formulation of hybrid-functional forces and a dynamic parallel distribution scheme that ensures excellent scalability. We validate our implementation through benchmark calculations on a broad set of systems (including semiconductors, insulators, and two-dimensional materials) and demonstrate that the HSE06 functional significantly improves the prediction of band gaps compared to PBE, in close agreement with G0W0 and experimental data. We analyze in detail the trade-offs between accuracy and computational efficiency as a function of the number of Gaussians, basis set range, and integral screening thresholds. Our results confirm that hybrid functional calculations in siesta are now feasible for large extended systems, making accurate first-principles predictions of electronic and structural properties accessible at scale., Y.P. acknowledges financial support from project RTC-2016-56817 by the Spanish Ministry of Economy, Industry and Competitiveness, co-financed by the European Structural and Investment Funds; from the Spanish State Plan for Scientific and Technical Research and Innovation 2017–2020 (Torres-Quevedo Grant PTQ-2019); from MCIN and the European Union NextGenerationEU/PRTR-C17.I1, as well as IKUR Strategy, under the collaboration agreement between Donostia International Physics Center and nanoGUNE on behalf of the Department of Education of the Basque Government. B.C.O. acknowledges financial support from the Erasmus+ KA-107 action, the Vice-rectorate for Internationalisation and Global Engagement of the University of Cantabria, and the Kenya Education Network Trust (KENET). M.C.-G. acknowledges support from the Diputación Foral de Gipuzkoa through grants 2024-FELL-000007-01 and 2025-FELL-000009-01, from the Gobierno Vasco-UPV/EHU project no. IT1569-22, and from grant no. PID2024159869NA-I00 funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU. F.G.-O. acknowledges financial support from MSCAPF 101148906 funded by the European Union and the Fonds de la Recherche Scientifique (FNRS) through the grant FNRS-CR 1.B.227.25F. J.J. acknowledges financial support from grant no. PID2022-139776NBC63 funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU/AEI/10.13039/ 501100011033 and by ERDF/EU “A way of making Europe” by the European Union. C.B. has been partially supported by grants MTM2017-83816-P and MTM2017-90682REDT from the Spanish Ministry of Science (MICINN) and by grant 21.SI01.64658 from Universidad de Cantabria and Banco de Santander. H.S. acknowledges financial support from the National Natural Science Foundation of China (grant no. T2222026). The authors also gratefully acknowledge the computer resources, technical expertise, and assistance provided by the Centre for High Performance Computing (CHPCMATS862 & MATS1424), Cape Town, South Africa., Peer reviewed
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Combined matrices of almost strictly sign regular matrices

  • Alonso, P.
  • Peña, J.M.
  • Serrano, M.L.
The combined matrix is a very useful concept for many applications. Almost strictly sign regular (ASSR) matrices form an important structured class of matrices with two possible zero patterns, which are either type-I staircase or type-II staircase. We prove that, under an irreducibility condition, the pattern of zero and nonzero entries of an ASSR matrix is preserved by the corresponding combined matrix. Without the irreducibility condition, it is proved that type-I and type-II staircases are still preserved. Illustrative numerical examples are included.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Almost strictly sign regular rectangular matrices

  • Alonso, P.
  • Peña, J.M.
  • Serrano, M.L.
Almost strictly sign regular matrices are sign regular matrices with a special zero pattern and whose nontrivial minors are nonzero. In this paper we provide several properties of almost strictly sign regular rectangular matrices of maximal rank and analyze their QR factorization.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Depth of almost strictly sign regular matrices

  • Alonso, Pedro
  • Jiménez, Jorge
  • Peña, Juan Manuel
  • Serrano, María Luisa
The concept of depth of an almost strictly sign regular matrix is introduced and used to simplify some algorithmic characterizations of these matrices.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Perturbed marked reduced forms of invariant subspaces

  • Compta Creus, Albert
  • Ferrer Llop, Josep
  • Peña Carrera, Marta
The classification of invariant subspaces is an open problem related to other important ones like the Carlson problem. Here we obtain a reduced form of these invariant subspaces as a new tool to tackle these problems. In particular, it allows us to prove quite easily partial results already known. The key point is assigning to each invariant subspace a marked one (its marked type) in order to partition the set of invariant subspaces in a finite number of subsets (the marked classes), each one containing only one marked subspace. Next, we parametrize (minimally) each marked class by means of the so-called PM reduced families, so that representatives of an invariant subspace (its PM reduced forms) appear in just one of these families., Peer Reviewed, Postprint (author's final draft)