共查询到20条相似文献,搜索用时 187 毫秒
1.
2.
本文利用Hamilton-Cayley定理和特征矩阵的性质,给出了求实对称矩阵的特征向量的新方法,并通过例子验证了该方法. 相似文献
3.
4.
反对称正交对称矩阵反问题 总被引:6,自引:0,他引:6
本文讨论一类反对称正交对称矩阵反问题及其最佳逼近.研究了这类矩阵的一些性质,利用这些性质给出了反问题解存在的一些条件和解的一般表达式,不仅证明了最佳逼近解的存在唯一性,而且给出了此解的具体表达式. 相似文献
5.
研究了格矩阵的行列式与伴随矩阵,给出了它们的一些代数性质,同时给出了由一个格矩阵构造一个传递矩阵的方法. 相似文献
6.
广义正定矩阵的进一步研究 总被引:2,自引:1,他引:1
基于正定矩阵的几个定义,首先给出了广义正定矩阵的一些新性质,其次研究了广义正定矩阵与H-矩阵、M-矩阵的关系,推广和改进了文献中的有关行列式不等式. 相似文献
7.
8.
杜先能 《数学年刊A辑(中文版)》2006,(2)
本文研究形式三角矩阵环 R 的若干新性质,讨论 R-模的伪投射性,给出了形式三角矩阵环 R 是 V-环或半 V-环的充要条件.同时,给出了 R 是 PS-环的条件. 相似文献
9.
10.
11.
Reza BEHZADI 《数学研究及应用》2019,39(1):101-110
Hadjidimos(1978) proposed a classical accelerated overrelaxation(AOR) iterative method to solve the system of linear equations, and discussed its convergence under the conditions that the coefficient matrices are irreducible diagonal dominant, L-matrices, and consistently orders matrices. Several preconditioned AOR methods have been proposed to solve system of linear equations Ax = b, where A ∈ R~(n×n) is an L-matrix. In this work, we introduce a new class preconditioners for solving linear systems and give a comparison result and some convergence result for this class of preconditioners. Numerical results for corresponding preconditioned GMRES methods are given to illustrate the theoretical results. 相似文献
12.
为了在高性能计算机上求解广义鞍点问题,对于合适的系数矩阵,本文提出混合并行迭代法及其加速形式.并详细讨论了新方法的收敛性. 相似文献
13.
14.
Two operations are introduced for complex matrices. In terms of these two operations an infinite series expression is obtained for the unique solution of the Kalman-Yakubovich-conjugate matrix equation. Based on the obtained explicit solution, some iterative algorithms are given for solving this class of matrix equations. Convergence properties of the proposed algorithms are also analyzed by using some properties of the proposed operations for complex matrices. 相似文献
15.
16.
本文研究Toeplitz+Hankel线性方程组的预处理迭代解法.我们提出了几个新的预条件子,并分析了预处理矩阵的谱性质,当生成函数在Wiener类中时,预处理矩阵的特征值聚集在1附近.数值实验表明该预处理子比文[5]中的预处理子更有效. 相似文献
17.
Zhen‐Yun Peng 《Numerical Linear Algebra with Applications》2008,15(4):373-389
In this paper, two new matrix‐form iterative methods are presented to solve the least‐squares problem: and matrix nearness problem: where matrices and are given; ??1 and ??2 are the set of constraint matrices, such as symmetric, skew symmetric, bisymmetric and centrosymmetric matrices sets and SXY is the solution pair set of the minimum residual problem. These new matrix‐form iterative methods have also faster convergence rate and higher accuracy than the matrix‐form iterative methods proposed by Peng and Peng (Numer. Linear Algebra Appl. 2006; 13 : 473–485) for solving the linear matrix equation AXB+CYD=E. Paige's algorithms, which are based on the bidiagonalization procedure of Golub and Kahan, are used as the framework for deriving these new matrix‐form iterative methods. Some numerical examples illustrate the efficiency of the new matrix‐form iterative methods. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
18.
This paper is concerned with iterative solutions to a class of complex matrix equations. By applying the hierarchical identification principle, an iterative algorithm is constructed to solve this class of complex matrix equations. The range of the convergence factor is given to guarantee that the proposed algorithm is convergent for arbitrary initial matrix by applying a real representation of a complex matrix as a tool. By using some properties of the real representation, a sufficient convergence condition that is easier to compute is also given by original coefficient matrices. Two numerical examples are given to illustrate the effectiveness of the proposed methods. 相似文献
19.
A new version of the Smith method for solving Sylvester equation and discrete-time Sylvester equation
下载免费PDF全文
![点击此处可从《Journal of Applied Analysis & Computation》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Recently, Xue etc. \cite{28}
discussed the Smith method for solving Sylvester equation $AX+XB=C$,
where one of the matrices $A$ and $B$ is at least a nonsingular
$M$-matrix and the other is an (singular or nonsingular) $M$-matrix.
Furthermore, in order to find the minimal non-negative solution of a
certain class of non-symmetric algebraic Riccati equations, Gao and
Bai \cite{gao-2010} considered a doubling iteration scheme to
inexactly solve the Sylvester equations. This paper discusses the
iterative error of the standard Smith method used in \cite{gao-2010}
and presents the prior estimations of the accurate solution $X$ for
the Sylvester equation. Furthermore, we give a new version of the
Smith method for solving discrete-time Sylvester equation or Stein
equation $AXB+X=C$, while the new version of the Smith method can
also be used to solve Sylvester equation $AX+XB=C$,
where both $A$ and $B$ are positive definite. % matrices.
We also study the convergence rate of the new Smith method. At last, numerical examples are given to illustrate
the effectiveness of our methods 相似文献
20.
This paper concerns with the statistical methods for solving general linear systems. After a brief review of Bayesian perspective for inverse problems,a new and efficient iterative method for general linear systems from a Bayesian perspective is proposed.The convergence of this iterative method is proved,and the corresponding error analysis is studied.Finally, numerical experiments are given to support the efficiency of this iterative method,and some conclusions are obtained. 相似文献