计算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矩阵与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数相关的组合恒等式。     

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.     

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

Symmetric polynomials, Pascal matrices, and Stirling matrices

We consider lower-triangular matrices consisting of symmetric polynomials, and we show how to factorize and invert them. Since binomial coefficients and Stirling numbers can be represented in terms of symmetric polynomials, these results contain factorizations and inverses of Pascal and Stirling matrices as special cases. This work generalizes that of several other authors on Pascal and Stirling matrices.     

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

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

Bernoulli polynomials and Pascal matrices in the context of Clifford analysis

This paper describes an approach to generalized Bernoulli polynomials in higher dimensions by using Clifford algebras. Due to the fact that the obtained Bernoulli polynomials are special hypercomplex holomorphic (monogenic) functions in the sense of Clifford Analysis, they have properties very similar to those of the classical polynomials. Hypercomplex Pascal and Bernoulli matrices are defined and studied, thereby generalizing results recently obtained by Zhang and Wang (Z. Zhang, J. Wang, Bernoulli matrix and its algebraic properties, Discrete Appl. Math. 154 (11) (2006) 1622-1632).     

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

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

Jordan canonical form of Pascal-type matrices via sequences of binomial type

In this paper, we study the Jordan canonical form of the generalized Pascal functional matrix associated with a sequence of binomial type, and demonstrate that the transition matrix between the generalized Pascal functional matrix and its Jordan canonical form is the iteration matrix associated with the binomial sequence. In addition, some combinatorial identities are derived from the corresponding matrix factorization.