关于方阵高次幂计算方法的一个注记

一般地,求方阵的幂总是先将其标准化,然后通过相似变换得到.然而矩阵的标准化过程却是十分复杂的,所以应用范围受到很大的局限性.利用凯莱-哈密顿(Cayley-Hamilton)定理,可以得到计算方阵高次幂的一种非特征值方法.     

基于特征值理论求分式线性递推数列极限

利用分式线性递推数列与二阶方阵的对应关系,通过求二阶方阵的n次幂,给出了分式线性递推数列的通项表达式.再利用矩阵的特征值与不动点关系,得到了分式线性递推数列敛散性的所有表现形式.     

矩阵幂和问题的进一步讨论

本文证明了;(1)F_p~m上p~m次幂矩阵的充要条件;(2)F_p~m上任一方阵都可表示为2个其最小多项式均无重因式的q次幂矩阵之和;(3)任一整数方阵可表示成不超过7个平方次幂整数矩阵之和,从而推广和改进了文[1,2]的结果.     

整数方阵的Waring问题

本文证明了:对任意给定的整数 m≥2和 n≥2,存在正整数 f(n,m),使得任何 n 阶整数方阵均可表示为 f(n,m)个整数方阵的 m 次幂之和.并对 f(n,m)作了估计,从而推广、改进了 M.Newman 1985年的结果.     

关于矩阵幂和的Newman问题

M.Newman[2]提出以下几个未解决的问题:(1)在 F_2上,确定全体 n 阶平方次幂矩阵的数目。(2)在整数环上,对任意的 n,确定最小的整正数 M(n),使任一 n 阶方阵都可表示成 M(n)个平方次幂矩阵之和。(3)把以上问题推广到高次幂。本文分别讨论上述问题,得到如下结果:(1)给出全体平方矩阵计数公式。(2)对任一整数矩阵,若它可以有理标准化,则可表示成4个平方次矩阵之和。这与数论中著名的 Lagrange 定理[4]相吻合。(3)在域 F_p 上,任一 n 阶方阵都可表示2个 p 次幂矩阵之和。     

10以内自然数的正整数次幂的尾数规律

10以内自然数的正整数次幂的尾数存在许多规律,其中最为奇特的一条规律是:10以内自然数的5次幂尾数就是其本身,即n5(n=0、1、2…9)的尾数为n.笔者通过研究,试图解释这些规律之间的相互联系,以及5次幂尾数巧合背后的一些数学原理.……     

自然数幂求和公式的计算机实现

自然数幂的求和问题 ,一直受到人们的关注 .著名数学家陈景润对此就有过较好的研究 ,更多结果散见其他许多文献 .但都比较烦琐 .本文借助 Mathematica软件 ,利用高阶等差数列的一个结论 :m阶等差数列的充要条件是其前 n项和为 n的 m+ 1次多项式 .给出了一种求自然数幂前 n项和的一种简单方法 .利用此方法还可实现小于 m的自然数幂前 n项和的同时实现 .     

应用公式求高阶差幂数列的通项与前n项和

本文对高阶差幂数列通项公式的构成进行分析研究,从而对求高阶差幂数列的通项与前n项和给出了一种公式计算法.     

用n阶方阵的迹判定其互异特征值的个数

利用n阶方阵A的幂矩阵的迹,给出了判定A的互异特征值个数的充要条件.     

求n阶实方阵A的全部模最大的特征值及其相应特征向量的幂法

本文给出并论证了 ,当 n阶实方阵 A具有 i ( 1≤ i≤ n)个 (即任意多个 )模最大的特征值时 ,用幂法求出这些模最大的特征值及其相应特征向量的方法 .该方法是对幂法理论的进一步完善     

循环矩阵本原指数的上界估计

本文给出了循环矩阵本原指数上界的新的估计及一种由级数较低的循环矩阵的本原指数估计级数较高的循环矩阵的本原指数的方法，解决了一类循环矩阵本原指数的计算问题．     

An iterative method for solving the stable subspace of a matrix pencil and its application

This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a semigroup property depending only on the initial matrix pencil. Via this recursion relationship, we propose an accelerated iterative method to compute the stable subspace and use it to provide a theoretical result to solve the principal square root of a given matrix, both nonsingular and singular. We show that this method can not only find out the matrix square root, but also construct an iterative approach which converges to the square root with any desired order.     

r—不可分矩阵的本原指数

本文给出了 n阶 r—不可分矩阵的本原指数的上界 ,即 n阶 r—不可分矩阵的本原指数 ( A)≤ n-r( 1≤ r2 ,都能找到一类本原指数为 n-1的 n阶 1—不可分矩阵 .证明了 n阶 1—不可分矩阵的本原指数集 En={ 1 ,2 ,… ,wn} ( wn=n-1 ) .     

Krylov iterative methods for the geometric mean of two matrices times a vector

In this work, we are presenting an efficient way to compute the geometric mean of two positive definite matrices times a vector. For this purpose, we are inspecting the application of methods based on Krylov spaces to compute the square root of a matrix. These methods, using only matrix-vector products, are capable of producing a good approximation of the result with a small computational cost.     

Hall exponents of matrices,tournaments and their line digraphs

Let A be a square (0, 1)-matrix. Then A is a Hall matrix provided it has a nonzero permanent. The Hall exponent of A is the smallest positive integer k, if such exists, such that A ^k is a Hall matrix. The Hall exponent has received considerable attention, and we both review and expand on some of its properties. Viewing A as the adjacency matrix of a digraph, we prove several properties of the Hall exponents of line digraphs with some emphasis on line digraphs of tournament (matrices).     

The GK dimension of relatively free algebras of PI-algebras

We prove a strict relation between the Gelfand–Kirillov (GK) dimension of the relatively free (graded) algebra of a PI-algebra and its (graded) exponent. As a consequence we show a Bahturin–Zaicev type result relating the GK dimension of the relatively free algebra of a graded PI-algebra and the one of its neutral part. We also get that the growth of the relatively free graded algebra of a matrix algebra is maximal when the grading is fine. Finally we compute the graded GK dimension of the matrix algebra with any grading and the graded GK dimension of any verbally prime algebra endowed with an elementary grading.     

A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix

Based on a quadratical convergence method, a family of iterative methods to compute the approximate inverse of square matrix are presented. The theoretical proofs and numerical experiments show that these iterative methods are very effective. And, more importantly, these methods can be used to compute the inner inverse and their convergence proofs are given by fundamental matrix tools.     

Factorization of multivariate positive Laurent polynomials

Recently Dritschel proved that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix Fejér–Riesz theorem. Then we discuss a computational method to find approximates of polynomial matrix factorization. Some numerical examples will be shown. Finally we discuss how to compute nonnegative Laurent polynomial factorizations in the multivariate setting.     

A Family of higher-order convergent iterative methods for computing the Moore-Penrose inverse

In this paper, we extend the iterative method for computing the inner inverse of a matrix proposed in Li and Li [W.G. Li, Z. Li, A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix, Applied Mathematics and Computation 215 (2010) 3433-3442] to compute the Moore-Penrose inverse of a matrix, and show that the generated sequence converges to the Moore-Penrose inverse of a matrix in a higher order. The performance of the method is tested on some randomly generated matrices.     

有限局部环上对称矩阵的计数定理(Ⅰ)

设A_n(R)是有限局部环Z/p~k Z上n阶对称矩阵的集合,这里n≥2．p是大于2素数,p≡1(mod4)且k＞1．通过确定有限局部环Z/p~k Z上对称矩阵的标准型,计算出A_n(R)在线性群GL_n(R)作用下的轨道数,从而计算出由特定对称矩阵确定的正交群的阶以及与特定对称矩阵在同一轨道的对称矩阵的阶．