INVERSE EIGENVALUE PROBLEM OF HERMITIAN GENERALIZED ANTI-HAMILTONIAN MATRICES

§1　IntroductionWe considerthe following inverse eigenvalue problem offinding an n-by-n matrix A∈S such thatAxi =λixi,i =1,2 ,...,m,where S is a given set of n-by-n matrices,x1 ,...,xm(m≤n) are given n-vectors andλ1 ,...,λmare given constants.Let X=(x1 ,...,xm) ,Λ=(λ1 ,λ2 ,...,λm) ,then the above inverse eigenvalue problemcan be written as followsProblem Given X∈Cn×m,Λ=(λ1 ,...,λm) ,find A∈S such thatAX =XΛ,where S is a given matrix set.We also discuss the so-called opti…     

有限局部环Z/2\+kZ上斜对称矩阵标准形和伪辛群的阶

设R=Z/2\+kZ(k>1)是\{2\}[TX-]为非单位的有限局部环. 该文首先确定了R上斜对称矩阵标准形. 设G\+m\-p(R,H)={P∈GL\-m(R)|PHP′=H}是由矩阵H确定的伪辛群,其中H=[JB((][HL(2]0[]I\+\{(v)\}\=-I\+\{(v)\}[]0[HL)][JB))]Δ，Δ=[JB((][HL(2]\{2\}[TX-]\+\{k-1\}[]\{1\}[TX-]\=-\{1\}[TX-][]0[HL)][JB))]. 其次,计算了伪辛群G\+m\-P(R,H)的阶|G\+m\-P(R,H)|.     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

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.但是对于奇数阶矩阵,在划分子矩阵时,要作特殊处理才能继续使用此算法.本文提出了一种非等阶“十”字架划分方法,可以最少化填零,最大化性能,使得奇数阶矩阵乘法的时间复杂性更加接近偶数阶矩阵乘法的效果.计算实例显示该方法是有效的.     

A Comparative Study on Dynamic and Static Sparsity Patterns in Parallel Sparse Approximate Inverse Preconditioning

Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. This revised version was published online in July 2006 with corrections to the Cover Date.