线性流形上双对称阵逆特征值问题

A = （aij） Rn×n is termed bisymmetric matrix if We denote the set of all n×n bisymmetric matrices by BSRn×n Let Where when n =2k, and n = 2k+1, In this paper, we discuss the following two problems: Problem Ⅰ. Given X Rn×m, B Rn×m. Find A S such that Problem Ⅱ. Given A* E Rn×n. Find A SE such that Where is Frobenius norm, and SE is the solution set of Problem I. In this paper the general representation of SE has been given. The necessary and sufficient conditons have been presented for Problem I0. For Problem Ⅱ the expression of the solution has been provided.

EAOR投影迭代算法求解一类对称双正型线性互补问题

研究求解一类对称双正型的线性互补问题的EAOR迭代算法.证明了由此算法产生的迭代序列的聚点是线性互补问题的解.并且,当互补问题中的矩阵为对称双正加阵或严格对称双正阵时,算法产生的迭代序列存在子序列收敛到互补问题的解.而当矩阵为非退化对称双正加阵时,该序列收敛.

特殊的steinhaus图的同构问题

针对以双对称矩阵为邻接阵的 steinhaus图 ,剖析它的邻接阵的结构 。

对称双正型线性互补问题的多重网格迭代解收敛性理论

多重网格法是七十年代产生并获得迅速发展的快速送代法.八十年代初,此方法开始应用于变分不等式的求解,其中包括一类互补问题,近十年来大量的数值实验证实,算法是成功的,而算法的收敛性理论也正在逐步建立,当A正定对称时的多重网格收敛性可见[3]和[7];[4]讨论了A半正定时的情况·本文考虑A为更广的一类矩阵:对称双正阵(见定义1.1),建立互补问题:

Matrix Approach in Wavelet Analysis

In this paper, we give a survey of matrix approach in wavelet theory , and describe some related results which were obtained by ourselves.