几种约束广义逆矩阵的有限算法

1引言与引理众所周知，关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的，这就是著名的Faddeev算法[1，P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来，有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩     

关于广义逆矩阵AT,S^（2）的极限表示的注记

1引言文[1]中应用广义逆矩阵A_r.s~(2)的一个极限表示给出了计算A_r.s~(2)r嵌入法(imbeddingmethod).但对其主要结果定理1,即A_r.s~(2)的极限表示。并没有给出严格的证明，实际上其证明并不是显然的。本文于此给出A_r.s~(2)的极限表示的一种严格的证明，并叙述许多常用广义逆的极限表示，作为文[1]的补充。     

求置换因子循环矩阵的逆阵及广义逆阵的快速算法

1 引 言 循环矩阵由于其应用非常广泛而成为一类重要的特殊矩阵,如在图象处理、编码理论、自回归滤波器设计等领域中经常会遇到以这类矩阵为系数的线性系统的求解问题.而对称循环组合系统也具有广泛的实际背景,例如造纸机的横向控制系统,具有平行结     

计算常用广义逆的一类统一的迭代法

本文给出了计算广义逆的一阶与ｐ阶（ｐ≥２）迭代法。由于常用的重要广义逆，例如Ａ＋，，Ａ（ｄ），Ａ＃，Ａｄ，ｗ，，等等，都是　型的广义逆，所以，我们实际上给出了计算这些重要广义逆的一类统一的迭代法。此外，我们还研究了计算的迭代法中初始逼近的一般取法，以及计算上述各个广义逆的迭代法中初始逼近的实际取法。     

求加权广义逆的矩阵方法

本文给出了应用矩阵方法求矩阵Ａ的加权广义逆Ａ＾［１，２，Ｗ３］，Ａ＾［１，２，ｗ３］和Ａ＾［１，２］［ｗ，ｗ］的充要条件。     

实对称矩阵在相合分解下的Moore-Penrose型广义逆的通式

1引言与符号说明对m×n矩阵A,下列矩阵方程：(1)AXA=A,(2)XAX=x,(3)(AX)~T=AX,(4)(XA)~T=XA称为Penrose方程．如果X满足上述方程(i)(j),…(k),则称X为(ij…k)逆,其全体记为A(ij…k)．(1234)逆常记为A~ ．所有这种矩阵叫广义逆(矩阵)或Moore- Penrose型逆(矩阵)．广义逆矩阵在许多数学领域有广泛应用．它在解矩阵方程中的作用     

具多个奇点的广义Liénard系统解的有界性

本文讨论具有有限多个奇点的广义Liénard系统解的有界性,得到一组保证系统的解正向有界的充分条件,进而得到存在极限环的条件。     

REDUCTIONS OF ADJOINT REPRESENTATIONS TO LAX REPRESENTATIONS FOR CONSTRAINED FLOWS

Within framwork of zero-curvature representation theory,the Lax reprsentations for x- and tn-constrained flows of soliton hierarchy are obtained from reductions of adjoint representations of the auxiliary linear problems. This method is applied to the third order spectral problem by taking modified Boussinesq hierarchy as an illustrative example.     

域上矩阵积的广义逆及自反广义逆的逆反律

令A,B是任意域上的矩阵且使得AB有意义。本文研究了AB的广义逆、自反广义逆与A,B的广义逆、自反广义逆的积之间的关系,得到了B{1}A{1}(AB){1},B{1}A{1}=(AB){1},B{1,2}A{1,2}(AB){1,2}和B{1,2}A{1,2}=(AB){1,2}成立的一些充要条件。     

关于态射的广义Moore-Penrose逆

本文研究了态射的广义Moore-Penrose逆．给出了范畴中态射的广义Moore-Penrose逆存在的一些新的充要条件．也给出了广义Moore-Penrose逆的乘积公式成立的充要条件。     

LOCAL AND PARALLEL FINITE ELEMENT ALGORITHMS FOR THE NAVIER-STOKES PROBLEM

Based on two-grid discretizations, in this paper, some new local and parallel finiteelement algorithms are proposed and analyzed for the stationary incompressible Navier-Stokes problem. These algorithms are motivated by the observation that for a solutionto the Navier-Stokes problem, low frequency components can be approximated well by arelatively coarse grid and high frequency components can be computed on a fine grid bysome local and parallel procedure. One major technical tool for the analysis is some locala priori error estimates that are also obtained in this paper for the finite element solutionson general shape-regular grids.     

ON GENERALIZED LIENARD EQUATION AND THE UNIQUENESS OF LIMIT CYCLES IN GAUSS－TYPE PREDATOR－PREY SYSTEM

ＯＮＧＥＮＥＲＡＬＩＺＥＤＬＩＥＮＡＲＤＥＱＵＡＴＩＯＮＡＮＤＴＨＥＵＮＩＱＵＥＮＥＳＳＯＦＬＩＭＩＴＣＹＣＬＥＳＩＮＧＡＵＳＳ－ＴＹＰＥ　ＰＲＥＤＡＴＯＲ－ＰＲＥＹ　ＳＹＳＴＥＭＳｈａｏＭｉｎｇｈｕａ（邵明华）（ＨａｎｇｚｈｏｕＴｅａｃｈｅｒｓ＇Ｃ...     

ERROR ANALYSIS OF A STABILIZED FINITE ELEMENT METHOD FOR THE GENERALIZED STOKES PROBLEM

This paper is devoted to the establishment of sharper $a$ $priori$stability and error estimates of a stabilized finite element method proposed by Barrenechea and Valentin for solving the generalized Stokes problem, which involves a viscosity $\nu$ and a reaction constant $\sigma$. With the establishment of sharper stability estimates and the help of $ad$ $hoc$finite element projections, we can explicitly establish the dependence of error bounds of velocity and pressure on the viscosity $\nu$, the reaction constant $\sigma$, and the mesh size $h$. Our analysis reveals that the viscosity $\nu$ and the reaction constant $\sigma$ respectively act in the numerator position and the denominator position in the error estimates of velocity and pressure in standard norms without any weights. Consequently, the stabilization method is indeed suitable for the generalized Stokes problem with a small viscosity $\nu$ and a large reaction constant $\sigma$. The sharper error estimates agree very well with the numerical results.     

EXTENDED OBLIQUE PROJECTION METHOD FOR GENERALIZED LEAST SQUARES PROBLEM

We extend the oblique projection method given by Y.Saad to solve the generalized least squares problem. The corresponding oblique projection operator is presented and the convergence theorems are proved. Some necessary and sufficient conditions for computing the solution or the minimum N-norm solution of the min || A x- b ||M2 have been proposed as well.     

关于算子加权广义逆的反序律

本文研究了Hilbert空间上两个算子乘积的加权广义逆的反序律.利用算子的分块矩阵表示,获得了两个算子加权广义逆反序律成立的充要条件,所获结果推广了孙文瑜,魏益民和Djordjevic Dragan S.的相关结果.     

行－列可交换随机变量组列的极限定理

利用逆鞅、截尾等方法，我们得出行－列可交换随机变量组列的大数定律，作为推论，我们得到具有有限均值的行－列可交换无限组列满足强大数定律的充要条件是该组列的对角线元素不相关．再充分利用对称性及可交换性，我们得到对称可交换随机变量和的极限定理，并由此导出对称行－列可交换随机变量组列的完全收敛定理     

变量有广义界线性规划的叠累单纯形法

本文建立变量有广义界线性规划一个新的转轴算法,称之为叠累单纯形算法,新算法其有三个主要特征：１对于检验数为“坏”的非基变量 ｘｓ,进行一轮子转轴运算,使得ｘｓ进基,转轴中具有“好”的检验数的变量始终保持“好”的检验数;２ｘ．进基的子转轴所产生的基既不是原始可行基,也不是对偶可行基,但子转轴结束时产生的基是原始可行的;３目标函数值在整个转抽运算中是单调下降,从而算法可有限步终止．     

FINITENESS CONDITIONS FOR GENERALIZED EXPONENTS OF DIGRAPHS

1.IntroductionR.A.BrualdiandBolianLiuintroducedin199011]theconceptofgeneralizedexponentsforprimitivedigraphs.Thisconceptisageneralizationofthetraditionalconceptoftheexponentsforprimitivedigraphsandhasbackgroundsinmemorylesscommunicationsystemsassociatedwithdigraphs.Inthispaperweshowthatgeneralizedexponentscanalsobedefinedfordigraphswhicharenotnecessarilyprimitive.WewillgivenecessaryandsufficientconditionsforthefinitenessofthegeneralizedexponentsexpD(k),f(D,k)andF(D,k).Theseideasandresultss…     

无约束非光滑优化问题信赖域算法的收敛条件

1 引言 考虑下列无约束非光滑优化问题 minf(x),(1) x∈R~n,其中f为R~n上的局部Lipschitz函数,本文将‖·‖_2简记为‖·‖.记下列信赖域子问题为S∪B(x,△). min m(x,s)=φ(x,s)+1/2s~TBs, 其中φ:R~(2m)→R为f的迭代函数。 对于无约束非光滑优化问题(1),[11],[13],[3]、[4]和[5]分别在特殊的条件下给出了信赖域算法用以求解(1)的收敛性结果。最近,[10]、[2]和[6]在不同的假设条件下分别给出了信赖域算法求解无约束非光滑优化问题的一般模型,并在子问题的目标函数满足局部一致有界性条件时证明了算法模型的整体收敛性。在目标函数满足某种正则性条件时,[11]和[9]给出了当信赖域子问题的目标函数中二次项不满足一致有界性条件时的收敛性结果.本文则在目标函数仅为局部Lipschitz函数时得到了和[8]、[11]、[9]相同的收敛性结果。     

THE GENERALIZED LOCAL HERMITIAN AND SKEW-HERMITIAN SPLITTING ITERATION METHODS FOR THE NON-HERMITIAN GENERALIZED SADDLE POINT PROBLEMS

For large and sparse saddle point problems, Zhu studied a class of generalized local Hermitian and skew-Hermitian splitting iteration methods for non-Hermitian saddle point problem [M.-Z. Zhu, Appl. Math. Comput. 218 （2012） 8816-8824 ]. In this paper, we further investigate the generalized local Hermitian and skew-Hermitian splitting （GLHSS） iteration methods for solving non-Hermitian generalized saddle point problems. With different choices of the parameter matrices, we derive conditions for guaranteeing the con- vergence of these iterative methods. Numerical experiments are presented to illustrate the effectiveness of our GLHSS iteration methods as well as the preconditioners.