Eigenvalue perturbation theory of symplectic,orthogonal, and unitary matrices under generic structured rank one perturbations

We study the perturbation theory of structured matrices under structured rank one perturbations, with emphasis on matrices that are unitary, orthogonal, or symplectic with respect to an indefinite inner product. The rank one perturbations are not necessarily of arbitrary small size (in the sense of norm). In the case of sesquilinear forms, results on selfadjoint matrices can be applied to unitary matrices by using the Cayley transformation, but in the case of real or complex symmetric or skew-symmetric bilinear forms additional considerations are necessary. For complex symplectic matrices, it turns out that generically (with respect to the perturbations) the behavior of the Jordan form of the perturbed matrix follows the pattern established earlier for unstructured matrices and their unstructured perturbations, provided the specific properties of the Jordan form of complex symplectic matrices are accounted for. For instance, the number of Jordan blocks of fixed odd size corresponding to the eigenvalue 1 or ?1 have to be even. For complex orthogonal matrices, it is shown that the behavior of the Jordan structures corresponding to the original eigenvalues that are not moved by perturbations follows again the pattern established earlier for unstructured matrices, taking into account the specifics of Jordan forms of complex orthogonal matrices. The proofs are based on general results developed in the paper concerning Jordan forms of structured matrices (which include in particular the classes of orthogonal and symplectic matrices) under structured rank one perturbations. These results are presented and proved in the framework of real as well as of complex matrices.     

Eigenvector sensitivity under general and structured perturbations of tridiagonal Toeplitz‐type matrices

The sensitivity of eigenvalues of structured matrices under general or structured perturbations of the matrix entries has been thoroughly studied in the literature. Error bounds are available, and the pseudospectrum can be computed to gain insight. Few investigations have focused on analyzing the sensitivity of eigenvectors under general or structured perturbations. This paper discusses this sensitivity for tridiagonal Toeplitz and Toeplitz‐type matrices.     

Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations

udy the perturbation theory of structured matrices under structured rank one perturbations, and then focus on several classes of complex matrices. Generic Jordan structures of perturbed matrices are identified. It is shown that the perturbation behavior of the Jordan structures in the case of singular J-Hamiltonian matrices is substantially different from the corresponding theory for unstructured generic rank one perturbation as it has been studied in [18, 28, 30, 31]. Thus a generic structured perturbation would not be generic if considered as an unstructured perturbation. In other settings of structured matrices, the generic perturbation behavior of the Jordan structures, within the confines imposed by the structure, follows the pattern of that of unstructured perturbations.     

On eigenvalue perturbation bounds for Hermitian block tridiagonal matrices

In this paper, we give some structured perturbation bounds for generalized saddle point matrices and Hermitian block tridiagonal matrices. Our bounds improve some existing ones. In particular, the proposed bounds reveal the sensitivity of the eigenvalues with respect to perturbations of different blocks. Numerical examples confirm the theoretical results.     

Reduction of matrices by means of equivalent transformations and similarity transformations

The structure of polynomial matrices in connection with their reducibility by semiscalar-equivalent transformations and similarity transformations to simpler forms is considered. In particular, the canonical form of polynomial matrices without multiple characteristic roots with respect to the above transformations is indicated. This allows one to establish a canonical form with respect to similarity for a certain type of finite collections of numerical matrices. Translated fromMatematicheskie Zametki, Vol. 64, No. 5, pp. 769–782, November, 1998.     

Perturbation theory of selfadjoint matrices and sign characteristics under generic structured rank one perturbations

For selfadjoint matrices in an indefinite inner product, possible canonical forms are identified that arise when the matrix is subjected to a selfadjoint generic rank one perturbation. Genericity is understood in the sense of algebraic geometry. Special attention is paid to the perturbation behavior of the sign characteristic. Typically, under such a perturbation, for every given eigenvalue, the largest Jordan block of the eigenvalue is destroyed and (in case the eigenvalue is real) all other Jordan blocks keep their sign characteristic. The new eigenvalues, i.e. those eigenvalues of the perturbed matrix that are not eigenvalues of the original matrix, are typically simple, and in some cases information is provided about their sign characteristic (if the new eigenvalue is real). The main results are proved by using the well known canonical forms of selfadjoint matrices in an indefinite inner product, a version of the Brunovsky canonical form and on general results concerning rank one perturbations obtained.     

On tridiagonal conjugate-normal matrices

Conjugate-normal matrices play the same role in the theory of unitary congruences as conventional normal matrices do with respect to unitary similarities. Naturally, the properties of both matrix classes are fairly similar up to the distinction between the congruence and similarity. However, in certain respects, conjugate-normal matrices differ substantially from normal ones. Our goal in this paper is to indicate one of such distinctions. It is shown that none of the familiar characterizations of normal matrices having the irreducible tridiagonal form has a natural counterpart in the case of conjugate-normal matrices.     

Approximated structured pseudospectra

Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and structured pseudospectra, based on determining the spectra of many suitably chosen rank‐one or projected rank‐one perturbations of the given matrix is proposed. The choice of rank‐one or projected rank‐one perturbations is inspired by Wilkinson's analysis of eigenvalue sensitivity. Numerical examples illustrate that the proposed approach gives much better insight into the pseudospectra and structured pseudospectra than random or structured random rank‐one perturbations with lower computational burden. The latter approach is presently commonly used for the determination of structured pseudospectra.     

The unitary completion and QR iterations for a class of structured matrices

We consider the problem of completion of a matrix with a specified lower triangular part to a unitary matrix. In this paper we obtain the necessary and sufficient conditions of existence of a unitary completion without any additional constraints and give a general formula for this completion. The paper is mainly focused on matrices with the specified lower triangular part of a special form. For such a specified part the unitary completion is a structured matrix, and we derive in this paper the formulas for its structure. Next we apply the unitary completion method to the solution of the eigenvalue problem for a class of structured matrices via structured QR iterations.

     

Solvability of matrix equations in rings of quasi-diagonal matrices and similarity of matrix polynomials

A certain standard form is found for a complex matrix with respect to equivalent transformations by quasi-diagonal matrices. The solvability of certain matrix equations in the rings of quasi-diagonal matrices is examined using this standard form.     

The structured total least‐squares approach for non‐linearly structured matrices

In this paper, an extension of the structured total least‐squares (STLS) approach for non‐linearly structured matrices is presented in the so‐called ‘Riemannian singular value decomposition’ (RiSVD) framework. It is shown that this type of STLS problem can be solved by solving a set of Riemannian SVD equations. For small perturbations the problem can be reformulated into finding the smallest singular value and the corresponding right singular vector of this Riemannian SVD. A heuristic algorithm is proposed. Some examples of Vandermonde‐type matrices are used to demonstrate the improved accuracy of the obtained parameter estimator when compared to other methods such as least squares (LS) or total least squares (TLS). Copyright © 2002 John Wiley & Sons, Ltd.     

Backward errors for eigenvalues and eigenvectors of Hermitian,skew-Hermitian,H-even and H-odd matrix polynomials

We discuss the perturbation analysis for eigenvalues and eigenvectors of structured homogeneous matrix polynomials with Hermitian, skew-Hermitian, H-even and H-odd structure. We construct minimal structured perturbations (structured backward errors) such that an approximate eigenvalue and eigenvector pair (finite or infinite eigenvalues) is an exact eigenvalue eigenvector pair of an appropriately perturbed structured matrix polynomial. We present various comparisons with unstructured backward errors and previous backward errors constructed for the non-homogeneous case and show that our results generalize previous results.     

Linear relations of refined enumerations of alternating sign matrices

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices where in addition some left and right columns are fixed. The main result is a simple linear relation between the number of n×n alternating sign matrices where the top row as well as the left and the right column is fixed and the number of n×n alternating sign matrices where the two top rows and the bottom row are fixed. This may be seen as a first indication for the fact that the refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows as well as left and right columns can possibly be reduced to the refined enumerations where only some top and bottom rows are fixed. For the latter numbers we provide a system of linear equations that conjecturally determines them uniquely.     

Boundedness results for a certain third order nonlinear differential equation

Sufficient conditions for the existence of solutions to boundedness and ultimate boundedness problems associated to a certain third order nonlinear differential equation are given by means of the Lyapunov’s second method. The appropriate Lyapunov function is given explicitly. Our results complement some well known results on the third order differential equations in the literature.     

A dichotomy result about Hessenberg matrices associated with measures in the unit circle

We characterize Hessenberg matrices D associated with measures in the unit circle ν, which are matrix representations of compact and actually Hilbert Schmidt perturbations of the forward shift operator as those with recursion coefficients verifying , ie, associated with measures verifying Szegö condition. As a consequence, we obtain the following dichotomy result for Hessenberg matrices associated with measures in the unit circle: either D = S _R+ K ₂ with K ₂, a Hilbert Schmidt matrix, or there exists an unitary matrix U and a diagonal matrix Λ such that with K ₂, a Hilbert Schmidt matrix. Moreover, we prove that for 1 ≤ p ≤ 2, if , then D = S _R+ K _p with K _p an absolutely p summable matrix inducing an operator in the p Schatten class. Some applications are given to classify measures on the unit circle.     

On the stability of the cyclic reduction without back substitution for tridiagonal systems

Componentwise error analysis for a modification of the cyclic reduction without back substitution for a tridiagonal system is presented. We consider relative roundoff errors and equivalent perturbations, so the main supposition is that all the data is nonzero. First, backward analysis for the computation of each component of the solution in separate is presented. Bounds on the relative equivalent perturbations are obtained depending on two constants. From these bounds it is easy to obtain a componentwise forward error analysis. Then the two constants are defined for some special classes of matrices, i.e. diagonally dominant (row or column), symmetric positive definite, totally nonnegative andM-matrices, and it is shown that the bounds for these classes of matrices are small.The author was supported by Grants MM-211/92 and MM-434/94 from the National Scientific Research Fund of the Bulgarian Ministry of Education and Science.     

The Sine-Gordon-Equation with perturbation terms of power Jacobian elliptic functions

In this paper the Sine-Gordon-Equation (SGE) with some solvable perturbations is discussed in detail as well as physical conclusions are drawn.Unlike the usual form of perturbations in terms of trigonometric and hyperbolic functions, here, it is assumed that inhomogeneous terms appear as elliptic functions in quadratic powers.One suggests employing the analytic means for the investigation of some properties of special perturbed SGE which now has to be renamed into Jacobian-Gordon-Equation (JGE). New classes of JGE are introduced.     

Helton类算子及单值扩张性质

本文研究了Helton类算子在紧摄动下单值扩张性质的稳定性, 同时研究了2×2上三角算子矩阵在紧摄动下单值扩张性质的稳定性. 利用半Fredholm域的特点, 获得了2×2上三角算子矩阵具有单值扩张性质的稳定性的充分必要条件.     

Robust stability of Switched Boolean Networks with function perturbation

In genetic regulatory networks, gene mutations are one of natural phenomena, which attract much attention by biological researchers. In modeling gene networks using switched Boolean networks (SBNs), gene mutations can be described by function perturbations, which is a meaningful issue in analyzing function perturbation of SBNs. This paper studies robust stability of SBNs with function perturbation. With the help of semi-tensor product (STP) of matrices, one equivalent algebraic form of SBNs is established. By constructing two state sets, a criterion for global stability of SBNs under arbitrary switching signals is proposed. In order to relax the conditions of global stability, pointwise stabilizability and consistent stabilizability of SBNs are further considered. Based on state reachable sets, several criteria are established for the proposed kinds of stability. Finally, the obtained results are verified by two examples and lac operon in the Escherichia coli, respectively.