幂零矩阵子代数

本文较详细地描述了幂零矩阵子代数,并且获得了一些有趣的结果.     

逼近性质和广义快速衰减

将快速衰减性质推广到可以一致嵌入到Hilbert空间的离散空间, 证明了一些逼近性质和应用.     

Quick Approximation to Matrices and Applications

m ×n matrix A with entries between say −1 and 1, and an error parameter ε between 0 and 1, we find a matrix D (implicitly) which is the sum of simple rank 1 matrices so that the sum of entries of any submatrix (among the ) of (A−D) is at most εmn in absolute value. Our algorithm takes time dependent only on ε and the allowed probability of failure (not on m, n). We draw on two lines of research to develop the algorithms: one is built around the fundamental Regularity Lemma of Szemerédi in Graph Theory and the constructive version of Alon, Duke, Leffman, R?dl and Yuster. The second one is from the papers of Arora, Karger and Karpinski, Fernandez de la Vega and most directly Goldwasser, Goldreich and Ron who develop approximation algorithms for a set of graph problems, typical of which is the maximum cut problem. From our matrix approximation, the above graph algorithms and the Regularity Lemma and several other results follow in a simple way. We generalize our approximations to multi-dimensional arrays and from that derive approximation algorithms for all dense Max-SNP problems. Received: July 25, 1997     

Existence Uniqueness and Decay of Solution for Fractional Boussinesq Approximation

The Boussinesq approximation finds more and more frequent use in geological practice. In this paper, the asymptotic behavior of solution for fractional Boussinesq approximation is studied. After obtaining some a priori estimates with the aid of commutator estimate, we apply the Galerkin method to prove the existence of weak solution in the case of periodic domain. Meanwhile, the uniqueness is also obtained. Because the results obtained are independent of domain, the existence and uniqueness of the weak solution for Cauchy problem is also true. Finally, we use the Fourier splitting method to prove the decay of weak solution in three cases respectively.     

关于四元数矩阵的最佳逼近问题

通过使用四元数矩阵的广义奇异值分解,给出了四元数矩阵最佳逼近问题‖AHXA-C‖2F+‖BHXB-D‖2F=min, s.t. XH=X的一般表达式.     

一类矩阵方程的反中心对称最佳逼近解

利用矩阵的正交相似变换和广义奇异值分解,讨论了矩阵方程 AXB=C具有反中心对称解的充要条件,得到了解的具体表达式.然后应用Frobenius范数正交矩阵乘积不变性,在该方程的反中心对称解解集合中导出了与给定相同类型矩阵的最佳逼近解的表达式.     

拟遗传代数的Exact Borel子代数与主子代数

本文利用exactBorel子代数刻划了遗传代数,给出了basic拟遗传代数的主子代数是exactBorel子代数的充分必要条件．     

Decay Bounds on Eigenfunctions and the Singular Spectrum of Unbounded Jacobi Matrices

Bounds on the exponential decay of generalized eigenfunctionsof bounded and unbounded selfadjoint Jacobi matrices in are established. Two cases are considered separatelyand lead to different results: (i) the case in which the spectralparameter lies in a general gap of the spectrum of the Jacobimatrix and (ii) the case of a lower semibounded Jacobi matrixwith values of the spectral parameter below the spectrum. Itis demonstrated by examples that both results are sharp. Weapply these results to obtain a "many barriers-type" criterionfor the existence of square-summable generalized eigenfunctionsof an unbounded Jacobi matrix at almost every value of the spectralparameter in suitable open sets. In particular, this leads toexamples of unbounded Jacobi matrices with a spectral mobilityedge, i.e., a transition from purely absolutely continuous spectrumto dense pure point spectrum.     

Approximation of the Quadratic Numerical Range of Block Operator Matrices

In this paper we establish an approximation of the quadratic numerical range of bounded and unbounded block operator matrices by variational methods. Applications to Hain?CLüst operators are given.     

谱约束下反自反矩阵的最佳逼近问题

该文研究了反自反矩阵的逆特征值问题及其最佳逼近问题,建立了反自反矩阵的逆特征值问题有解的充要条件,得到了解的表达式.进一步,对于任意给定的n阶复矩阵,得到了相关最佳逼近问题解的表达式.     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

Lower Rank Approximation of Matrices Based on Fast and Robust Alternating Regression

We introduce fast and robust algorithms for lower rank approximation to given matrices based on robust alternating regression. The alternating least squares regression, also called criss-cross regression, was used for lower rank approximation of matrices, but it lacks robustness against outliers in these matrices. We use robust regression estimators and address some of the complications arising from this approach. We find it helpful to use high breakdown estimators in the initial iterations, followed by M estimators with monotone score functions in later iterations towards convergence. In addition to robustness, the computational speed is another important consideration in the development of our proposed algorithm, because alternating robust regression can be computationally intensive for large matrices. Based on a mix of the least trimmed squares (LTS) and Huber's M estimators, we demonstrate that fast and robust lower rank approximations are possible for modestly large matrices.     

Rank-One Approximation of Positive Matrices Based on Methods of Tropical Mathematics

Low-rank matrix approximation finds wide application in the analysis of big data, in recommendation systems on the Internet, for the approximate solution of some equations of mechanics, and in other fields. In this paper, a method for approximating positive matrices by rank-one matrices on the basis of minimization of log-Chebyshev distance is proposed. The problem of approximation reduces to an optimization problem having a compact representation in terms of an idempotent semifield in which the operation of taking the maximum plays the role of addition and which is often referred to as max-algebra. The necessary definitions and preliminary results of tropical mathematics are given, on the basis of which the solution of the original problem is constructed. Using the methods and results of tropical optimization, all positive matrices at which the minimum of approximation error is reached are found in explicit form. A numerical example illustrating the application of the rank-one approximation is considered.     

线性流形上对称自正交相似矩阵最佳逼近

讨论了线性流形上对称自正交相似矩阵的最小二乘解,得到了解的一般表达式,对于任意给定的矩阵A＊,在最小二乘解集中得到了的A的最佳逼近解.     

线性流形上双反对称矩阵的最佳逼近

本文讨论了线性流形上用双反对称矩阵构造给定矩阵的最佳逼近问题,给出问题解的表达式,最后给出求最佳逼近解的数值方法与数值算例.     

On the Approximation Numbers for the Finite Sections of Block Toeplitz Matrices

In this paper we discuss the asymptotic distribution of theapproximation numbers of the finite sections for a Toeplitzoperator and µ R, witha continuous matrix-valued generating function a. We prove thatthe approximation numbers of the finite sections T_n(a) = P_nT(a)P_nhave the k-splitting property, provided T(a) is a Fredholm operatoron . 2000 Mathematics SubjectClassification 47B35 (primary), 15A18, 47A58, 47A75, 65F20 (secondary).     

矩阵方程AX=B的双反对称最佳逼近解

本文主要讨论下而两个问题并得到相关结果:问题Ⅰ:给定A ∈ R~(k×n),B ∈ R~(k×n),求X ∈ BASR~(n×n),使得AX=B.问题Ⅱ:给定X* ∈R~(n×n),求X使得‖X-X~*‖=minX∈S_E‖X-X~*‖,其中S_E是问题Ⅰ的解集合,‖·‖是Frobenius范数.通过对上述问题的讨论给出了问题Ⅰ解存在的充分必要条件和其解的一般表达式同时给出了问题Ⅱ的解,算法,和数值例子.     

A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm 1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.     

Subalgebras of Orthomodular Lattices

Sachs (Can J Math 14:451–460, 1962) showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as well as by its poset of Boolean subalgebras BSub(L). The domain BSub(L) has recently found use in an approach to the foundations of quantum mechanics initiated by Butterfield and Isham (Int J Theor Phys 37(11):2669–2733, 1998, Int J Theor Phys 38(3):827–859, 1999), at least in the case where L is the orthomodular lattice of projections of a Hilbert space, or von Neumann algebra. The results here may add some additional perspective to this line of work.