Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Structured backward error analysis of linearized structured polynomial eigenvalue problems
HTML articles powered by AMS MathViewer

by Froilán M. Dopico, Javier Pérez and Paul Van Dooren HTML | PDF
Math. Comp. 88 (2019), 1189-1228 Request permission

Abstract:

We start by introducing a new class of structured matrix polynomials, namely, the class of $\mathbf {M}_A$-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-) palindromic, and alternating matrix polynomials. Then, we introduce the families of $\mathbf {M}_A$-structured strong block minimal bases pencils and of $\mathbf {M}_A$-structured block Kronecker pencils, which are particular examples of block minimal bases pencils recently introduced by Dopico, Lawrence, Pérez and Van Dooren, and show that any $\mathbf {M}_A$-structured odd-degree matrix polynomial can be strongly linearized via an $\mathbf {M}_A$-structured block Kronecker pencil. Finally, for the classes of (skew-)symmetric, (anti-)palindromic, and alternating odd-degree matrix polynomials, the $\mathbf {M}_A$-structured framework allows us to perform a global and structured backward stability analysis of complete structured polynomial eigenproblems, regular or singular, solved by applying to a $\mathbf {M}_A$-structured block Kronecker pencil a structurally backward stable algorithm that computes its complete eigenstructure, like the palindromic-QR algorithm or the structured versions of the staircase algorithm. This analysis allows us to identify those $\mathbf {M}_A$-structured block Kronecker pencils that yield a computed complete eigenstructure which is the exact one of a slightly perturbed structured matrix polynomial. These pencils include (modulo permutations) the well-known block-tridiagonal and block-anti-tridiagonal structure-preserving linearizations. Our analysis incorporates structure to the recent (unstructured) backward error analysis performed for block Kronecker linearizations by Dopico, Lawrence, Pérez and Van Dooren, and share with it its key features, namely, it is a rigorous analysis valid for finite perturbations, i.e., it is not a first order analysis, it provides precise bounds, and it is valid simultaneously for a large class of structure-preserving strong linearizations.
References
Similar Articles
Additional Information
  • Froilán M. Dopico
  • Affiliation: Departamento de Matemáticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, 28911, Leganés, Spain
  • MR Author ID: 664010
  • Email: dopico@math.uc3m.es
  • Javier Pérez
  • Affiliation: Department of Mathematical Sciences, University of Montana, Montana
  • Email: javier.perez-alvaro@mso.umt.edu
  • Paul Van Dooren
  • Affiliation: Department of Mathematical Engineering, Université catholique de Louvain, Avenue Georges Lemaître 4, B-1348 Louvain-la-Neuve, Belgium
  • MR Author ID: 176855
  • Email: paul.vandooren@uclouvain.be
  • Received by editor(s): January 12, 2017
  • Received by editor(s) in revised form: July 25, 2017, January 10, 2018, and January 23, 2018
  • Published electronically: June 14, 2018
  • Additional Notes: The first author was supported by Ministerio de Economía, Industria y Competitividad of Spain and Fondo Europeo de Desarrollo Regional (FEDER) of EU through grants MTM-2015-68805-REDT, MTM-2015-65798-P (MINECO/FEDER, UE)
    The second author was supported by KU Leuven Research Council grant OT/14/074.
    The second and third authors were supported by the Belgian network DYSCO (Dynamical Systems, Control, and Optimization), funded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office
  • © Copyright 2018 American Mathematical Society
  • Journal: Math. Comp. 88 (2019), 1189-1228
  • MSC (2010): Primary 65F15, 15A18, 15A21, 15A22, 15A54, 93B18
  • DOI: https://doi.org/10.1090/mcom/3360
  • MathSciNet review: 3904143