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): 6
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)

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.