不变子空间上特征值的扰动

1引言设矩阵A∈C~(n×n),B∈C~(m×m),Q∈C~(n×m)为列满秩矩阵,令R=AQ-QB．当R的范数很小的时候,我们分析矩阵B的特征值对A的特征值的逼近性．当A,B都是Hermite阵时,上述问题已经被Kahan解决．近年来,对可对角化矩阵的情形,取得了一些新的成果．[4][5][6]中给出了几个范数不等式,并应用于矩阵特征值     

Perturbation analysis of singular subspaces and deflating subspaces

Summary. Perturbation expansions for singular subspaces of a matrix and for deflating subspaces of a regular matrix pair are derived by using a technique previously described by the author. The perturbation expansions are then used to derive Fr\'echet derivatives, condition numbers, and th-order perturbation bounds for the subspaces. Vaccaro's result on second-order perturbation expansions for a special class of singular subspaces can be obtained from a general result of this paper. Besides, new perturbation bounds for singular subspaces and deflating subspaces are derived by applying a general theorem on solution of a system of nonlinear equations. The results of this paper reveal an important fact: Each singular subspace and each deflating subspace have individual perturbation bounds and individual condition numbers. Received July 26, 1994     

由给定的子空间构造新的子空间

本给出并证明了若干个子空间的并以及两个子空间的基构成子空间的充要条件，从而本质地揭示了除子空间的交与和是构造新的予空间的方法外，集合的其它运算不能构造新的子空间，最后分析了子空间直和的两种不同定义的优缺点，指出了张禾瑞教材中子空间直和定义推广时应注意的一个问题。     

不变子空间与广义不变子空间——(Ⅱ)扰动定理

关于矩阵的不变子空间,自然会提出这样一个扰动问题:设Z_1∈C~(n×l)是A∈C~(n×n)的一个特征矩阵,若E∈C~(n×n)是一个扰动矩阵,问A+B是否存在特征矩阵Z_1,使得(Z_1)靠近R(Z_1)?关于矩阵对的广义不变子空间.也可以类似地提出问题。 对于这些问题,G.W.Stewart曾经讨论过,他的方法的关键是构造一种求解二次矩阵方程的迭代过程,用来逼近矩阵的一个不变子空间;而本文建议另一种迭代格式,用这种迭代逼近一个不变(或广义不变)子空间,具有二次收敛速度。     

Hilbert空间中的子空间框架

本文运用算子理论方法,讨论了Hilbert空间H中的子空间框架和子空间框架算子的性质,研究了子空间框架的摄动,给出了一些有意义的结果.     

Integrable Teichmüller spaces

A new kind of subspaces of the universal Teichmüller space is introduced. Some characterizations of the subspaces are given in terms of univalent functions, Beltrami coefficients and quasisymmetric homeomorphisms of the boundary of the unit disc.     

Wavelet frames for (not necessarily reducing) affine subspaces II: The structure of affine subspaces

This is a continuation of the investigation into the theory of wavelet frames for general affine subspaces. The main focus of this paper is on the structural properties of affine subspaces. We show that every affine subspace is the orthogonal direct sum of at most three purely non-reducing subspaces, while every reducing subspace (with respect to the dilation and translation operators) is the orthogonal direct sum of two purely non-reducing ones. This result is obtained through considering the basic question as to when the orthogonal complement of an affine subspace in another one is still affine. Motivated by the fundamental question as to whether every affine subspace is singly-generated, and by a recent result that every singly generated purely non-reducing subspace admits a singly generated wavelet frame, we prove that every affine subspace can be decomposed into the direct sum of a singly generated affine subspace and some space of “small size”. As a consequence we establish a connection between the above mentioned two questions.     

Perturbation bounds for means of eigenvalues and invariant subspaces

When a matrix is close to a matrix with a multiple eigenvalue, the arithmetic mean of a group of eigenvalues is a good approximation to this multiple eigenvalue. A theorem of Gershgorin type for means of eigenvalues is proved and applied as a perturbation theorem for a degenerate matrix.For a multiple eigenvalue we derive bounds for computed bases of subspaces of eigenvectors and principal vectors, relating them to the spaces spanned by the last singular vectors of corresponding powers of the matrix. These bounds assure that, provided the dimensionalities are chosen appropriately, the angles of rotation of the subspaces are of the same order of magnitude as the perturbation of the matrix.A numerical example is given.     

Factoring matrices into the product of two matrices

Linear algebra of factoring a matrix into the product of two matrices with special properties is developed. This is accomplished in terms of the so-called inverse of a matrix subspace which yields an extended notion for the invertibility of a matrix. The product of two matrix subspaces gives rise to a natural generalization of the concept of matrix subspace. Extensions of these ideas are outlined. Several examples on factoring are presented. AMS subject classification (2000)  15A23, 65F30     

利用有限向量空间的子空间构作二元(s,l)叠加码

一个二元叠加码(s,l)-码在许多领域有着极为广泛的应用.利用有限域F_q上的向量空间的子空间构作了矩阵M_q(m,d,k),并证明了它是一个(s,l)一码,计算了(s,l)-码的参数.     

Lur’e equations and even matrix pencils

In this work, we consider the so-called Lur’e matrix equations that arise e.g. in model reduction and linear-quadratic infinite time horizon optimal control. We characterize the set of solutions in terms of deflating subspaces of even matrix pencils. In particular, it is shown that there exist solutions which are extremal in terms of definiteness. It is shown how these special solutions can be constructed via deflating subspaces of even matrix pencils.     

关于线性子空间交的基

给出求两个子空间交的基的一般方法     

C^n中子空间之间极端主角的一些应用

本文给出了Ｃ＾ｎ中子空间之间最大和最小主角在矩阵逼近，投影算子的扰动分析，群逆以及Ｏｒａｘｉｎ逆的扰动估计，条件数理论，Ｂｏｔｔ－Ｄｕｆｆｉｎ系统扰动分析中一些应用。     

Towards backward perturbation bounds for approximate dual Krylov subspaces

Given a matrix A,n by n, and two subspaces K and L of dimension m, we consider how to determine a backward perturbation E whose norm is as small as possible, such that k and L are Krylov subspaces of A+E and its adjoint, respectively. We first focus on determining a perturbation matrix for a given pair of biorthonormal bases, and then take into account how to choose an appropriate biorthonormal pair and express the Krylov residuals as a perturbation of the matrix A. Specifically, the perturbation matrix is globally optimal when A is Hermitian and K=L. The results show that the norm of the perturbation matrix can be assessed by using the norms of the Krylov residuals and those of the biorthonormal bases. Numerical experiments illustrate the efficiency of our strategy.     

Characterization of the closedness of the sum of two shift-invariant spaces

We first present a formula for the supremum cosine angle between two closed subspaces of a separable Hilbert space under the assumption that the ‘generators’ form frames for the subspaces. We then characterize the conditions that the sum of two, not necessarily finitely generated, shift-invariant subspaces of L²(Rd) be closed. If the fibers of the generating sets of the shift-invariant subspaces form frames for the fiber spaces a.e., which is satisfied if the shift-invariant subspaces are finitely generated or if the shifts of the generating sets form frames for the respective subspaces, then the characterization is given in terms of the norms of possibly infinite matrices. In particular, if the shift-invariant subspaces are finitely generated, then the characterization is given wholly in terms of the norms of finite matrices.     

A Lanczos-type method for multiple starting vectors

Given a square matrix and single right and left starting vectors, the classical nonsymmetric Lanczos process generates two sequences of biorthogonal basis vectors for the right and left Krylov subspaces induced by the given matrix and vectors. In this paper, we propose a Lanczos-type algorithm that extends the classical Lanczos process for single starting vectors to multiple starting vectors. Given a square matrix and two blocks of right and left starting vectors, the algorithm generates two sequences of biorthogonal basis vectors for the right and left block Krylov subspaces induced by the given data. The algorithm can handle the most general case of right and left starting blocks of arbitrary sizes, while all previously proposed extensions of the Lanczos process are restricted to right and left starting blocks of identical sizes. Other features of our algorithm include a built-in deflation procedure to detect and delete linearly dependent vectors in the block Krylov sequences, and the option to employ look-ahead to remedy the potential breakdowns that may occur in nonsymmetric Lanczos-type methods.

     

Symplectic geometry and dissipative differential operators

Everitt and Markus characterized the domains of self-adjoint differential operators in terms of Lagrangian subspaces of complex symplectic spaces. In this paper we define Dissipative and strictly Dissipative subspaces for complex symplectic spaces and characterize the domains of dissipative and strictly dissipative differential operators in terms of these subspaces.     

Perturbation Theory for Simultaneous Bases of Singular Subspaces

New perturbation theorems are proved for simultaneous bases of singular subspaces of real matrices. These results improve the absolute bounds previously obtained in [6] for general (complex) matrices. Unlike previous results, which are valid only for the Frobenius norm, the new bounds, as well as those in [6] for complex matrices, are extended to any unitarily invariant matrix norm. The bounds are complemented with numerical experiments which show their relevance for the algorithms computing the singular value decomposition. Additionally, the differential calculus approach employed allows to easily prove new sin perturbation theorems for singular subspaces which deal independently with left and right singular subspaces.     

The equations of a holomorphic subspace in a complex Finsler space

In [Mu1] we underlined the motifs of holomorphic subspaces in a complex Finsler space: induced nonlinear connection, coupling connections, and the induced tangent and normal connections. In the present paper we investigate the equations of Gauss, H-and A-Codazzi, and Ricci equations of a holomorphic subspace. We deduce the link between the holomorphic curvatures of the Chern-Finsler connection and its induced tangent connection. Conditions for totally geodesic holomorphic subspaces are obtained. Communicated by János Szenthe     

Reconstruction of functions in spline subspaces from local averages

In this paper, we study the reconstruction of functions in spline subspaces from local averages. We present an average sampling theorem for shift invariant subspaces generated by cardinal B-splines and give the optimal upper bound for the support length of averaging functions. Our result generalizes an earlier result by Aldroubi and Gröchenig.