三对角与五对角Toeplitz矩阵求逆的算法

提出了一种求三对角与五对角Toeplitz矩阵逆的快速算法,其思想为先将Toeplitz矩阵扩展为循环矩阵,再快速求循环矩阵的逆,进而运用恰当矩阵分块求原Toeplitz矩阵的逆的算法.算法稳定性较好且复杂度较低.数值例子显示了算法的有效性和稳定性,并指出了算法的适用范围.     

求分块三对角矩阵和分块周期三对角矩阵逆矩阵的快速算法

给出了分块三对角矩阵逆矩阵的快速算法,并利用所给算法得到了求分块周期三对角矩阵逆矩阵的快速算法.最后通过算例表示算法的有效性.     

基于部分基变量的LP问题矩阵算法

基于部分基变量提出了LP问题的矩阵算法. 该算法以最优基矩阵的一个充分必要条件为基础,首先将一个初始矩阵转化为右端项和检验数均满足要求的矩阵,再转为检验数满足要求的基矩阵,最后转化为最优基矩阵.该算法具有使用范围广、计算规模小、计算过程简化、计算机易于实现的优势.矩阵算法的核心运算是求逆矩阵的运算,提出了矩阵算法的求逆问题,讨论并给出了求逆快速算法,该算法充分利用了矩阵算法迭代过程中提供的原来的逆矩阵的信息经过简单的变换得到新的逆矩阵,该算法比直接求逆法计算效率更高.     

三对角矩阵求逆的算法

研究了一般的非奇三对角矩阵的求逆,并给出了一个求逆矩阵的简单算法.首先研究了具有Doolittle分解的三对角矩阵的求逆,得到一个求逆的算法,然后将该算法推广到一般的非奇三对角矩阵上.最后给出了该算法与其它求逆方法的比较,可以看到该算法一方面计算量低,另一方面适用于不需任何附加条件的一般的非奇三对角矩阵.     

两类r-循环矩阵求逆的快速算法

本文利用多项式的最大公因式给出的求r-循环矩阵和对称r-循环矩阵求逆的快速算法。该方法不需要计算三角函数并且具有很少的计算量。     

r-对称循环矩阵及逆矩阵三角分解的快速算法

根据r-对称循环矩阵的特殊结构给出了求这类矩阵本身及其逆矩阵三角分解的快速算法,算法的运算量均为O(n2),一般矩阵及逆矩阵三角分解的运算量均为O(n3).     

循环矩阵的求逆

本文给出了循环矩阵的求逆方法,给出了循环矩阵的逆矩阵的表达式.     

循环矩阵的逆的简便计算方法

了循环矩阵如果可逆,则其逆阵必为循环矩阵的重要性质。但其求逆阵的方法并未利用上述性质,故仍较繁琐。本文旨在上文的基础上,利用分块矩阵的求逆,寻求循环矩阵的逆的简便     

某些特殊循环矩阵的逆

贵刊1986年第10期,姚存峰给出了求循环矩阵的逆矩阵的一个方法。此法虽然解决了循环矩阵的求逆问题,但在实际应用中因有大量的三角函数运算等问题,因此此法使用起来不太方便.本文就某些特殊类型的循环矩阵的求逆问题进行探讨,给出一些简便方法. 设循环矩阵A为     

关于(R,r)-循环分块矩阵求逆与相乘的一种快速算法

利用矩阵分块逐次降阶的方法和快速富里叶变换(FFT),给出了mn阶(R,r)-循环分块矩阵求逆与相乘的一种快速算法,证明了其计算复杂性为O(mnlog2mn).     

0-1对策的完全混合Nash均衡的代数求解法

将求解一般0-1策略对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程组的问题.作为一种特殊而重要的情形,利用Pascal矩阵,Newton矩阵(对角元素为Newton二项式系数的对角矩阵)和Pascal-Newton矩阵(Pascal矩阵和Newton矩阵的逆阵的乘积)将求解对称0-1对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程的问题,并给出第二问题的反问题(由完全混合Nash均衡求解对称0-1对策族)的求解方法.同时,给出了一些算例来说明对应问题的算法.     

Multiplicativity and compatibility of generalized matrix norms

It is well known that if a generalized matrix norm is multiplicative, then it has a compatible vector norm associated with it. The converse, however, is invalid, and the precise relation between multiplicativity and compatibility is here explored for a generalized matrix norm. In the process, certain methods for deriving one norm from another are mentioned.     

Functionally commutative matrices and matrices with constant eigenvectors

Several theorems are proved showing when a functionally commutative matrix must have a set of constant eigenvectors. Theorems for the converse implication are also given. Counterexamples to both implications in the general case are shown.     

APPROXIMATION BY A CLASS OF MODIFIED SZASZ-DURRMEYER OPERATORS

ThisprojectissupportedbyZhejiangProvincialFoundationofChina.1.IntroductionForjEC[0,1]ther-thBernsteinpolynomialisdefinedbyItwasshownbyH.BerensandG.G.Lorentz([2]in1972)thatif0相似文献   

The fan-pall imbedding theorem over formally real fields

The converse of the Cauchy interlacing theorem, relating eigenvalues of a symmetric real matrix and eigenvalues of a principal submatrix, first proved by Fan and Pall, is extended to the case of symmetric matrices with entries in an arbitrary formally real field.     

Commutative matrix subalgebras and length function

It is proved that if the length of a commutative matrix subalgebra is maximal then this subalgebra is maximal under inclusion. The examples are given showing that the converse does not hold. To establish this result, we prove several fundamental properties of the length function.     

Estimate on the Pathwise Lyapunov Exponent of Linear Stochastic Differential Equations with Constant Coefficients

In this article, we study the problem of estimating the pathwise Lyapunov exponent for linear stochastic systems with multiplicative noise and constant coefficients. We present a Lyapunov type matrix inequality that is closely related to this problem, and show under what conditions we can solve the matrix inequality. From this we can deduce an upper bound for the Lyapunov exponent. In the converse direction, it is shown that a necessary condition for the stochastic system to be pathwise asymptotically stable can be formulated in terms of controllability properties of the matrices involved.     

Approximation by a class of modified Bernstein-Durrmeyer operators

We modify Bernstein-Durrmeyer operators by means of digonal matrix which overcome a difficulty in extending a Berens-Lorentz result to the Bernstein-Durrmeyer operators for second order of smoothness. The direct and converse theorems for these operators in L_p are also presented by Ditzian-Totik modulus of smoothness. Supported by Zhejiang Provincial Foundation of China     

The fan-pall imbedding theorem over formally real fields

The converse of the Cauchy interlacing theorem, relating eigenvalues of a symmetric real matrix and eigenvalues of a principal submatrix, first proved by Fan and Pall, is extended to the case of symmetric matrices with entries in an arbitrary formally real field.     

A note on Potter’s theorem for quasi-commutative matrices

We discuss the converse of a theorem of Potter stating that if the matrix equation AB=ωBA is satisfied with ω a primitive qth root of unity, then A^q+B^q=(A+B)^q. We show that both conditions have to be modified to get a converse statement and we present a characterization when the converse holds for these modified conditions and q=3 and a conjecture for the general case. We also present some further partial results and conjectures.