Conditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformations
From MaRDI portal
Publication:5207441
Abstract: M"{o}bius transformations have been used in numerical algorithms for computing eigenvalues and invariant subspaces of structured generalized and polynomial eigenvalue problems (PEPs). These transformations convert problems with certain structures arising in applications into problems with other structures and whose eigenvalues and invariant subspaces are easily related to the ones of the original problem. Thus, an algorithm that is efficient and stable for some particular structure can be used for solving efficiently another type of structured problem via an adequate M"{o}bius transformation. A key question in this context is whether these transformations may change significantly the conditioning of the problem and the backward errors of the computed solutions, since, in that case, their use may lead to unreliable results. We present the first general study on the effect of M"{o}bius transformations on the eigenvalue condition numbers and backward errors of approximate eigenpairs of PEPs. By using the homogeneous formulation of PEPs, we are able to obtain two clear and simple results. First, we show that, if the matrix inducing the M"{o}bius transformation is well conditioned, then such transformation approximately preserves the eigenvalue condition numbers and backward errors when they are defined with respect to perturbations of the matrix polynomial which are small relative to the norm of the polynomial. However, if the perturbations in each coefficient of the matrix polynomial are small relative to the norm of that coefficient, then the corresponding eigenvalue condition numbers and backward errors are preserved approximately by the M"{o}bius transformations induced by well-conditioned matrices only if a penalty factor, depending on those coefficients, is moderate. It is important to note that these simple results are no longer true if a non-homogeneous formulation is used.
Recommendations
- Möbius transformations of matrix polynomials
- Backward error and condition of polynomial eigenvalue problems
- On backward errors of structured polynomial eigenproblems solved by structure preserving linearizations
- Structured backward error analysis of linearized structured polynomial eigenvalue problems
- scientific article; zbMATH DE number 2185810
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1950436 (Why is no real title available?)
- scientific article; zbMATH DE number 802915 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A backward stable algorithm for quadratic eigenvalue problems
- A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
- A comparison of eigenvalue condition numbers for matrix polynomials
- A generalized structured doubling algorithm for the numerical solution of linear quadratic optimal control problems
- A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
- A step toward a unified treatment of continuous and discrete time control problems
- A structured staircase algorithm for skew-symmetric/symmetric pencils
- Accuracy and Stability of Numerical Algorithms
- An algorithm for the complete solution of quadratic eigenvalue problems
- Backward Error of Polynomial Eigenproblems Solved by Linearization
- Backward error and condition of polynomial eigenvalue problems
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
- Functions of Matrices
- Matrix polynomials with completely prescribed eigenstructure
- Möbius transformations of matrix polynomials
- NLEVP, a collection of nonlinear eigenvalue problems
- Normwise Scaling of Second Order Polynomial Matrices
- On condition numbers of polynomial eigenvalue problems
- Palindromic companion forms for matrix polynomials of odd degree
- Perturbation theory for homogeneous polynomial eigenvalue problems
- Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
- Spectral equivalence of matrix polynomials and the index sum theorem
- Structure preserving deflation of infinite eigenvalues in structured pencils
- Structured Hölder condition numbers for multiple eigenvalues
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Structured backward error analysis of linearized structured polynomial eigenvalue problems
- Structured strong linearizations from Fiedler pencils with repetition. I.
- The Conditioning of Linearizations of Matrix Polynomials
- The autonomous linear quadratic control problem. Theory and numerical solution
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Triangularizing quadratic matrix polynomials
Cited in
(3)
This page was built for publication: Conditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207441)
