增次广义Vandermonde矩阵

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

Determinants and Algebraic Identities Associated with the Root Systems of Classical Lie Algebras

Burnside asked questions about periodic groups in his influential paper of 1902. The study of groups with exponent six is a special case of the study of the Burnside questions on which there has been significant progress. It has contributed a number of worthwhile aspects to the theory of groups and in particular to computation related to groups. Finitely generated groups with exponent six are finite. We investigate the nature of relations required to provide proofs of finiteness for some groups with exponent six. We give upper and lower bounds for the number of sixth powers needed to define the largest 2-generator group with exponent six. We solve related questions about other groups with exponent six using substantial computations which we explain.     

Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices

In this paper, we derive a numerical recipe for the calculation of the inversion of the confluent Vandermonde matrix. The main result of this article does not require any symbolic calculations and therefore can be performed by a numerical algorithm implemented either in any high level (like Matlab or Mathematica) or low level programming language (C/C++/Java/Pascal/Fortran, etc.). The computational complexity of the presented algorithm is of an O(N²) class being, by the linear term, better than the ordinary Gauss elimination method. Moreover, a ready to use C++ full implementation of the algorithm is attached.     

Vandermonde sets and super-Vandermonde sets

Given a set TGF(q), |T|=t, w_T is defined as the smallest positive integer k for which ∑_yTy^k≠0. It can be shown that w_Tt always and w_Tt−1 if the characteristic p divides t. T is called a Vandermonde set if w_Tt−1 and a super-Vandermonde set if w_T=t. This (extremal) algebraic property is interesting for its own right, but the original motivation comes from finite geometries. In this paper we classify small and large super-Vandermonde sets.     

On Meinardus' examples for the conjugate gradient method

The conjugate gradient (CG) method is widely used to solve a positive definite linear system of order . It is well known that the relative residual of the th approximate solution by CG (with the initial approximation ) is bounded above by

   with

where is 's spectral condition number. In 1963, Meinardus (Numer. Math., 5 (1963), pp. 14-23) gave an example to achieve this bound for but without saying anything about all other . This very example can be used to show that the bound is sharp for any given by constructing examples to attain the bound, but such examples depend on and for them the th residual is exactly zero. Therefore it would be interesting to know if there is any example on which the CG relative residuals are comparable to the bound for all . There are two contributions in this paper:

1. A closed formula for the CG residuals for all on Meinardus' example is obtained, and in particular it implies that the bound is always within a factor of of the actual residuals;
2. A complete characterization of extreme positive linear systems for which the th CG residual achieves the bound is also presented.

     

全纯曲线的例外超平面∗

文章讨论了到复射影空间P^N (C)的全纯曲线交超平面的问题,借助Vandermonde行列式, 构造了一些具有N+1个例外超平面的非线性退化的全纯曲线和具有2N个例外超平面的线性退化的非常映射全纯曲线,说明了 Nochka 的全纯曲线的第二基本定理是最优的.最后还构造了具有2N个例外值的N值非常数代数体函数.     

Lower and upper bounds of condition number for Vandermonde-wise matrices and method of fundamental solutions using pseudo radial-lines

Consider the method of fundamental solutions (MFS) for 2D Laplace's equation in a bounded simply connected domain $S$. In the standard MFS, the source nodes are located on a closed contour outside the domain boundary $\mathrm{\Gamma }(=\partial S)$, which is called pseudo-boundary. For circular, elliptic, and general closed pseudo-boundaries, analysis and computation have been studied extensively. New locations of source nodes are proposed along two pseudo radial-lines outside $\mathrm{\Gamma }$. Numerical results are very encouraging and promising. Since the success of the MFS mainly depends on stability, our efforts are focused on deriving the lower and upper bounds of condition number (Cond). The study finds stability properties of new Vandermonde-wise matrices on nodes $x_i\in [a,b]$ with . The Vandermonde-wise matrix is called in this article if it can be decomposed into the standard Vandermonde matrix. New lower and upper bounds of Cond are first derived for the standard Vandermonde matrix, and then for new algorithms of the MFS using two pseudo radial-lines. Both lower and upper bounds of Cond are intriguing in the stability study for the MFS. Numerical experiments are carried out to verify the stability analysis made. Since the fundamental solutions (as $\{\ln |\overline{{PQ}_i}|\}$) are the basis functions of the MFS, new Vandermonde-wise matrices are found. Since the nodes $x_i\in [a,b]$ with may come from approximations and interpolations by the Laurent polynomials with singular part, the conclusions in this article are important not only to the MFS but also to matrix analysis.