矩阵的秧下界与方阵的非异性

<正> 在[2]、[3]、[4]中,已给出一串矩阵秩的下界估计式,并相应地讨论了几类所谓“迹占优”的方阵的非异性。但在理论上以及某些应用问题上,还需判断下列两类方阵的非异性:一是当方阵的主对角元出现负元,然其绝对值较大时;二是方阵之迹并不“占优”.但每一行的不同列上各有一个元素,使这些元素之绝对值的和“占优”。本文将首先讨论两个     

The Best Lower Bound for the Permanent of a Correlation Matrix of Rank Two

If 1≤k≤n, then Cor(n,k) denotes the set of all n×n real correlation matrices of rank not exceeding k. Grone and Pierce have shown that if A∈Cor (n, n-1), then per(A)≥n/(n-1). We show that if A∈Cor(n,2), then , and that this inequality is the best possible.     

矩阵的秩与零化多项式

从一道考研数学试题出发,深入探讨了矩阵的秩与零化多项式之间的内在联系,推广了已知的相关结果,给出了该类问题的一般处理技巧.     

矩阵的秩与零化多项式

从一道考研数学试题出发,深入探讨了矩阵的秩与零化多项式之间的内在联系,推广了已知的相关结果,给出了该类问题的一般处理技巧.     

The Permanent Rank of a Matrix

Define the perrank of a matrixAto be the size of the largest square submatrix ofAwith nonzero permanent. Motivated in part by the Alon–Jaeger–Tarsi Conjecture [3], we prove several results on perranks..     

RD-Rational Approximations of the Matrix Exponential

Restricted Denominator (RD) rational approximations to the matrix exponential operator are constructed by interpolation in points related to Krylov subspaces associated to a rational transform of the particular matrix considered. Convergence analysis are provided. Numerical experiments show the effectiveness of the proposed methods in applications involving discretizations of differential operators.     

A New Approximation of the Matrix Rank Function and Its Application to Matrix Rank Minimization

The matrix rank minimization problem is widely applied in many fields such as control, signal processing and system identification. However, the problem is NP-hard in general and is computationally hard to directly solve in practice. In this paper, we provide a new approximation function of the matrix rank function, and the corresponding approximation problems can be used to approximate the matrix rank minimization problem within any level of accuracy. Furthermore, the successive projected gradient method, which is designed based on the monotonicity and the Fréchet derivative of these new approximation function, can be used to solve the matrix rank minimization this problem by using the projected gradient method to find the stationary points of a series of approximation problems. Finally, the convergence analysis and the preliminary numerical results are given.     

一类矩阵多项式秩的恒等式

得到了一类矩阵多项式秩的恒等式,改进和推广了近期的一些结果.     

Structured Low Rank Approximation of a Bezout Matrix

The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given Bezout matrix a new Bezout matrix of lower rank whose entries are near the corresponding entries of that input matrix. We present an algorithm based on a version of structured nonlinear total least squares (SNTLS) method for computing approximate GCD and demonstrate the practical performance of our algorithm on a diverse set of univariate polynomials. The work is partially supported by a National Key Basic Research Project of China 2004CB318000 and Chinese National Science Foundation under Grant 10401035.     

关于三幂等矩阵的秩特征的研究

本文对已有的关于三幂等矩阵秩的等式作了进一步研究,指出其中有些可以作为判定三幂等矩阵的充要条件,即三幂等矩阵的秩特征等式,本文还证明了有无穷多种三幂等矩阵的秩特征等式形式．     

一类矩阵多项式的秩特征

给出了一类矩阵多项式的秩特征定理及它的多种证法.     

矩阵的满秩正交分解

旨在给出矩阵一种新分解(满秩正交分解).分解简单易求,且与矩阵的奇异值分解有类似的性质和应用.     

Rank Properties in Finite Semigroups II: The Small Rank and the Large Rank

This paper is concerned with the application of two possible definitions of rank to certain well-known semigroups.AMS Subject Classification (2000), 20M10     

四元数向量和矩阵的秩

在四元数和四元数向量、矩阵空间上引入三种不同的实表示法则，将四元数列向量的左右线性相关性问题转换成实数域上向量的线性相关问题，由此获得用实矩阵的秩代替四元数矩阵列左秩和列右秩计算方法，同时得出四元数矩阵可逆的一些充要条件和一些新的四元数行列式定义．     

基于模糊不变子群的上、下近似

研究群中集合的粗糙近似问题。利用分解定理和表现定理,定义了群中集合关于模糊不变子群的上、下近似,并给出了近似算子的性质。证明了子群的上、下近似在同态映射下的不变性质。     

三个矩阵秩不等式的多种证明

针对线性代数课程教学中三个矩阵秩的不等式的证明展开研究,对每一个不等式,分别给出相应的证明。     

线性映射视角下矩阵的秩

向量空间之间的线性映射是线性代数研究的主要内容之一.从线性映射的视角考察线性代数知识可以更清晰地认识线性代数中重要知识点的本质.利用线性映射知识,对矩阵秩的几个重要命题给出了比较简洁的证明.     

两个矩阵秩等式的推广

给出文[1]建立的两个矩阵秩等式的统一推广.