The Improvement of Fischer's Inequality and Hadamard's Inequality

ＴｈｅＩｍｐｒｏｖｅｍｅｎｔｏｆＦｉｓｃｈｅｒ＇ｓＩｎｅｑｕａｌｉｔｙａｎｄＨａｄａｍａｒｄ＇ｓＩｎｅｑｕａｌｉｔｙＨｕａｎｇＬｉｐｉｎｇ（黄礼平）（ＤｅｐａｒｔｍｅｎｔｏｆＢａｓｉｃＳｃｉｅｎｃｅｓ，ＸｉａｎｇｔａｎＭｉｎｉｎｇＩｎｓｔｉｔｕｔｅ，...     

On the absolute matrix summability of Fourier series and some associated series

The object of the paper is to study the absolute matrix summability problem of Fourier series, conjugate series and some associated series under a new set of conditions on matrix methods, generalising many known results in the literature.     

Toeplitz矩阵乘积的封闭性

本文建立了两个Toeplitz矩阵之积仍为Toeplitz矩阵的一个充分必要条件,由此也立即获得了循环矩阵的乘积及其逆也是循环矩阵的已知结果。     

Morphology of Nylon-6 blends with styrenic polymers

The morphology of blends of styrenic polymers in a matrix of 75% Nylon-6 prepared in a Brabender Plasti-Corder was examined by scanning electron microscopy. Styrene/acrylonitrile copolymers (SAN) form smaller particles as the AN level increases owing to the corresponding decrease in the SAN–polyamide interfacial tension. Various styrenic polymers containing functional groups, maleic anhydride or oxazoline type, that can react with Nylon-6 during melt processing were added to the SAN phase which also led to a decrease in the particle size owing to the graft copolymer formed in situ. The effects of functional group type, amount of functional groups per chain, amount of functional polymer added, and the miscibility of the styrene/maleic anhydride (SMA) and SAN copolymers on the morphology of the styrenic phase in the Nylon-6 matrix are described. © 1992 John Wiley & Sons, Inc.     

矩阵方程（A^TXA，B^TXB=（C，D）的反对称解及其最佳逼近

本利用矩阵对的标准相关分解，得到了矩阵方程(A^TXB，B^TXB)=(C，D)反对称解存在的充分必要条件及通解表达式，同时给出了解关于已知矩阵的最佳逼近．     

Winograd矩阵乘法算法用于任意阶矩阵时的一种新处理方法

摘要t矩阵乘法StraSsen算法及其变形winograd算法用分而治之的方法把矩阵乘法时间复杂性由传统的D(n。)改进到0(佗kg。n.但是对于奇数阶矩阵,在划分子矩阵时,要作特殊处理才能继续使用此算法.本文提出了一种非等阶“十”字架划分方法,可以最少化填零,最大化性能,使得奇数阶矩阵乘法的时间复杂性更加接近偶数阶矩阵乘法的效果.计算实例显示该方法是有效的.     

The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands

By showing that there is an upper bound for the price of anarchyρ(Γ) for a non-atomic congestion game Γ with only separable cost maps and fixed demands, Roughgarden and Tardos show that the cost of forgoing centralized control is mild. This letter shows that there is an upper bound for ρ(Γ) in Γ for fixed demands with symmetric cost maps. It also shows that there is a weaker bound for ρ(Γ) in Γ with elastic demands.     

矩阵的合同、相似与二次型

矩阵的合同关系、相似关系都是等价关系，它们虽然不同。但又有联系．对称矩阵是这两个知识点的交汇点。即两个实对称矩阵合同当且仅当它们相似．进一步得到二次型可以通过一个正交变换化为标准型。这一理论是高等代数教科书的重要内容。然而．现行的教科书对该理论的证明至少涉及到二次型、线性空间、线性变换和欧氏空间的内容．本文利用欧氏空间的正交性质给出这一理论新的简洁证明。以供教学参考之用。