逆H矩阵的新性质

本文在文[4]给出的逆H矩阵定义的基础上，给出了逆H矩阵的新性质．     

某些特殊循环矩阵的逆

贵刊1986年第10期,姚存峰给出了求循环矩阵的逆矩阵的一个方法。此法虽然解决了循环矩阵的求逆问题,但在实际应用中因有大量的三角函数运算等问题,因此此法使用起来不太方便.本文就某些特殊类型的循环矩阵的求逆问题进行探讨,给出一些简便方法. 设循环矩阵A为     

几种矩阵逆的连续性

非奇异矩阵的逆是矩阵元素的连续函数．学者们也对矩阵广义逆的连续性有所研究．本文应用矩阵分裂和两个矩阵之和的逆的展开式,给出了一般非奇异矩阵,M-矩阵和H-矩阵的逆的连续性．当一些合理的条件满足时,这几种矩阵的逆是连续的．     

矩阵计算逆的精度估计

在许多问题中,需要计算非奇异矩阵的逆矩阵。然而算得的逆矩阵相对于精确的逆矩阵来说,究竟有几位有效数字,往往是不得而知的。本文给出的定理1和定理2,能在算得的逆矩阵与原矩阵之间满足了一个要求不算高的关系式之后,准确地判断出算得的逆矩阵有几位有效数字。     

关于Fuzzy矩阵的Moore-Penrose逆

讨论Fuzzy矩阵的Moore-PenrOSe逆，给出一些Moore-Penrose逆存在的充要条件以及Moore-Penrose逆的划画。     

坡矩阵的Cline逆

研究了坡矩阵的广义逆. 首先引入坡矩阵的Cline逆和Drazin逆, 运用坡矩阵的性质证明任意坡矩阵都有Drazin逆, 从而得出任意坡矩阵都有Cline逆,并且是唯一的. 进一步,如果A 存在,那么AC等于A . 最后,给出AC的一些性质.     

逆H矩阵的性质

研究了在理论和实际应用中有重要用途的H矩阵的相关问题．本文在文【3】给出的逆H矩阵定义的基础上，进一步得到了逆日矩阵的新的性质一对角元对于非对角元的占优关系．     

三对角矩阵求逆的算法

研究了一般的非奇三对角矩阵的求逆,并给出了一个求逆矩阵的简单算法.首先研究了具有Doolittle分解的三对角矩阵的求逆,得到一个求逆的算法,然后将该算法推广到一般的非奇三对角矩阵上.最后给出了该算法与其它求逆方法的比较,可以看到该算法一方面计算量低,另一方面适用于不需任何附加条件的一般的非奇三对角矩阵.     

一类广义范德蒙矩阵的求逆公式及递推公式

利用线性方程组给出了一类广义范德蒙矩阵可逆的条件及逆矩阵的矩阵表示式 ,并给出了求逆的递推公式 .     

广义逆矩阵A~-的计算方法及应用

根据广义逆矩阵(减号逆)的定义AA-A=A,给出了求任意矩阵A的一个或全部广义逆矩阵A-的计算方法.当A-为A的全部广义逆矩阵时,得出了矩阵方程(或线性方程组)AX=B的统一通解公式X=A-B.     

一类广义Vandermonde矩阵的可逆条件及求逆公式

利用广义Vandermonde行列式的显式表示式,给出了广义Vandermonde矩阵可逆的充要条件及求逆公式.     

Confluent Vandermonde matrices,divided differences,and Lagrange–Hermite interpolation over quaternions

We introduce the notion of a confluent Vandermonde matrix with quaternion entries and discuss its connection with Lagrange–Hermite interpolation over quaternions. The formula for the rank of a confluent Vandermonde matrix is obtained as well as the representation formula for divided differences of quaternion polynomials. Extensions of these results to the power series setting include the formula for the rank of a confluent Cauchy matrix and norm-constrained Lagrange–Hermite interpolation by square summable power series over quaternions.     

Pascal矩阵与Vandermonde矩阵的关系

EI-Mikkawy M证明了对称Pascal矩阵Q_n和Vlandermonde矩阵V_n之间满足矩阵方程Q_n=T_nV_n,这里T_n是一个随机矩阵。本文证明了随机矩阵T_n能够分解成第一类Stirling矩阵和对角矩阵的乘积,得到了矩阵T_n的元素之间的递推关系,从而回答了EI-Mikkawy M的一个公开问题。同时得到了一些与Stirling数相关的组合恒等式。     

增次广义Vandermonde矩阵

定义了增次广义Vandermonde矩阵,并利用反证法或行列式推得它们的秩和某些逆.     

矩形网格上二元切触插值的表现公式

In this paper, we make use of the generalized Vandermonde matrix, and set up formula of bivariate contact interpolation over rectangular grids and a example is given.     

Cramer法则在数值计算中的若干应用

用Cramer法则给出了Lagrange插值公式和Newton插值公式的简洁证明,同时得到了Vandermonde矩阵的逆矩阵的LU分解.     

On a connection between the Pascal, Stirling and Vandermonde matrices

In this paper, we are going to study some additional relations between the Stirling matrix S_n and the Pascal matrix P_n. Also the representation for the matrix T_n and in terms of s_n and S_n will be considered. Consequently, this will give an answer to an open problem proposed by EI-Mikkawy [On a connection between the Pascal, Vandermonde and Stirling matrices—II, Appl. Math. Comput. 146 (2003) 759-769].     

ERROR ANALYSIS FOR SOLVING VANDERMONDE SYSTEM WITH SPECIAL POINTS

The Bjorck and Pereyra algorithms used for solving Vandermonde system of equation are modified for the case where the points are symmetricly situated around zero. The working operation is saved about half. A forward error analysis is presented for the modified algorithms, and it's shown that if the points are situated in some order, the error bound are as good as Higham's result in 1987.     

On a problem related to the Vandermonde determinant

This short note describes new properties of the elementary symmetric polynomials, and reveals that the properties give an answer to the conjecture raised by El-Mikkawy in [M.E.A. El-Mikkawy, On a connection between the Pascal, Vandermonde and Stirling matrices—II, Appl. Math. Comput. 146 (2003) 759-769].     

Lower bounds for the condition number of a real confluent Vandermonde matrix

Lower bounds on the condition number of a real confluent Vandermonde matrix are established in terms of the dimension , or and the largest absolute value among all nodes that define the confluent Vandermonde matrix and the interval that contains the nodes. In particular, it is proved that for any modest (the largest multiplicity of distinct nodes), behaves no smaller than , or than if all nodes are nonnegative. It is not clear whether those bounds are asymptotically sharp for modest .