On the Distribution of the Cardinality of Row Space for Boolean Matrices

ＯｎｔｈｅＤｉｓｔｒｉｂｕｔｉｏｎｏｆｔｈｅＣａｒｄｉｎａｌｉｔｙｏｆＲｏｗＳｐａｃｅｆｏｒＢｏｏｌｅａｎＭａｔｒｉｃｅｓＬｉＷｅｎ（黎稳）；ＺｈａｎｇＭａｏｃｈｅｎｇ（张谋成）ａｎｄＨｏｎｇＳｈａｏｆａｎｇ（洪绍芳）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔ...     

Hardy－Littlewood Theorems in Mixed Norm Spaces on Bounded Symmetric Domain of C~n

Ｈａｒｄｙ－ＬｉｔｔｌｅｗｏｏｄＴｈｅｏｒｅｍｓｉｎＭｉｘｅｄＮｏｒｍＳｐａｃｅｓｏｎＢｏｕｎｄｅｄＳｙｍｍｅｔｒｉｃＤｏｍａｉｎｏｆＣ~ｎ￥（乌兰哈斯）ＷｕｌａｎＨａｓｉ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＩｎｎｅｒＭｏｎｇｏｌｉａＮ?..     

The Global Existence of Solutions for a Cross-Diffusion System

ＴｈｅＧｌｏｂａｌＥｘｉｓｔｅｎｃｅｏｆＳｏｌｕｔｉｏｎｓｆｏｒａＣｒｏｓｓ－ＤｉｆｆｕｓｉｏｎＳｙｓｔｅｍ￥（娄元）（倪维明）（吴雅萍）ＹｕａｎＬｏｕ；Ｗｅｉ－ＭｉｎｇＮｉ（ＳｃｈｏｏｌｏｆＭａｔｈｅｍａｔｉｃｓ，ＵｎｉｖｅｒｓｉｔｙｏｆＭｉｎｎｅ...     

Strong Convergence Theorems for Perturbed Maximal Monotone Operators in Banach Spaces

ＳｔｒｏｎｇＣｏｎｖｅｒｇｅｎｃｅＴｈｅｏｒｅｍｓｆｏｒＰｅｒｔｕｒｂｅｄＭａｘｉｍａｌＭｏｎｏｔｏｎｅＯｐｅｒａｔｏｒｓｉｎＢａｎａｃｈＳｐａｃｅｓＷａｎｇＷｅｉｍｉｎ（王为民）ＺｈａｏＹｉｃｈｕｎ（赵义纯）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａ...     

A Chaotic System May be Simple

ＡＣｈａｏｔｉｃＳｙｓｔｅｍＭａｙｂｅＳｉｍｐｌｅＬｉａｏＧｏｎｇｆｕ（廖公夫）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＪｉｌｉｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈａｎｇｃｈｕｎ，１３００２３）ＦａｎＱｉｎｊｉｅ（范钦杰）（Ｄｅｐａｒｔｍｅｎｔｏｆ...     

Closed Geodesics and Non一Differentiability of the Metric in Infinite－Dimensional Teichmuller Spaces

ＣｌｏｓｅｄＧｅｏｄｅｓｉｃｓａｎｄＮｏｎ一ＤｉｆｆｅｒｅｎｔｉａｂｉｌｉｔｙｏｆｔｈｅＭｅｔｒｉｃｉｎＩｎｆｉｎｉｔｅ－ＤｉｍｅｎｓｉｏｎａｌＴｅｉｃｈｍｕｌｌｅｒＳｐａｃｅｓＬｉｚｈｏｎｇ（李忠）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，...     

On the Convergence of Iterative Difference Method with Nonuniform Meshes for Quasilinear Parabolic Systems

ＯｎｔｈｅＣｏｎｖｅｒｇｅｎｃｅｏｆＩｔｅｒａｔｉｖｅＤｉｆｆｅｒｅｎｃｅＭｅｔｈｏｄｗｉｔｈＮｏｎｕｎｉｆｏｒｍＭｅｓｈｅｓｆｏｒＱｕａｓｉｌｉｎｅａｒ　Ｐａｒａｂｏｌｉｃ　Ｓｙｓｔｅｍｓ（周毓麟）（沈隆钧）（袁光伟）ＺｈｏｕＹｕｌｉｎ；ＳｈｅｎＬ...     

Semilinear Differential Inclusions in Separable Banach Spaces

Ｓｅｍｉｌｉｎｅａｒ　Ｄｉｆｆｅｒｅｎｔｉａｌ　Ｉｎｃｌｕｓｉｏｎｓ　ｉｎ　Ｓｅｐａｒａｂｌｅ　Ｂａｎａｃｈ　ＳｐａｃｅｓＸｕｅＸｉｎｇｍｅｉ（薛星美）ａｎｄＳｏｎｇＧｕｏｚｈｕ（宋国柱）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｎａｎｊｉｎ...     

Symmetric Duality and Self-duality for Nonsmooth Mathematical Programming

Ｓｙｍｍｅｔｒｉｃ　Ｄｕａｌｉｔｙ　ａｎｄ　Ｓｅｌｆ－ｄｕａｌｉｔｙ　ｆｏｒ　Ｎｏｎｓｍｏｏｔｈ　Ｍａｔｈｅｍａｔｉｃａｌ　ＰｒｏｇｒａｍｍｉｎｇＤｏｎｇＪｉａｌｉ（董加礼）（ＤｅｐａｒｔｍｅｎｔｏｆａｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓａ，Ｊｉｌｉｎ...     

Centre of Measure and Minimal Centre of Attraction for the Shift Maps on the Inverse Limit Spaces

ＣｅｎｔｒｅｏｆＭｅａｓｕｒｅａｎｄＭｉｎｉｍａｌＣｅｎｔｒｅｏｆＡｔｒａｃｔｉｏｎｆｏｒｔｈｅＳｈｉｆｔＭａｐｓｏｎｔｈｅＩｎｖｅｒｓｅＬｉｍｉｔＳｐａｃｅｓ＊）ＧｕＲｏｎｇｂａｏ（顾荣宝）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ａｎｈｕ...     

块对角占优性的推广与特征值分布

本文引入了若干矩阵块对角占优性概念，并利用Ｎｏｗｏｓａｄ和Ｈｏｆｆｍａｎ提出的Ｇ－ｂｉｂ ｏｖｔ ｓｖ。     

矩阵方程AV+BW=EVF的一种新的解析通解

该文给出了矩阵方程AV+BW=EVF的一种新的解析通解。该通解是一组自由参向量的显式线性表示，其系数阵是依赖于矩阵F的特征值的数值矩阵。因通解中仅含数值矩阵计算，这为应用计算机求解创造了方便。     

On computation of real eigenvalues of matrices via the Adomian decomposition

The problem of matrix eigenvalues is encountered in various fields of engineering endeavor. In this paper, a new approach based on the Adomian decomposition method and the Faddeev-Leverrier’s algorithm is presented for finding real eigenvalues of any desired real matrices. The method features accuracy and simplicity. In contrast to many previous techniques which merely afford one specific eigenvalue of a matrix, the method has the potential to provide all real eigenvalues. Also, the method does not require any initial guesses in its starting point unlike most of iterative techniques. For the sake of illustration, several numerical examples are included.     

Absolutely continuous spectra for matrix Dirac systems

This paper investigates the matrix Dirac systems. Under some conditions on the potential matrices, it is shown that the spectrum of the Dirac operator is purely absolutely continuous outside the gaps containing the eigenvalues of q.     

Estimates for the real and imaginary parts of the eigenvalues of matrices and applications

This paper is a continuation of our recent work on the localization of the eigenvalues of matrices. We give new bounds for the real and imaginary parts of the eigenvalues of matrices. Applications to the localization of the zeros of polynomials are also given.     

Inequalities for hadamard product and unitarily invariant norms of matrices

The paper contains some general theorems for Hadamard product of matrices which in particular include Fiedler's Theorem and a better bound for an inequality on product of eigenvalues of certain matrices due to Ando. Lieb's concavity Theorem has been proved using operator means. Some inequalities for unitarily invariant norms have also been proved.     

Inequalities for hadamard product and unitarily invariant norms of matrices

The paper contains some general theorems for Hadamard product of matrices which in particular include Fiedler's Theorem and a better bound for an inequality on product of eigenvalues of certain matrices due to Ando. Lieb's concavity Theorem has been proved using operator means. Some inequalities for unitarily invariant norms have also been proved.     

Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems

We present theoretical and numerical comparisons between Arnoldi and nonsymmetric Lanczos procedures for computing eigenvalues of nonsymmetric matrices. In exact arithmetic we prove that any type of eigenvalue convergence behavior obtained using a nonsymmetric Lanczos procedure may also be obtained using an Arnoldi procedure but on a different matrix and with a different starting vector. In exact arithmetic we derive relationships between these types of procedures and normal matrices which suggest some interesting questions regarding the roles of nonnormality and of the choice of starting vectors in any characterizations of the convergence behavior of these procedures. Then, through a set of numerical experiments on a complex Arnoldi and on a complex nonsymmetric Lanczos procedure, we consider the more practical question of the behavior of these procedures when they are applied to the same matrices.This work was supported by NSF grant GER-9450081 while the author was visiting the University of Maryland.     

On spectral radii of matrices governing some numerical estimating algorithms with incomplete data

Many estimating procedures are carried out with incomplete data by means of different types of EM algorithms. They allow us to obtain maximum likelihood parameter estimates in classical inference and also estimates based on the posterior mode in Bayesian inference. This paper analyzes in detail the spectral radii of the Jacobian matrices algorithm as a possible way to evaluate convergence rates. The eigenvalues of such matrices are explicitly obtained in some cases and, in all of them, a geometric convergence rate is, at least, guaranteed near the optimum. Finally, a comparison between the leading eigenvalues of EM and direct and approximate EM-Bayes algorithms may suggest the efficiency of each case.     

On spectral radii of matrices governing some numerical estimating algorithms with incomplete data

Summary Many estimating procedures are carried out with incomplete data by means of different types of EM algorithms. They allow us to obtain maximum likelihood parameter estimates in classical inference and also estimates based on the posterior mode in Bayesian inference. This paper analyzes in detail the spectral radii of the Jacobian matrices algorithm as a possible way to evaluate convergence rates. The eigenvalues of such matrices are explicitly obtained in some cases and, in all of them, a geometric convergence rate is, at least, guaranteed near the optimum. Finally, a comparison between the leading eigenvalues of EM and direct and approximate EM-Bayes algorithms may suggest the efficiency of each case.