Structural backward stability in rational eigenvalue problems solved via block Kronecker linearizations

by   Froilán M. Dopico, et al.

We study the backward stability of running a backward stable eigenstructure solver on a pencil S(λ) that is a strong linearization of a rational matrix R(λ) expressed in the form R(λ)=D(λ)+ C(λ I_ℓ-A)^-1B, where D(λ) is a polynomial matrix and C(λ I_ℓ-A)^-1B is a minimal state-space realization. We consider the family of block Kronecker linearizations of R(λ), which are highly structured pencils. Backward stable eigenstructure solvers applied to S(λ) will compute the exact eigenstructure of a perturbed pencil S(λ):=S(λ)+Δ_S(λ) and the special structure of S(λ) will be lost. In order to link this perturbed pencil with a nearby rational matrix, we construct a strictly equivalent pencil S(λ) to S(λ) that restores the original structure, and hence is a block Kronecker linearization of a perturbed rational matrix R(λ) = D(λ)+ C(λ I_ℓ- A)^-1 B, where D(λ) is a polynomial matrix with the same degree as D(λ). Moreover, we bound appropriate norms of D(λ)- D(λ), C - C, A - A and B - B in terms of an appropriate norm of Δ_S(λ). These bounds may be inadmissibly large, but we also introduce a scaling that allows us to make them satisfactorily tiny. Thus, for this scaled representation, we prove that the staircase and the QZ algorithms compute the exact eigenstructure of a rational matrix R(λ) that can be expressed in exactly the same form as R(λ) with the parameters defining the representation very near to those of R(λ). This shows that this approach is backward stable in a structured sense.


page 1

page 2

page 3

page 4


Backward Error of Matrix Rational Function

We consider a minimal realization of a rational matrix functions. We per...

A Provably Componentwise Backward Stable O(n^2) QR Algorithm for the Diagonalization of Colleague Matrices

The roots of a monic polynomial expressed in a Chebyshev basis are known...

Structured backward errors in linearizations

A standard approach to compute the roots of a univariate polynomial is t...

Strongly minimal self-conjugate linearizations for polynomial and rational matrices

We prove that we can always construct strongly minimal linearizations of...

Symbolic-Numeric Integration of Rational Functions

We consider the problem of symbolic-numeric integration of symbolic func...

Iterations for the Unitary Sign Decomposition and the Unitary Eigendecomposition

We construct fast, structure-preserving iterations for computing the sig...

Backward error analysis of the Lanczos bidiagonalization with reorthogonalization

The k-step Lanczos bidiagonalization reduces a matrix A∈ℝ^m× n into a bi...

Please sign up or login with your details

Forgot password? Click here to reset