Pasar al contenido principal

RED TEMATICA DE ALGEBRA LINEAL, ANALISIS MATRICIAL Y APLICACIONES

MTM2015-68805-REDT

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
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 2015
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSIDAD DEL PAIS VASCO EUSKAL HERRIKO UNIBERTSITATEA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 26
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 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)

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)

Backward error and conditioning of Fiedler linearizations

  • Terán Vergara, Fernando de
The standard way to solve polynomial eigenvalue problems is through linearizations. The family of Fiedler linearizations, which includes the classical Frobenius companion forms, presents many interesting properties from both the theoretical and the applied point of view. These properties make the Fiedler pencils a very attractive family of linearizations to be used in the solution of polynomial eigenvalue problems. However, their numerical features for general matrix polynomials had not yet been fully investigated. In this paper, we analyze the backward error of eigenpairs and the condition number of eigenvalues of Fiedler linearizations in the solution of polynomial eigenvalue problems. We get bounds for: (a) the ratio between the backward error of an eigenpair of the matrix polynomial and the backward error of the corresponding (computed) eigenpair of the linearization, and (b) the ratio between the condition number of an eigenvalue in the linearization and the condition number of the same eigenvalue in the matrix polynomial. A key quantity in these bounds is ρ, the ratio between the maximum norm of the coefficients of the polynomial and the minimum norm of the leading and trailing coefficient. If the matrix polynomial is well scaled (i. e., all its coefficients have a similar norm, which implies ρ ≈ 1), then solving the Polynomial Eigenvalue Problem with any Fiedler linearization will give a good performance from the point of view of backward error and conditioning. In the more general case of badly scaled matrix polynomials, dividing the coefficients of the polynomial by the maximum norm of its coefficients allows us to get better bounds. In particular, after this scaling, the ratio between the eigenvalue condition number in any two Fiedler linearizations is bounded by a quantity that depends only on the size and the degree of the polynomial. We also analyze the effect of parameter scaling in these linearizations, which improves significantly the backward error and conditioning in some cases where ρ is large. Several numerical experiments are provided to support our theoretical results., This work was partially supported by the Ministerio de Ciencia e Innovación of Spain through grant MTM-2009-09281, and by the Ministerio de Economía y Competitividad of Spain through grants MTM-2012-32542, MTM2015-68805-REDT, and MTM2015-65798-P., Publicado
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem

  • Castro Gonzalez, Nieves
  • Martínez Dopico, Froilán César
  • Molera Molera, Juan Manuel
Bounds for the variation of the Moore Penrose inverse of general matrices under multiplicative perturbations are presented. Their advantages with respect to classical bounds under additive perturbations and with respect to other bounds under multiplicative perturbations available in the literature are carefully studied and established. Closely connected to these developments a complete multiplicative perturbation theory for least squares problems, valid for perturbations of any size, is also presented, improving in this way recent multiplicative perturbation bounds which are valid only to first order in the size of the perturbations. The results in this paper are mainly based on exact expressions of the perturbed Moore-Penrose inverse in terms of the unperturbed one, the perturbation matrices, and certain orthogonal projectors. Such feature makes the new results amenable to be generalized in the future to linear operators in infinite dimensional spaces.
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)

A Geometric Description of the Sets of Palindromic and Alternating Matrix Pencils with Bounded Rank

  • Terán Vergara, Fernando de
The sets of n x n T-palindromic, T-antipalindromic, T-even, and T-odd matrix pencils with rank at most r < n are algebraic subsets of the set of n x n matrix pencils. In this paper, we determine their dimension and we prove that they are all irreducible. This is in contrast with the nonstructured case, since it is known that the set of n x matrix pencils with rank at most r< n is an algebraic set with r + 1 irreducible components. We also show that these sets of structured pencils with bounded rank are the closure of the congruence orbit of a certain structured pencil given in canonical form. This allows us to determine the generic canonical form of a structured n x n matrix pencil with rank at most r, for any of the previous structures.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Computing the cardinality of the lattice of characteristic subspaces

  • Mingueza, David
  • Montoro, M.Eulàlia
  • Roca Martinez, Alicia|||0000-0003-1926-1895
[EN] We obtain the cardinality of the lattice of characteristic sub-spaces of a nilpotent Jordan matrix when the underlying field is GF(2), the only field where the lattices of characteristic and hyperinvariant subspaces can be different. If the charac-teristic polynomial of the matrix splits in the field, the general case can be reduced to the nilpotent Jordan case. Results are complex and highly combinatorial, and include the design of an algorithm., The second author is partially supported by grant MTM2015-65361-P MINECO/FEDER, UE. The third author is partially supported by grants MTM2013-40960-P MINECO and MTM2015-68805-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Sistemas estructurados parcialmente ordenados

  • 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
[ES] Cuando un sistema de control representa a un proceso real, como puede ser, una dinámica de poblaciones o la evolución de una enfermedad infecciosa, las conexiones entre las diferentes variables de estado presentan una estructura prefijada, propia del tipo de proceso real que se está considerando. En este trabajo, se considera una matriz estructurada y se establecen condiciones para obtener matrices comparables a la dada (bajo la relación de orden parcial menos) que presenten la misma estructura. Estos resultados se aplican a sistemas de control estructurados y se analiza el sistema en lazo cerrado obtenido al aplicar una realimentación que proporciona sistemas de control ordenados mediante el orden dado. Se analizan las propiedades de alcanzabilidad y de estabilidad y se ilustra el trabajo con algunos ejemplos., Este trabajo ha sido financiado parcialmente por el Ministerio de Econom´ıa y Competitividad (Proyecto de Investigacion MTM2013-43678-P y Red de Excelencia MTM2015-68805-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A two-level ILU preconditioner for electromagnetic applications

  • Cerdán Soriano, Juana Mercedes
  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
  • Mas Marí, José|||0000-0002-2835-974X
[EN] Computational electromagnetics based on the solution of the integral form of Maxwell s equations with boundary element methods require the solution of large and dense linear systems. For large-scale problems the solution is obtained by using iterative Krylov-type methods provided that a fast method for performing matrix vector products is available. In addition, for ill-conditioned problems some kind of preconditioning technique must be applied to the linear system in order to accelerate the convergence of the iterative method and improve its performance. For many applications it has been reported that incomplete factorizations often suffer from numerical instability due to the indefiniteness of the coefficient matrix. In this context, approximate inverse preconditioners based on Frobenius-norm minimization have emerged as a robust and highly parallel alternative. In this work we propose a two-level ILU preconditioner for the preconditioned GMRES method. The computation and application of the preconditioner is based on graph partitioning techniques. Numerical experiments are presented for different problems and show that with this technique it is possible to obtain robust ILU preconditioners that perform competitively compared with Frobenius-norm minimization preconditioners., This work was supported by the Spanish Ministerio de Economía y Competitividad under grant MTM2014-58159-P and MTM2015-68805-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Algorithms for solving the inverse problem associated with KAK = A(s+1)

  • Lebtahi Ep-Kadi-Hahifi, Leila
  • Romero Martínez, José Oscar|||0000-0003-4081-9005
  • Thome, Néstor|||0000-0001-5328-6637
[EN] 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 KAs+1K = A for a given matrix A ¿ C n×n and a given natural number s. The cases s = 0 and s ¿ 1 are separately studied since they produce different situations. In addition, some examples are presented showing the numerical performance of the methods., This work was partially supported by Ministerio de Economía y Competitividad (Grant DGIMTM2013-43678-P and Redes de Excelencia MTM2015-68805-REDT) and Universidad de Buenos Aires, Secretaría de Ciencia y Técnica, Argentina (Grant EXP-UBA: 9.011/2013, Res.: (CS) No. 7000/13).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Revisiting the core EP inverse and its extension to rectangular matrices

  • Ferreyra, David Eduardo
  • Levis, Fabian
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, we revise the core EP inverse of a square matrix introduced by Prasad and Mohana in [12], Core EP inverse, Linear and Multilinear Algebra62(3) (2014), 792-802. Firstly, we give a new representation and a new characterization of the core EP inverse. Then, we study some properties of the core EP inverse by using a representation by block matrices. Secondly, we extend the notion of core EP inverse to rectangular matrices by means of a weighted core EP decomposition. Finally, we study some properties of weighted core EP inverses., Partially supported by a CONICET's Postdoctoral Research Fellowship, Universidad Nacional de Ro Cuarto (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 MTM2015-68805-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part

  • Cerdán Soriano, Juana Mercedes
  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
  • Mas Marí, José|||0000-0002-2835-974X
  • Guerrero-Flores, Danny Joel
[EN] We present a preconditioning technique for solving nonsymmetric linear systems Ax = b, where the coefficient matrix A has a skew-symmetric part that can be well approximated with a skew-symmetric low-rank matrix. The method consists of updating a preconditioner obtained from the symmetric part of A. We present some results concerning to the approximation properties of the preconditioner and the spectral properties of the preconditioning technique. The results of the numerical experiments performed show that our strategy is competitive compared with some specific methods. (C) 2018 Elsevier B.V. All rights reserved., This work was supported by the Spanish Ministerio de Economia y Competitividad under grants MTM2014-58159-P and MTM2015-68805-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Inequalities and equalities for l = 2 (Sylvester), l = 3 (Frobenius), and l &gt, 3 matrices

  • Thome, Néstor|||0000-0001-5328-6637
This paper gives simple proofs of Sylvester (` = 2) and Frobenius (` = 3) inequalities. Moreover, a new sufficient condition for the equality of the Frobenius inequality is provided. In addition, an extension for ` > 3 matrices and an application to generalized inverses are provided., This paper has been partially supported by Ministerio de Economia y Competitividad (Grant DGI MTM2013-43678P and Red de Excelencia MTM2015-68805-REDT). The author thanks the referees for their valuable suggestions.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The class of m-EP and m-normal matrices

  • Malik, Saroj B.
  • Rueda, Laura
  • Thome, Néstor|||0000-0001-5328-6637
The well-known classes of EP matrices and normal matrices are de- fined by the matrices that commute with their Moore-Penrose inverse and with their conjugate transpose, respectively. This paper investigates the class of m-EP matrices and m-normal matrices that provide a generalization of EP matrices and normal matrices, respectively, and analyzes both of them for their properties and characterizations., Third author was partially supported by Ministerio de Economia y Competitividad of Spain [grant number DGI MTM2013-43678-P], [Red de Excelencia MTM2015-68805-REDT].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Updating preconditioners for modified least squares problems

  • Marín Mateos-Aparicio, José|||0000-0002-7825-2836
  • Mas Marí, José|||0000-0002-2835-974X
  • Guerrero-Flores, Danny Joel
  • Hayami, K.
[EN] In this paper, we analyze how to update incomplete Cholesky preconditioners to solve least squares problems using iterative methods when the set of linear relations is updated with some new information, a new variable is added or, contrarily, some information or variable is removed from the set. Our proposed method computes a low-rank update of the preconditioner using a bordering method which is inexpensive compared with the cost of computing a new preconditioner. Moreover, the numerical experiments presented show that this strategy gives, in many cases, a better preconditioner than other choices, including the computation of a new preconditioner from scratch or reusing an existing one., Partially supported by Spanish Grants MTM2014-58159-P and MTM2015-68805-REDT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On a revisited Moore-Penrose inverse of a linear operator on Hilbert spaces

  • Malik, Saroj B.
  • Thome, Néstor|||0000-0001-5328-6637
[EN] For two given Hilbert spaces H and K and a given bounded linear operator A is an element of L(H, K) having closed range, it is well known that the Moore-Penrose inverse of A is a reflexive g-inverse G is an element of L ( K; H) of A which is both minimum norm and least squares. In this paper, weaker equivalent conditions for an operator G to be the Moore-Penrose inverse of A are investigated in terms of normal, EP, bi-normal, bi-EP, l-quasi-normal and r-quasi-normal and l-quasi-EP and r-quasi-EP operators., Research partially supported by Ministerio de Economia y Competitividad of Spain (grant DGI MTM2013-43678-P and Red de Excelencia MTM2015-68805-REDT)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Nilpotent matrices and the minus partial order

  • Gareis, María Inés
  • Lattanzi, Marina
  • Thome, Néstor|||0000-0001-5328-6637
[EN] In this paper, {1}-inverses of a nilpotent matrix as well as matrices above a given nilpotent matrix under the minus partial order are characterized., This paper was partially supported by Universidad Nacional de La Pampa, Facultad de Ingenieria (Grant Resol. No 155/14). The third author was partially supported by Ministerio de Economia y Competitividad of Spain (Grant number DGI MTM2013-43678-P and Grant Red de Excelencia MTM2015-68805-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Alcanzabilidad de sistemas de control parcialmente ordenados

  • 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
[ES] En este trabajo se buscaran condiciones que permitan transmitir la propiedad estructural de alcanzabilidad entre sistemas dinámicos de control en tiempo discreto cuyas matrices de estado admiten una relación de orden mediante el orden parcial menos. Los resultados obtenidos serán la base para analizar el comportamiento de un modelo de control en tiempo discreto donde se ha producido una perturbación en su matriz de estados. Se obtendrá una caracterización para determinar cuándo se transmite la propiedad de alcanzabilidad del sistema inicial al sistema perturbado., Este trabajo ha sido financiado parcialmente por el Ministerio de Econom´ıa y Competitividad (Proyecto de Investigacion MTM2013-43678-P y Red de Excelencia MTM2015-68805-REDT)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Weighted G-Drazin inverses and a new pre-order on rectangular matrices

  • Coll, Carmen|||0000-0002-6487-3922
  • Thome, Néstor|||0000-0001-5328-6637
  • Lattanzi, Marina
[EN] This paper deals with weighted G-Drazin inverses, which is a new class of matrices introduced to extend (to the rectangular case) G-Drazin inverses recently considered by Wang and Liu for square matrices. First, we define and characterize weighted G-Drazin inverses. Next, we consider a new pre-order defined on complex rectangular matrices based on weighted G-Drazin inverses. Finally, we characterize this pre-order and relate it to the minus partial order and to the weighted Drazin pre-order. (C) 2017 Elsevier Inc. All rights reserved., This paper was partially supported by Universidad Nacional de La Pampa, Facultad de Ingenieria, grant resol. no. 155/14. The first and third authors were partially supported by Ministerio de Economia y Competitividad of Spain (grant no. DGI MTM2013-43678-P) and the third author was also partially supported by Ministerio de Economia y Competitividad of Spain (Red de Excelencia MTM2015-68805-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Problema de optimización para matrices normales J-hamiltonianas

  • Gigola, Silvia Viviana
  • Lebtahi Ep-Kadi-Hahifi, Leila
  • Thome, Néstor|||0000-0001-5328-6637
[ES] En este trabajo se estudia el problema del valor propio inverso para matrices normales J-hamiltonianas. En [Inverse eigenvalue problem for normal J-hamiltonian matrices, Applied Mathematics Letters, 48, 36¿40, 2015] los autores encontraron la forma canonica de las matrices normales ¿ J-hamiltonianas que solucionan el problema de valor propio inverso. En este art¿¿culo se presenta un algoritmo que permite determinar la solucion correspondiente al ¿ problema de optimizacion asociado y se muestran ejemplos ilustrativos acerca de su ¿ aplicacion., Este trabajo ha sido parcialmente subvencionado por el Ministerio de Economía y Competitividad (Proyecto MTM2013-43678-P y Red de Excelencia MTM2015-68805-REDT) y por el Proyecto de la Universidad de Buenos Aires, Argentina, EXP-UBA: 9.011/2013, Res.: (CS) N 7000/13.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On some new pre-orders defined by weighted Drazin inverses

  • Hernández, Araceli Elisabet
  • Lattanzi, Marina Beatriz
  • Thome, Néstor|||0000-0001-5328-6637
In this paper, we investigate new binary relations defined on the set of rectangular complex matrices based on the weighted Drazin inverse and give some characterizations of them. These relations become pre-orders and improve the results found by the authors in Hernandez et al. (2013) as well as extend those known for square matrices. On the other hand, some new weighted partial orders are also defined and characterized. The advantages of these new relations compared to the ones considered in the mentioned paper are also pointed out., N. Thome was partially supported by Ministerio de Economia y Competitividad of Spain (Grant DGI MTM2013-43678-P and Red de Excelencia MTM2015-68805-REDT).
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting

  • Alonso, P.
  • Peña, J.M.
  • Serrano, M.L.
In 2007 Cortés and Peña introduced a pivoting strategy for the Neville elimination of nonsingular sign regular matrices and called it two-determinant pivoting. Neville elimination has been very useful for obtaining theoretical and practical properties for totally positive (negative) matrices and other related types of matrices. A real matrix is said to be almost strictly sign regular if all its nontrivial minors of the same order have the same strict sign. In this paper, some nice properties related with the application of Neville elimination with two-determinant pivoting strategy to almost strictly sign regular matrices are presented.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Comparing pivoting strategies for almost strictly sign regular matrices

  • Alonso, P.
  • Peña, J.M.
  • Serrano, M.L.
In this paper some properties of two-determinant pivoting for Neville elimination are presented. In particular, we consider a zero-increasing property and we show an optimal normwise growth factor. Comparisons with other pivoting strategies for Neville elimination and with Gaussian elimination with partial pivoting of almost strictly sign regular matrices are performed. Numerical examples are included.