Mathematics > Numerical Analysis
[Submitted on 3 Aug 2018 (v1), last revised 8 Aug 2018 (this version, v2)]
Title:The conditioning of block Kronecker $\ell$-ifications of matrix polynomials
View PDFAbstract:A strong $\ell$-ification of a matrix polynomial $P(\lambda)=\sum A_i\lambda^i$ of degree $d$ is a matrix polynomial $\mathcal{L}(\lambda)$ of degree $\ell$ having the same finite and infinite elementary divisors, and the same numbers of left and right minimal indices as $P(\lambda)$. Strong $\ell$-ifications can be used to transform the polynomial eigenvalue problem associated with $P(\lambda)$ into an equivalent polynomial eigenvalue problem associated with a larger matrix polynomial $\mathcal{L}(\lambda)$ of lower degree. Typically $\ell=1$ and, in this case, $\mathcal{L}(\lambda)$ receives the name of strong linearization. However, there exist some situations, e.g., the preservation of algebraic structures, in which it is more convenient to replace strong linearizations by other low degree matrix polynomials. In this work, we investigate the eigenvalue conditioning of $\ell$-ifications from a family of matrix polynomials recently identified and studied by Dopico, Pérez and Van Dooren, the so-called block Kronecker companion forms. We compare the conditioning of these $\ell$-ifications with that of the matrix polynomial $P(\lambda)$, and show that they are about as well conditioned as the original polynomial, provided we scale $P(\lambda)$ so that $\max\{\|A_i\|_2\}=1$, and the quantity $\min\{\|A_0\|_2,\|A_d\|_2\}$ is not too small. Moreover, under the scaling assumption $\max\{\|A_i\|_2\}=1$, we show that any block Kronecker companion form, regardless of its degree or block structure, is about as well-conditioned as the well-known Frobenius companion forms. Our theory is illustrated by numerical examples.
Submission history
From: Javier Pérez Álvaro [view email][v1] Fri, 3 Aug 2018 03:40:45 UTC (66 KB)
[v2] Wed, 8 Aug 2018 23:32:50 UTC (67 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.