Pasar al contenido principal

ALGEBRA LINEAL NUMERICA ESTRUCTURADA: POLINOMIOS MATRICIALES, MATRICES ESPECIALES Y CONDICIONAMIENTO

MTM2012-32542

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2012
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSIDAD CARLOS III DE MADRID
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

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)

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.