奇异M—矩阵的图相容弱正则分裂

设Ａ是奇异Ｍ－矩阵，Ａ＝Ｍ－Ｎ是Ａ的图相容弱正则分裂。本文研究迭代矩阵Ｍ＾－１Ｎ的谱性质，得到与迭代矩阵的指数有关的一个定理：ｉｎｄ０（Ａ）＝ｉｎｄ１（Ｍ＾－１Ｎ）．它推广了Ｈ．Ｓｃｈｎｅｉｄｅｒ和作者的结果。     

并行矩阵多分裂块松弛迭代算法

并行矩阵多分裂块松弛迭代算法白中治（复旦大学数学研究所）ＰＡＲＡＬＬＥＬＭＡＴＲＩＸＭＵＬＴＩＳＰＬＩＴＴＩＮＧＢＬＯＣＫＲＥＬＡＸＡＴＩＯＮＩＴＥＲＡＴＩＯＮＭＥＴＨＯＤＳ￥ＢａｔＺｈｏｎｇ－ｚｈｉ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，Ｍ...     

广义逆A_(T,S)~(2)的子式

１．引 言 设Ａ∈Ｃｍ×ｎ,Ｍ和Ｎ分别为ｍ和ｎ阶Ｈｅｒｍｉｔｅ正定阵,考虑下列方程 （１） ＡＸＡ＝Ａ （２） ＸＡＸ＝Ｘ （３）（ＡＸ）＊＝ＡＸ （４）（ＸＡ）＊＝ＸＡ （３Ｍ）（ＭＡＸ）＊＝ＭＡＸ （４Ｎ）（ＮＸＡ）＊＝ＮＸＡ 如果Ｘ∈Ｃｎ×ｍ满足条件（１）和（２）,则称Ｘ为Ａ的自反广义逆,记作Ｘ＝Ａ（１,２）;如果 Ｘ满足条件（２）,则称Ｘ为 Ａ的｛２｝逆,记作 Ｘ＝Ａ（２）;如果Ｘ满足（１）－（４）,则称Ｘ为 Ａ的 Ｍ－Ｐ逆,记作Ｘ＝Ａ＋;如果Ｘ满足（１）、（２）、（３Ｍ）、（４Ｎ）,则称 Ｘ为 Ａ的加权…     

一类矩阵的Drazin逆

本文得到了一类环上矩阵Ｄｒａｚｉｎ逆的一个定理：设Ｎ表有单位元环Ｒ中零元、可逆元集合与Ｒ的中心Ｚ（Ｒ）的交集，Ｍ表Ｒ的子域与Ｚ（Ｒ）的交集，Ａ∈Ｒｎ×ｎ．若ｆ（λ）＝ｃλｋ（１－λｑ（λ））是Ａ的化零多项式，其中ｑ（λ）的系数属于Ｎ，且ｃ∈Ｎ，则Ａ的Ｄｒａｚｉｎ逆存在，且Ｘ＝Ａｋ［ｑ（Ａ）］ｋ＋１是Ａ的唯一的一个Ｄｒａｚｉｎ逆．     

两步定常线性迭代法的收敛区域及最优参数选取

１．引言 给定一线性系统 Ａｘ＝ｂ,（１．１）其线性两步定常迭代方法可表示为 ｘｎ＋１＝ ｘｎ＋ αｒｎ＋ β（ｘｎ－ ｘｎ－１）,（１．２）其中 ｒｎ＝ｂ－Ａｘｎ（１．３）是剩余向量, ｘ０, ｘ１是任意的（ｃｆ．Ｙｏｕｎｇ［１,ｐ．４８７］）．本文我们将研究迭代式（１．２）的收敛条件及参数α,β如何选取问题．关于此问题已有一些结果,如［２－４］,本文将从方程根的角度讨论最一般的情况,即在复数域上来讨论此问题,同时作为其特例来讨论复 ＳＯＲ、 ＭＳＯＲ的收敛性． 下文中除了特别说明,Ａ是复矩阵,α,β是复…     

一道立体几何题作图错误的纠正

一道立体几何题作图错误的纠正高志军（江苏省通州市石港中学２２６３５１）有这样一道题：从二面角α－ＭＮ－β内的点Ａ，分别作ＡＢ⊥平面α，ＡＣ⊥平面β（Ｂ，Ｃ为垂足），已知ＡＢ＝３ｃｍ，ＡＣ＝１ｃｍ，∠ＢＡＣ＝６０°．则二面角α－ＭＮ－β的度数是，Ａ到棱...     

求矩阵A^＋的初等变换法

求矩阵Ａ~＋的初等变换法赵昌成（湖北郧阳师专４４１９００）设Ａ是复ｍ×ｎ矩阵，如果ｎ×ｍ矩阵Ｘ满足（１）ＡＸＡ＝Ａ（２）ＸＡＸ＝Ｘ；（３）（ＡＸ）＝ＡＸ；（４）（ＸＡ）＝ＸＡ．则称Ｘ为Ａ的Ｍｏｒｅ－Ｐｅｎｒｏｓｅ广义逆（号表示对矩阵取共轭转置运算）．...     

1999年全国初中数学联合竞赛(Ⅰ)试题及参考答案

第一试选择题１．计算１１－４３＋１１＋４３＋２１＋３的值是（）．（Ａ）１（Ｂ）－１（Ｃ）２（Ｄ）－２解原式＝２１－３＋２１＋３＝４１－３＝－２．答：（Ｄ）．２．△ＡＢＣ的周长是２４,Ｍ是ＡＢ的中点,ＭＣ＝ＭＡ＝５,则△ＡＢＣ的面积是（）．（Ａ）１２（...     

矩阵方程X＋A^TX^—1A=Q存在可稳定化解的充分必要条件

１引言一般的时离散代数Ｒｉｃｃａｔｉ方程具有下面的形式：这里如果方程（１）中的系数矩阵满足：（ｎ＝ｍ）则方程（１）变为当Ｑ＝ＱＴ＞０时,Ｅｎｇｗｅｒｄａ,詹兴致等人研究了方程（２）存在正定解的充分必要条件［１］［２］［３］．本章利用方程（２）与（１）的关系,从另一角度讨论了Ｑ为对称矩阵时,方程（２）存在可稳定化解的充分必要条件．２基本概念与记号首先我们简单回顾一下以前的概念与记号．矩阵束Ｍ—Ｎ,Ｍ,Ｎ为正则的,也就是说ｄｅｔ（λＭ－Ｎ）＝０;如果λ０为ｄｅｔ（λＭ－Ｎ）的ｋ重根,则称λ０为它的ｋ…     

GMANOVA—MANOVA模型中的两阶段抽样估计

对于ＧＭＡＮＯＶＡ－ＭＡＮＯＶＡ模型Ｙ＝Ｘ１Ｂ１Ｘ＇２＋ＺＢ２＋ε(1)Ｃｏｖ（Ｙ）＝∑　Ｉｎ．(2)本文通过两阶段抽样构造出了其均值参数矩阵Ｂ_１,Ｂ_２的一种估计Ｂ（_１Ｎ１）,Ｂ_（２Ｎ２）,使得这种估计在二次损失下,其风险小于任意预先给定的ε＞ ０,并且证明了这种估计的停时数（ｓｔｏｐ　ｎｕｍｂｅｒ）是渐近有效的（在Ｃｈｏｗ　ａｎｄ　 Ｒｏｂｂｉｎｓ　（１９６５）意义下）．     

A SHIFT-SPLITTING PRECONDITIONER FOR NON-HERMITIAN POSITIVE DEFINITE MATRICES

A shift splitting concept is introduced and, correspondingly, a shift-splitting iteration scheme and a shift-splitting preconditioner are presented, for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned non-Hermitian positive definite matrix. The convergence property of the shift-splitting iteration method and the eigenvalue distribution of the shift-splitting preconditioned matrix are discussed in depth, and the best possible choice of the shift is investigated in detail. Numerical computations show that the shift-splitting preconditioner can induce accurate, robust and effective preconditioned Krylov subspace iteration methods for solving the large sparse non-Hermitian positive definite systems of linear equations.     

A two-step matrix splitting iteration paradigm based on one single splitting for solving systems of linear equations

For solving large sparse systems of linear equations, we construct a paradigm of two-step matrix splitting iteration methods and analyze its convergence property for the nonsingular and the positive-definite matrix class. This two-step matrix splitting iteration paradigm adopts only one single splitting of the coefficient matrix, together with several arbitrary iteration parameters. Hence, it can be constructed easily in actual applications, and can also recover a number of representatives of the existing two-step matrix splitting iteration methods. This result provides systematic treatment for the two-step matrix splitting iteration methods, establishes rigorous theory for their asymptotic convergence, and enriches algorithmic family of the linear iteration solvers, for the iterative solutions of large sparse linear systems.     

求解一类非线性互补问题的松弛two-sweep模系矩阵分裂迭代法

本文构造了求解一类非线性互补问题的松弛two-sweep模系矩阵分裂迭代法. 理论分析建立了新方法在系数矩阵为正定矩阵或H₊矩阵时的收敛性质．数值实验结果表明新方法是行之有效的, 并且在最优参数下松弛two-sweep模系矩阵分裂迭代法在迭代步数和时间上均优于传统的模系矩阵分裂迭代法和two-sweep模系矩阵分裂迭代法.     

Generalized skew‐Hermitian triangular splitting iteration methods for saddle‐point linear systems

A generalized skew‐Hermitian triangular splitting iteration method is presented for solving non‐Hermitian linear systems with strong skew‐Hermitian parts. We study the convergence of the generalized skew‐Hermitian triangular splitting iteration methods for non‐Hermitian positive definite linear systems, as well as spectrum distribution of the preconditioned matrix with respect to the preconditioner induced from the generalized skew‐Hermitian triangular splitting. Then the generalized skew‐Hermitian triangular splitting iteration method is applied to non‐Hermitian positive semidefinite saddle‐point linear systems, and we prove its convergence under suitable restrictions on the iteration parameters. By specially choosing the values of the iteration parameters, we obtain a few of the existing iteration methods in the literature. Numerical results show that the generalized skew‐Hermitian triangular splitting iteration methods are effective for solving non‐Hermitian saddle‐point linear systems with strong skew‐Hermitian parts. Copyright © 2013 John Wiley & Sons, Ltd.     

Optimal parameters in the HSS‐like methods for saddle‐point problems

For the Hermitian and skew‐Hermitian splitting iteration method and its accelerated variant for solving the large sparse saddle‐point problems, we compute their quasi‐optimal iteration parameters and the corresponding quasi‐optimal convergence factors for the more practical but more difficult case that the (1, 1)‐block of the saddle‐point matrix is not algebraically equivalent to the identity matrix. In addition, the algebraic behaviors and the clustering properties of the eigenvalues of the preconditioned matrices with respect to these two iterations are investigated in detail, and the formulas for computing good iteration parameters are given under certain principle for optimizing the distribution of the eigenvalues. Copyright © 2008 John Wiley & Sons, Ltd.     

The Uzawa–HSS method for saddle-point problems

Based on the Hermitian and skew-Hermitian splitting iteration scheme, we propose a Uzawa-type iteration method for solving a class of saddle-point problems whose coefficient matrix has non-Hermitian positive definite (1, 1)-block. The convergence properties of this novel method are analyzed, which show that the Uzawa-type iteration method is convergent if the iteration parameters satisfy suitable restrictions.     

边界约束二次规划问题的分解方法

１．引言本文考虑如下边界约束的二次规划问题：其中ＱＥ＊"""是对称的,Ｃ,人。Ｅ＊"是给定的常数向量,且Ｚ＜。这类问题经常出现在偏微分方程,离散化的连续时间最优控制问题、线性约束的最小二乘问题、工程设计、或作为非线性规划方法中的序列子问题．因此具有特殊的重要性．本文提出求解问题（１．１）的分解方法．它类似求解线性代数方程组的选代法,它是对Ｑ进行正则分裂【对即把Ｑ分裂为两个矩阵之和,Ｑ＝Ｎ十片而这两个矩阵之差（Ｎ一则是对称正定的．在每次迭代中用一个易于求解的矩阵Ｎ替代Ｑ进行计算一新的二次规划问题．在适…     

A single-step HSS method for non-Hermitian positive definite linear systems

In this paper, based on the Hermitian and skew-Hermitian splitting (HSS) iteration method, a single-step HSS (SHSS) iteration method is introduced to solve the non-Hermitian positive definite linear systems. Theoretical analysis shows that, under a loose restriction on the iteration parameter, the SHSS method is convergent to the unique solution of the linear system. Furthermore, we derive an upper bound for the spectral radius of the SHSS iteration matrix, and the quasi-optimal parameter is obtained to minimize the above upper bound. Numerical experiments are reported to the efficiency of the SHSS method; numerical comparisons show that the proposed SHSS method is superior to the HSS method under certain conditions.     

求解时谐涡流模型鞍点问题的分块交替分裂隐式迭代算法的改进

分块交替分裂隐式迭代方法是求解具有鞍点结构的复线性代数方程组的一类高效迭代法.本文通过预处理技巧得到原方法的一种加速改进方法,称之为预处理分块交替分裂隐式迭代方法·理论分析给出了新方法的收敛性结果.对于一类时谐涡旋电流模型问题,我们给出了若干满足收敛条件的迭代格式.数值实验验证了新型算法是对原方法的有效改进.     

一类弱非线性方程组的Picard-MHSS迭代方法

修正的Hermite/反Hermite分裂(MHSS)迭代方法是一类求解大型稀疏复对称线性代数方程组的无条件收敛的迭代算法.基于非线性代数方程组的特殊结构和性质,我们选取Picard迭代为外迭代方法,MHSS迭代作为内迭代方法,构造了求解大型稀疏弱非线性代数方程组的Picard-MHSS和非线性MHSS-like方法.这两类方法的优点是不需要在每次迭代时均精确计算和存储Jacobi矩阵,仅需要在迭代过程中求解两个常系数实对称正定子线性方程组.除此之外,在一定条件下,给出了两类方法的局部收敛性定理.数值结果证明了这两类方法是可行、有效和稳健的.