多元λ-矩阵行列式的FFT展开法

我们知道,直接展开一个λ-矩阵的行列式,其工作量是很大的。对于多元多项式矩阵(即每个元素为多元多项式的矩阵)的行列式展开,工作量则更为惊人。本文利用多维FFT得到了求多元多项式矩阵行列式的一个简单快速的计算方法,并估计了计算复杂性的上界。     

二元整系数多项式因式分解的一种理论和算法

将二元多项式看成系数为一元多项式的一元多项式来进行分解，本文建立了二元整系数多项式因式分解的一种理论，提出了一个完整的分解二元整系数多项式的新算法．这个算法能自然地推广到多元整系数多项式的分解中去．     

Z／mZ上的多元置换多项式

本文研究了一类典型的模ｐ的多元奇异多项式，得到了它们是模Ｐｌ（ｌ＞１）的置换多项式的充要条件并给出了一个是模ｐ２的置换多项式但不是模ｐ３的置换多项式的多元多项式例子，从而说明模ｐｌ（ｌ＞１）的多元置换多项式不能（象一元那样）简化到模ｐ上．     

多元多项式系统三种结式关系的探讨

研究了多元多项式系统的Sylvester结式、Dixon结式以及混合CayleySylvester结式之间是否存在特定关系的问题,利用构造混合结式矩阵的方法证明了在满足一定的条件下,多元多项式系统的这些结式的绝对值都相等.而对于一般的多元多项式系统,也证实了上述这些结式之间仅仅相差一个因子,推广了两变元多项式系统的结论.     

交换环上全矩阵代数迹恒等式的几个定理

本文研究了交换环上全矩阵代数的迹恒等式，特别研究了积的迹为零的多项式，它好比矩阵或多项式正交，在现代物理学中有着十分广泛的应用．     

多项式组特征列的矩阵求法

基于矩阵多元多项式的带余除法,给出了代数情形多项式组特征列的一种新求法,并举例验证了这种方法的有效性.     

一种广义周期Besov类的多元周期多项式样条逼近

本文证明多元多项式周期样条空间是某些多元周期光滑函数类的关于Kolmogorov n-宽度的弱渐近极子空间．给出了广义周期Besov类的一种推广，得到了空间元素的一种表示定理，不仅给出了一种多元周期多项式样条算子．而且证明了所得的结果．     

Cauchy-Binet定理与Laplace定理的等价证明

本文运用分块矩阵及多元多项式的性质对行列式求值中的Cauchy-Binet 定理与Laplace 定理给出了等价证明.     

多项式矩阵根的研讨

引用源根研讨多项式的矩阵根，获得了一个矩阵M为多项式矩阵根的充要条件，并给出了求多项式矩阵根的简便方法。     

基于LMI方法的MIMO系统鲁棒D-稳定的频域判定

研究了具有结构不确定性的多输入多输出(MIMO)系统的鲁棒D-稳定性判定问题．首先提出了系统的3种数学模型,包括凸多面体型多项式矩阵模型、多线性型多项式矩阵模型和反馈型多项式矩阵模型．然后分析了各模型在参数空间中的凸性,从而将系统的稳定性检验问题转化为线性矩阵不等式(LMI)的可行性问题,并由此给出了D-稳定性的判定方法．     

Convergence theory of extrapolated iterative methods for a certain class of non-symmetric linear systems

Summary A variety of iterative methods considered in [3] are applied to linear algebraic systems of the formAu=b, where the matrixA is consistently ordered [12] and the iteration matrix of the Jacobi method is skew-symmetric. The related theory of convergence is developed and the optimum values of the involved parameters for each considered scheme are determined. It reveals that under the aforementioned assumptions the Extrapolated Successive Underrelaxation method attains a rate of convergence which is clearly superior over the Successive Underrelaxation method [5] when the Jacobi iteration matrix is non-singular.     

模糊数互补判断矩阵的乘性一致性检验及改进方法

针对模糊数互补判断矩阵的乘性一致性检验及改进问题进行研究。在文献[11]引入模糊数的Q-算子和模糊数互补判断矩阵的Q-算子矩阵概念的基础上,通过构造具有乘性一致性的特征矩阵及偏差矩阵,建立了衡量乘性一致性程度的指标值并用设定阈值的方法给出了满意乘性一致性的概念,对于不满足满意乘性一致性的情况提出了改进方法。最后通过一个算例说明了此方法的可行性。     

Computing the matrix exponential and other matrix functions

In this note we present an algorithm for the computation of matrix functions, especially the matrix exponential. It is a new application of the so-called ‘elimination method’, which was presented for the scalar case in previous papers (e.g. [5]).     

An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems

A new implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric generalized eigenvalue problems is presented. The new method improves and generalizes the SHIRA method of Mehrmann and Watkins (2001) [37] to the case where the skew-symmetric matrix is singular. It computes a few eigenvalues and eigenvectors of the matrix pencil close to a given target point. Several applications from control theory are presented and the properties of the new method are illustrated by benchmark examples.     

Resolving degeneracy in quadratic programming

A technique for the resolution of degeneracy in an Active Set Method for Quadratic Programming is described. The approach generalises Fletcher's method [2] which applies to the LP case. The method is described in terms of an LCP tableau, which is seen to provide useful insights. It is shown that the degeneracy procedure only needs to operate when the degenerate constraints are linearly dependent on those in the active set. No significant overheads are incurred by the degeneracy procedure. It is readily implemented in a null space format, and no complications in the matrix algebra are introduced.The guarantees of termination provided by [2], extending in particular to the case where round-off error is present, are preserved in the QP case. It is argued that the technique gives stronger guarantees than are available with other popular methods such as Wolfe's method [11] or the method of Goldfarb and Idnani [7].Presented at the 14th International Symposium on Mathematical Programming, Amsterdam, August 5–9, 1991.     

Projection method for solving a singular system of linear equations and its applications

Summary The iterative method for solving system of linear equations, due to Kaczmarz [2], is investigated. It is shown that the method works well for both singular and non-singular systems and it determines the affine space formed by the solutions if they exist. The method also provides an iterative procedure for computing a generalized inverse of a matrix.     

一种基于组合不确定型OWGA算子的区间数群决策方法

本文研究了区间数群决策信息的集结方法。基于区间数两两比较的可能度矩阵公式和互补判断矩阵的排序公式,推广了文献[3]提出的不确定型OWGA算子,提出了一种组合不确定型OWGA算子,给出了其在应用过程中的具体步骤,并提出了一种相应的集结群决策信息的方法,最后通过一个算例说明了该方法的有效性与可行性,并与文献[3]的结果作了对比分析。     

On the stability of the incomplete Cholesky decomposition for a singular perturbed problem,where the coefficient matrix is not an M-matrix

The incomplete Cholesky decomposition is known as an excellent smoother in a multigrid iteration and as a preconditioner for the conjugate gradient method. However, the existence of the decomposition is only ensured if the system matrix is an M-matrix. It is well-known that finite element methods usually do not lead to M-matrices. In contrast to this restricting fact, numerical experiments show that, even in cases where the system matrix is not an M-matrix the behaviour of the incomplete Cholesky decomposition apparently does not depend on the structure of the grid. In this paper the behaviour of the method is investigated theoretically for a model problem, where the M-matrix condition is violated systematically by a suitable perturbation. It is shown that in this example the stability of the incomplete Cholesky decomposition is independent of the perturbation and that the analysis of the smoothing property can be carried through. This can be considered as a generalization of the results for the so called square-grid triangulation, as has been established by Wittum in [12] and [11].     

On computing PageRank via lumping the Google matrix

Computing Google’s PageRank via lumping the Google matrix was recently analyzed in [I.C.F. Ipsen, T.M. Selee, PageRank computation, with special attention to dangling nodes, SIAM J. Matrix Anal. Appl. 29 (2007) 1281–1296]. It was shown that all of the dangling nodes can be lumped into a single node and the PageRank could be obtained by applying the power method to the reduced matrix. Furthermore, the stochastic reduced matrix had the same nonzero eigenvalues as the full Google matrix and the power method applied to the reduced matrix had the same convergence rate as that of the power method applied to the full matrix. Therefore, a large amount of operations could be saved for computing the full PageRank vector.     

ENUMERATIONS OF ONE-VERTEX MAPS WITH FACE PARTITION ON THE PLANE

In addition to the known method given in [1],authors provide other three methods to the enumeration of one-vertex maps with face partition on the plane.Correspondingly,there are four functional equations in the enufuntion .It is shown that the four equations are equivalent.Moreover,an explicit expression of the solution is found by expanding the powers of the matrix of infinite order directly.This is a new complement of what appeared in [1].