HGAH矩阵的逆特征值问题

In this paper, the inverse eigenvalue problem of Hermitian generalized anti-Hamihonian matrices and relevant optimal approximate problem are considered. The necessary and sufficient conditions of the solvability for inverse eigenvalue problem and an expression of the general solution of the problem are derived. The solution of the relevant optimal approximate problem is given.     

关于镜面反射矩阵的注记

涉及到矩阵分解时,镜面反射矩阵起着非常重要的作用.讨论镜面反射矩阵的若干性质,给出了镜面反射矩阵一个重要性质的逆命题.即当n阶Hermite矩阵的特征值与镜面反射矩阵的特征值相同时,该Hermite矩阵恰好是一个镜面反射矩阵.     

关于某些循环矩阵的特征值

本文给出了某些循环矩阵特征值的具体形状和降阶计算方法.     

关于一个矩阵迹的不等式的注记

本文修正了［２］中的一个矩阵迹的不等式的一些错误，证明了ｔｒ［（Ａａ一Ｂａ）（Ａ一β一Ｂβ）］＜０当且仅当αβ＞０且Ａ≠Ｂ，ｔｒ［（Ａａ－Ｂａ）（Ａ－β－Ｂ－β）］＞０当且仅当αβ＜０且Ａ≠Ｂ，这里Ａ，Ｂ是ｎ×ｎ的Ｈｅｒｍｉｔｅ正定矩阵．     

关于两个厄米特矩阵乘积的特征值的估计问题

设A,B是两个任意的n阶厄米特矩阵(不假定A,B正定)。本文利用A,B的特征值给出了乘积矩阵AB的特征值的取值范围,基本上解决了对两个n阶厄米特矩阵乘积的特征值的估计,当A,B都是正定阵时,我们的结果大大地改进了[3]的结果。     

关于对称块轮换矩阵的注记

本文研究了对称块轮换矩阵和对称块轮换矩阵束的特征值和广义特征值问题。导出了它们的特征分解。当对称块轮换矩阵的每个块本身也是轮换矩阵时,本文的结果校正了[2]中的错误。     

关于矩阵多项式特征值界的注记

本文讨论矩阵多项式特征值定域问题.首先对Higham和Tisseur[Linear Algebra Appl.,358(2003),5-22]得到的结果给出较详细的比较.然后利用分块矩阵谱半径的估计给出了获取特征值界的一种新办法.利用这种新办法,不但可以简明地得出很多已有的界,且对椭圆及双曲矩阵多项式得出了特征值的新的界.     

上三角Toeplitz矩阵的一个结论

本得出了上三角Toeplitz矩阵关于矩阵乘法构成一交换群的结果,并给出其逆矩阵的计算方法．     

关于反中心对称矩阵的某些性质探讨

利用反中心对称矩阵的定义以及翻转矩阵等技巧,给出了反中心对称矩阵的伴随矩阵、特征值及特征向量的一些新结论.     

关于厄米特矩阵乘积特征值的讨论

讨论厄米特矩阵乘积的特征值 ,推广了文 [1 ]的结果 .指出了文 [2 ]中的一个错误 ,给出了关于迹的一个不等式 .     

上三角Toeplitz矩阵的一个结论

本文得出了上三角 Ｔｏｅｐｌｉｔｚ 矩阵关于矩阵乘法构成一交换群的结果,并给出其逆矩阵的计算方法．     

上三角Toeplitz矩阵在线性差分方程中的应用

利用上三角Toeplitz矩阵给出了常系数线性差分方程特解的表达式,对于解常系数线性差分方程带来了方便.     

Noncirculant Toeplitz matrices all of whose powers are Toeplitz

Let a, b and c be fixed complex numbers. Let M _n (a, b, c) be the n × n Toeplitz matrix all of whose entries above the diagonal are a, all of whose entries below the diagonal are b, and all of whose entries on the diagonal are c. For 1 ⩽ k ⩽ n, each k × k principal minor of M _n (a, b, c) has the same value. We find explicit and recursive formulae for the principal minors and the characteristic polynomial of M _n (a, b, c). We also show that all complex polynomials in M _n (a, b, c) are Toeplitz matrices. In particular, the inverse of M _n (a, b, c) is a Toeplitz matrix when it exists.     

A fast algorithm for solving a Toeplitz system

In this paper, we present a fast algorithm for solving Symmetric penta-diagonal systems. We give the feasibility and Stability analysis of the algorithm. Moreover, parallel computations can be implemented in the algorithm. The numerical examples verify the efficiency of the algorithm.     

关于Toeplitz矩阵的非奇异性

本讨论了Toeplitz矩阵的非奇异性，给出了Toeplitz矩阵非奇异的的一些判别条件。     

Band Toeplitz preconditioners for block Toeplitz systems

We consider the solutions of block Toeplitz systems with Toeplitz blocks by the preconditioned conjugate gradient (PCG) method. Here the block Toeplitz matrices are generated by nonnegative functions f(x,y). We use band Toeplitz matrices as preconditioners. The generating functions g(x,y) of the preconditioners are trigonometric polynomials of fixed degree and are determined by minimizing (f − g)/f∞. We prove that the condition number of the preconditioned system is O(1). An a priori bound on the number of iterations for convergence is obtained.     

Matrix representations of truncated Toeplitz operators

In this paper we describe matrix representations of truncated Toeplitz operators on the model space _KB$K_B$, where B is an infinite Blaschke product satisfying some additional conditions. Our results are extensions of that obtained by Cima, Ross and Wogen in 2008.     

A fast algorithm for solving Toeplitz penta-diagonal systems

In this paper a fast algorithm for solving a large system with a symmetric Toeplitz penta-diagonal coefficient matrix is presented. This efficient method is based on the idea of a system perturbation followed by corrections and is competitive with standard methods. The error analysis is also given.     

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

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

A mean value algorithm for Toeplitz matrix completion

In this paper, we propose a new mean value algorithm for the Toeplitz matrix completion based on the singular value thresholding (SVT) algorithm. The completion matrices generated by the new algorithm keep a feasible Toeplitz structure. Meanwhile, we prove the convergence of the new algorithm under some reasonal conditions. Finally, we show the new algorithm is much more effective than the ALM (augmented Lagrange multiplier) algorithm through numerical experiments and image inpainting.