求解子矩阵约束条件下四元数矩阵方程AXB=C的矩阵半张量积方法

1引言子矩阵约束下的矩阵方程问题是指限定矩阵方程的解X的一个子矩阵X_(0),然后在某个约束集合中求解矩阵方程.如求满足X([1:q])=X_(0)的对称解,这里X([1:q])表示矩阵X的q阶顺序主子阵.子矩阵约束下的矩阵方程问题来源于实际中的系统扩张问题[1],有一定的实际意义和重要性,受到了许多学者的关注,如[2-4]中,彭分别研究了子矩阵约束条件下实矩阵方程AX=B的实矩阵解,中心对称解和双对称解.     

EP矩阵与矩阵方程的解

证明了如下结论:设A∈C~(n×n)是群可逆矩阵,则(i)A为EP矩阵当且仅当矩阵方程A~HXA=XAA~H在χ_A至少有一个解;(ii)A为EP矩阵当且仅当矩阵方程A~HXA=AA~HX在χ_A至少有一个解,其中χ_A={A,A~#,A~+,A~H,(A~#)~H,(A~+)~H}.     

分块带状矩阵的逆

1引言如果分块矩阵A=(A_(ij))_(n×n)满足A_(ij)=O(j-i＞p且i-j＞q),其中A_(ij)为m阶矩阵,则称A为(p,q)-分块带状矩阵．分块带状矩阵在一些实际问题中经常出现,例如在量子场论中用途很广的非线性Schr(?)dinger方程的差分离散问题,解热传导问题等,都会遇到分块带状矩阵．常见的分块三对角矩阵,分块五对角矩阵都是特殊的分块带状矩阵．采用通常的方法求解分块带状矩阵的逆矩阵时,需要进行O(n~3)次m阶矩阵的运算．本文首先将分块带状矩阵扩充成可逆的分块上(下)三角矩阵,利用其逆矩阵导出了分块带状矩阵的逆矩阵表达式;进而利用所得到的公式分别推导了分块三对角矩阵及分块五对角矩阵的逆矩阵的快速算法,所需运算量为O(n~2)次m阶矩阵的运算．本文的结果扩充了文[1]等关于分块三对角阵求逆的相关结果．     

关于用初等变换求A^—1

线性代数中,矩阵的初等变换是非常重要的运算手段。在求矩阵的秩、逆矩阵、向量的线性相关性及求解线性方程组等方向却用到了行(列)的初等变换。一般的教材在介绍逆矩阵的初等变换求法时都强凋了仅用行初等变换。实     

广义(u,v)幂等矩阵

首先定义了一类新的矩阵一广义(u,v)幂等矩阵,然后研究了它的等价刻画,从而推广了(u,v)幂等矩阵、m幂幺矩阵、m幂等矩阵的一些相应结果.此外,也探讨了广义(u,v)幂等矩阵的性质,以及广义(u,v)幂等矩阵与广义m幂矩阵的关系.     

正规矩阵的方程构造

通过对复数域上的群逆矩阵、Moore-Penrose (简称MP)可逆矩阵和共轭转置矩阵的研究,给出矩阵range-Hermitian (简称EP)性的一些新刻画,借助于这些性质刻画,构造出相关的矩阵方程,研究所得方程在给定集合中解的存在性对矩阵EP性的影响,从而给出正规矩阵的刻画.利用这些刻画再反过来构造矩阵方程,研究其一般解形式,通过变化其特解形式给出矩阵EP性的若干新性质.     

分块K—循环Toeplitz矩阵求逆的快速付氏变换法

1算法描述及推导 Toeplitz矩阵及Toeplitz系统的求解在谱分析、线性预测、误差控制码、自回归滤波器设计等领域内起着重要的作用~[1-3]，而分块Toeplitz矩阵在计算机的时序分析、自回归时序模型滤波中也经常出现~[4]。对一般Toeplitz矩阵求逆，其算术复杂性为O(n~2)~[5]-[6]，其中n为Toepleitz矩阵的阶，而K-循环Toeplitz矩阵的求逆，其算术复杂性可降为O(nlog_2n)，本文提供了mn附分块K-循环Toeplitz矩阵求逆的一种快速付氏变换算法，其算术复杂性为O（mnlog_2mn）.     

关于对广义的正定矩阵进一步研究

通常讨论矩阵的正定性只局限在实对称矩阵范围内(以下我们把全体n阶实对称正定矩阵的集合记为S~+),随着数学本身的发展和其它学科的需要,有不少人开始研究未必对称的较广义的实正定矩阵.李炯生在文[1]中给出了一类较广义的实正定矩阵的定义: 设A是n阶实方阵.如果对于任何非零的n维列向量X都有 X~TAX>0,其中X~T表示X的转置,则把A叫做正定矩阵.全体这类矩阵的集合记为P(I).文[1]证明了A∈P(I)的充分必要条件是A的对称分量是对称正定矩阵(即把A表示为对称矩阵与反对称阵的和的形式,前者称为对称分量,后者称为反对称分量).同时还推得P(I)中矩阵其     

λ-矩阵的等价和矩阵多项式秩的恒等式

设U(λ)与V(λ)都是m×m阶的λ-矩阵.若U(λ)与V(λ)等价,则对于任意的n阶方阵A,分块矩阵U(A)与V(A)的秩相等.利用此结论刻画了幂零矩阵、零化多项式等.同时,通过考虑两个对角λ-矩阵等价的充要条件,使关于矩阵多项式秩的一些恒等式的讨论有了新的统一的方法.     

S-Sparse Ostrowski-Brauer矩阵线性互补问题的误差界及其应用（英文）

本文研究S-Sparse Ostrowski-Brauer (S-SOB)矩阵线性互补问题误差界的估计问题.利用矩阵不等式放缩技术及S-SOB矩阵逆矩阵无穷大范数,获得S-SOB矩阵线性互补问题的误差界,该界仅依赖于S-SOB矩阵的元素.在此基础上,给出S-SOB-B矩阵线性互补问题的误差界,并从理论上证明所给误差界在一定条件下优于García-Esnaola等(2009)和LIU等(2021)所给的结果.最后,通过数值算例进一步阐明了结果的有效性.     

Classification of Measurable Functions of Several Variables and Invariantly Distributed Random Matrices

The classification of measurable functions of several variables is reduced to the problem of describing some special measures on the matrix (tensor) space, namely, the so-called matrix (tensor) distributions, that are invariant with respect to the permutations of indices. In the case of functions with additional symmetries (symmetric, unitarily or orthogonally invariant, etc.), these measures also have additional symmetries. This relationship between measurable functions and measures on the tensor space as well as our method in itself are used in both directions, namely, on one hand, to investigate invariance properties of functions and characterizations of matrix distributions, and, on the other hand, to classify the set of all invariant measures. We also give a canonical model of a measurable function with a given matrix distribution.     

Hilbert不等式的各种精化与拓广综述

在本文中,我们较全面的概述了1990年至2002年间有关Hilbert级数型与积分型不等式的种种精化与拓广工作.涉及发表于海内外的文献资料40余篇,其中我国学者的工作成果占有重要份量.文末还列举了一些有待进一步研究的公开问题.     

高职院校课堂教学质量影响因素研究——基于Lasso-logistic回归模型

本文以"大学生课堂学习状态问卷"调查为基础,利用Lasso-logistic回归模型对安徽省某高职学院336位学生成绩的影响因素进行分析。结果表明,影响客观评价结果的因素包括性别、父母亲文化程度等个人、家庭因素及学习勤奋刻苦程度等直接相关因素;而影响主观评价结果的因素则主要为学习勤奋刻苦程度、学习目标等直接相关因素,而不包括个人、家庭因素。     

Cutting and scanning methods in set-valued analysis I. An epigraphical and graphical calculus

Cutting analysis of sets (scanning, laser exploration, etc.), when applied to epigraphs of functions and graphs of operators, gives rise to a rich calculus and provides a unifying approach to various operations in optimization and variational analysis.     

A class of generalized variable penalty methods for nonlinear programming

A class of generalized variable penalty formulations for solving nonlinear programming problems is presented. The method poses a sequence of unconstrained optimization problems with mechanisms to control the quality of the approximation for the Hessian matrix, which is expressed in terms of the constraint functions and their first derivatives. The unconstrained problems are solved using a modified Newton's algorithm. The method is particularly applicable to solution techniques where an approximate analysis step has to be used (e.g., constraint approximations, etc.), which often results in the violation of the constraints. The generalized penalty formulation contains two floating parameters, which are used to meet the penalty requirements and to control the errors in the approximation of the Hessian matrix. A third parameter is used to vary the class of standard barrier or quasibarrier functions, forming a branch of the variable penalty formulation. Several possibilities for choosing such floating parameters are discussed. The numerical effectiveness of this algorithm is demonstrated on a relatively large set of test examples.The author is thankful for the constructive suggestions of the referees.     

Log-concavity of compound distributions with applications in stochastic optimization

Compound distributions come up in many applications (telecommunication, hydrology, insurance, etc.), where some of the typical problems are of optimization type. The log-concavity property is paramount in these respects to ensure convexity. In this paper, we prove the log-concavity of some compound Poisson and other compound distributions.     

Foliations

The survey is based on works on the theory of foliations reviewed in RZhMatematika during 1970–1979. The basic topics are the classification of foliations, characteristic classes, the qualitative theory of foliations (holonomy, growth of leaves, etc.), and special classes of foliations (compact foliations, Riemannian foliations, etc.).Translated from Itogi Nauki i Tekhniki, Seriya Algebra, Topologiya, Geometriya, Vol. 18, pp. 151–213, 1981.     

反对称矩阵的一种特殊分解

本文给出反对称矩阵的一种特殊分解．可用于最优控制等。     

Business reliability in connectivity of performers

Before starting any business project, the question on its reliability arises. Obviously, in the case of predefined total values of resources (financial, human, etc.), project reliability depends mainly on its performers. In this paper, we suggest an algorithm that enables us to determine and select the performer groups before the project starts as well as estimate the project optimal budget and the project reliability.     

Universal algebras

A survey of the development of the theory of universal algebras in the years 1976–1988. Such basic directions of development of this theory as classes of universal algebras (varieties, quasivarieties, etc.), Mal'tsev conditions, congruences, sheaves, homomorphisms, subalgebras, products of algebras, clones of operations, completeness, systems of equations in algeberas, and connections with computer mathematics show up in it. Considerable attention is given to concrete classes of algebras (p-algebras, BCK-algebras, unary algebras, etc.).Translated from Itogi Nauki i Tekhniki, Seriya Algebra, Topologiya, Geometriya, Vol. 27, pp. 45–124, 1989.