Factoring Block Fiedler Companion Matrices
- 625 Downloads
When Fiedler published his “A note on Companion matrices” in 2003 on Linear Algebra and its Applications, he could not have foreseen the significance of this elegant factorization of a companion matrix into essentially two-by-two Gaussian transformations, which we will name (scalar) elementary Fiedler factors. Since then, researchers extended these results and studied the various resulting linearizations, the stability of Fiedler companion matrices, factorizations of block companion matrices, Fiedler pencils, and even looked at extensions to non-monomial bases. In this chapter, we introduce a new way to factor block Fiedler companion matrices into the product of scalar elementary Fiedler factors. We use this theory to prove that, e.g. a block (Fiedler) companion matrix can always be written as the product of several scalar (Fiedler) companion matrices. We demonstrate that this factorization in terms of elementary Fiedler factors can be used to construct new linearizations. Some linearizations have notable properties, such as low bandwidth, or allow for factoring the coefficient matrices into unitary-plus-low-rank matrices. Moreover, we will provide bounds on the low-rank parts of the resulting unitary-plus-low-rank decomposition. To present these results in an easy-to-understand manner, we rely on the flow-graph representation for Fiedler matrices recently proposed by Del Corso and Poloni in Linear Algebra and its Applications, 2017.
KeywordsCompanion matrix Fiedler linearizations
The research of the first three authors was partially supported by GNCS projects “Metodi numerici avanzati per equazioni e funzioni di matrici con struttura” and “Tecniche innovative per problemi di algebra lineare”; the research of the first two was also supported by University of Pisa under the grant PRA-2017-05. The research of the fourth author was supported by the Research Council KU Leuven, project C14/16/056 (Inverse-free Rational Krylov Methods: Theory and Applications).
- 1.Anguas, L.M., Bueno, M.I., Dopico, F.M.: A comparison of eigenvalue condition numbers for matrix polynomials, arXiv preprint arXiv:1804.09825 (2018)Google Scholar
- 6.Aurentz, J.L., Mach, T., Robol, L., Vandebril, R., Watkins, D.S.: Core-Chasing Algorithms for the Eigenvalue Problem, vol. 13 of Fundamentals of Algorithms. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2018)Google Scholar
- 10.Bevilacqua, R., Del Corso, G.M., Gemignani, L.: Fast QR iterations for unitary plus low-rank matrices, arXiv preprint arXiv:1810.0270 (2018)Google Scholar
- 15.Boito, P., Eidelman, Y., Gemignani, L.: A real QZ algorithm for structured companion pencils, arXiv preprint arXiv:1608.05395 (2016)Google Scholar
- 26.Dopico, F.M., Lawrence, P.W., Pérez, J., Van Dooren, P.: Block Kronecker linearizations of matrix polynomials and their backward errors, arXiv preprint arXiv:1707.04843 (2017)Google Scholar
- 32.Raz, R.: On the complexity of matrix product. In: Proceedings of the Thirty-fourth Annual ACM Symposium on Theory of Computing, STOC ’02, New York, NY, USA, ACM, pp. 144–151 (2002)Google Scholar
- 35.Van Barel, M., Tisseur., F.: Polynomial eigenvalue solver based on tropically scaled Lagrange linearization. Linear Algebra Appl. 542, 186–208 (2018)Google Scholar