两类下三角形Pascal矩阵的相似性

本文研究了Pascal矩阵与位移Pascal矩阵之间的关系.利用组合恒等式与矩阵分解的方法,得到了Pascal矩阵以及位移Pascal矩阵与若当标准型之间的过渡矩阵.同时也得到了这两类矩阵在域Zp上的最小多项式.     

Pascal三角形与Pascal矩阵

Pascal三角形中隐含着二项系数的许多相关性质 .本文从线性代数的观点研究了 Pascal矩阵的性质及其应用 ,并将这种矩阵推广到了更一般的形式     

Pascal矩阵的一种显式分解

本文引入了两种广义Pascal矩阵凡,P_n,k,Q_n,k以及两种广义Pascal函数矩阵O_n,k[x,y],Q_n,k[x,y],证明了Pascal矩阵能够表示成(0,1)-Jordan矩阵的乘积而且Pascal函数矩阵能分解成双对角矩阵的乘积.     

计算Pascal矩阵加数量矩阵之逆的一种新方法(英文)

In this paper,using the Jordan canonical form of the Pascal matrix Pn,we present a new approach for inverting the Pascal matrix plus a scalar Pn＋aIn for arbitrary real number a≠1.     

Pascal算子矩阵在组合恒等式中的应用

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

Pascal算子矩阵在组合恒等式中的应用(英文)

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

Vandermonde矩阵的一种应用

以Vandermonde矩阵的基本性质、矩阵的特征值与迹之间的关系为理论依据，由矩阵的（理论）特征值生成的Vandermonde矩阵．构造出一种特殊的等幂和矩阵．即幂迹矩阵，在此基础上可给出判定任意n阶实矩阵的互异特征值个数的三个充要条件．以及相应的算法和自定义matlab函数．     

Riordan 矩阵的$(m,r,s)$-Halves

Riordan矩阵的垂直一半和水平一半已经被许多学者分别研究过.本文给出了Riordan矩阵的$(m,r,s)$-halves的定义.利用此定义能够统一的讨论Riordan矩阵的垂直一半和水平一半.作为应用,通过对Pascal和Delannoy矩阵的$(m,r,s)$-halves的研究,可以得到了一些与Fibonacci, Pell和Jacobsthal序列相关的等式.     

增次广义Vandermonde矩阵

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

Vandermonde方程Hilbert方程及Vandermonde矩阵Hilbert矩阵逆的快速与并行算法

1.引言 众所周知,在并行数值代数研究中,降低矩阵求逆与线性方程组求解并行步是一个相当困难的问题。1976年Csanky证明了上述两问题均可在O(log~2n)并行步内完成,所用处理机台数为O(n~4)。然而能否找到时间步为O(logn)的并行算法,长期以来是人们极为关注的问题之一。对于特殊矩阵及方程的研究更是如此。目前除几个极其特殊的     

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].     

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

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

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 .

     

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].     

A connection between a generalized Pascal matrix and the hypergeometric function

The n × n generalized Pascal matrix P(t) whose elements are related to the hypergeometric function ₂F₁(a, b; c; x) is presented and the Cholesky decomposition of P(t) is obtained. As a result, it is shown that

Full-size image

is the solution of the Gauss's hypergeometric differential equation,

x(1 − x)y″ + [1 + (a + b − 1)x]y′ − ABY = 0

. where a and b are any nonnegative integers. Moreover, a recurrence relation for generating the elements of P(t) is given.