Abstract
AbstractA number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory, that relates perturbations in the linearization to equivalent perturbations in the corresponding matrix polynomial, is needed. In this paper we develop an algorithm that finds which perturbation of matrix coefficients of a matrix polynomial corresponds to a given perturbation of the entire linearization pencil. Moreover we find transformation matrices that, via strict equivalence, transform a perturbation of the linearization to the linearization of a perturbed polynomial. For simplicity, we present the results for the first companion linearization but they can be generalized to a broader class of linearizations.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference32 articles.
1. Antoniou, E., Vologiannidis, S.: A new family of companion forms of polynomial matrices. Electron. J. Linear Algebra 11, 78–87 (2004)
2. Avron, H., Druinsky, A., Toledo, S.: Spectral condition-number estimation of large sparse matrices. arXiv:1301.1107 (2013)
3. Betcke, T., Higham, N., Mehrmann, V., Schröder, C., Tisseur, F.: NLEVP: a collection of nonlinear eigenvalue problems. ACM Trans. Math. Softw. 39(2), 7:1–7:28 (2013)
4. Byers, R., He, C., Mehrmann, V.: Where is the nearest non-regular pencil? Linear Algebra Appl. 285(1), 81–105 (1998)
5. Chehab, J.-P., Raydan, M.: Geometrical properties of the Frobenius condition number for positive definite matrices. Linear Algebra Appl. 429(8), 2089–2097 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献