PROFILE MINIMIZATION PROBLEM FOR MATRICES AND GRAPHS

ＰＲＯＦＩＬＥＭＩＮＩＭＩＺＡＴＩＯＮＰＲＯＢＬＥＭＦＯＲＭＡＴＲＩＣＥＳＡＮＤＧＲＡＰＨＳＬＩＮＹＩＸＵＮ（林詒勋）；ＹＵＡＮＪＩＮＪＩＡＮＧ（原晋江）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈｅｎｇｚｈｏｕＵｎｉｖｅｒｓｉｔｙ，Ｚｈｅ...     

THE DYNAMICS FOR THE PRIME PRINCIPLECLASSICAL AND QUANTUM CHAOS

In this paper we study the dynamics for the prime principle. The p-nonlinear equations are derived from the prime principle. It defines the p-chaotic functions and studies the local solutions and global stability for the p-nonlinear equations. It suggests a new method for studying the nonlinear equations that studying the stability and instability of the p-nonlinear equations is transformed into studying the stability and instability for the nonliner terms of de~A/dt in the chaotic equations.     

ESTIMATE FOR DISTANCE-COEFFICIENT OF MATRICES

ＥＳＴＩＭＡＴＥＦＯＲＤＩＳＴＡＮＣＥ┐ＣＯＥＦＦＩＣＩＥＮＴＯＦＭＡＴＲＩＣＥＳＬＵＦＡＮＧＹＡＮＡｂｓｔｒａｃｔ．ＭｏｔｉｖａｔｉｏｎｏｆｔｈｉｓｐａｐｅｒｉｓａｎｏｐｅｎｐｒｏｂｌｅｍｅｘｐｏｓｅｄｂｙＢ．Ｂｅａｕｚａｍｙ［１］．ＬｅｔＭｂｅａ...     

PERTURBATION THEOREMS ON HERMITIAN MATRICES AND NEARLY HERMITIAN MATRICES

The problem of relating the eigervalues of an n×n Hermitian matrix to those of its Rayleigh-Ritz approximation is considered. The same residual bound for unitarily invariant norms on Hermilian matrices is obtained even without the orlhonormal and Rayleigh-Ritz assumptions in Stewart and Sun's book [9,Theorem IV. 4.14]. The result can also be extended to nearly Hermitian matrices.     

GENERALIZED EIGENVALUE APPROXIMATION FOR BAND MATRICES

The exponential decay of the entries of inverses of band ma-trices has been used to establish local rates of convergence ofspline approximations[8],[11],[12]and to bound the L_∞ norm ofthe orthogonal projection onto spline spaces[7].For generalbanded,invertible matrices the first proof appeared in[8].A     

GENERALIZED NEKRASOV MATRICES AND APPLICATIONS

In this paper,the concpet of generalized Nekrasov matrices in introduced,some prop-erties of these matrices are discussed,obtained equivalent representation of generalized diagonally dominant matrices.     

H-MATRICES AND S-DOUBLY DIAGONALLY DOMINANT MATRICES

§1　IntroductionSpecial matrices,especially H-matricesand M-matrices,have very wide applications innumerical calculations,control theory,mathematical physics,optimization techniques andso on.In recenttwo orthree decades,the studies in these matrices are fruitful,and manygraceful equivalentconditions to M-matrices have been proposed.By contrast,though theH-matrices are closely related with M-matrices,researches on H-matrices show that theproblems in H-matrices are more difficultand some res…     

INTERSECTION OF PRIME SUBMODULES AND DIMENSION OF MODULES

The aim of this paper is to study the conditions by which a P-prime submodule can be expressed as a finite intersection or union of P-prime submodules. Also corresponding to dimension and rank of modules, some equivalent conditions for a ring to be a Dedekind domain are given.     

SOME NEW FAMILIES OF SDSS AND HADAMARD MATRICES

ＳＯＭＥＮＥＷＦＡＭＩＬＩＥＳＯＦＳＤＳＳＡＮＤＨＡＤＡＭＡＲＤＭＡＴＲＩＣＥＳ￥ＸｉａＭｉｎｇｙｕａｎ（夏明远）（Ｄｅｐｔ．ｏｆＭａｔｈ．，ＨｕａｚｈｏｎｇＮｏｒｍａｌＵｎｉｕ．，Ｗｕｈａｎ４３００７０，Ｃｈｉｎａ．）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｉｓ...     

UNCONDITIONAL CAUCHY SERIES AND UNIFORM CONVERGENCE ON MATRICES

The authors obtain new characterizations of unconditional Cauchy series in termsof separation properties of subfamilies of P(N), and a generalization of the Orlicz-PettisTheorem is also obtained. New results on the uniform convergence on matrices anda new version of the Hahn-Schur summation theorem are proved. For matrices whoserows define unconditional Cauchy series, a better sufficient condition for the basicMatrix Theorem of Antosik and Swartz, new necessary conditions and a new proof ofthat theorem are given.     

SOME PROPERTIES OF CENTROSYMMETRIC MATRICES AND ITS APPLICATIONS

In this paper, some properties of centrosymmetric matrices, which often appear in the construction of orthonormal wavelet basis in wavelet analysis, are investigated. As an application, an algorithm which is tightly related to a so-called Lawton matrix is presented. In this algorithm, about only half of memory units are required and quarter of computational cost is needed by exploiting the property of the Lawton matrix and using a compression technique, it is compared to one for the original Lawton matrix.     

NON-ISOMORPHIC GROUPS WITH ISOMORPHICSPECTRAL TABLES AND BURNSIDE MATRICES

ＮＯＮ－ＩＳＯＭＯＲＰＨＩＣＧＲＯＵＰＳＷＩＴＨＩＳＯＭＯＲＰＨＩＣＳＰＥＣＴＲＡＬＴＡＢＬＥＳＡＮＤＢＵＲＮＳＩＤＥＭＡＴＲＩＣＥＳ￥Ｗ．ＫＩＭＭＥＲＬＥ；Ｋ．Ｗ．ＲＯＧＧＥＮＫＡＭＰ（ＭａｔｈｅｍａｔｉｓｃｈｅｓｉｎｓｔｉｔｕｔＢ，Ｕｎｉｖｅｒｓ...     

ON THE JOINT SPECTRUM FOR N-TUPLE OF HYPONORMAL OPERATORS

Let A=(A_1,…,A,)be an n-tuple of double commuting hyponormal operators.It is-proved that:1.The joint spectrum of A has a Cartesian decomposition:Re[Sp(A)]=S_p(ReA),Im[Sp(A)]=Sp(ImA);2.The.joint resolvent of A satisfies the growth condition:‖()‖=1/(dist(z,Sp(A)));3.If 0σ(A_i),i=1,2,…,n,then‖A‖=γ_(sp)(A).     

CHARACTERISTIC MATRICES AND SIMILARITY OF TIME-VARYING LINEAR DIFFERENTIAL SYSTEMS

1IntroductionLineardial'~rentialsystemsa.rethesimplestmod(}lsinmotiolls,tijoyarcwidelyusedincontroltheory,Inechanlcsandengineel'illg.Invest;igationsoiltileasymptoticpropertiesoftinea,rSystclllshay')oss(3ntialsense.Fbi'tilelin(3arsy'stemswithconstantcoeffi…     

THE SOLVABILITY CONDITIONS FOR INVERSE EIGENVALUE PROBLEM OF ANTI-BISYMMETRIC MATRICES

AbstractThis paper is mainly concerned with solving the following two problems: Problem I. Given X Cnxm, A = diag( 1, 2, ..... , m) Cmxm . Find A ABSRnxn such thatAX = XAwhere ABSRnxn is the set of all real n x n anti-bisymmetric matrices. Problem II. Given A RnXn. Find A SE such thatwhere || || is Frobenius norm, and SE denotes the solution set of Problem I.The necessary and sufficient conditions for the solvability of Problem I have been studied. The general form of SB has been given. For Problem II the expression of the solution has been provided.     

FRANCIS QL ALGORITHM FOR FINDING THE EIGENVALUES OF ANTI-SYMMETRIC MATRICES

In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.     

THE INVERSE PROBLEM FOR PART SYMMETRIC MATRICES ON A SUBSPACE

In this paper, the following two problems are considered:Problem Ⅰ. Given S∈E Rn×p,X,B 6 Rn×m, find A ∈ SRs,n such that AX = B, where SR8,n = {A∈ Rn×n|xT(A - AT) = 0, for all x ∈ R(S)}.Problem Ⅱ. Given A* ∈ Rn×n, find A ∈ SE such that ||A-A*|| = minA∈sE||A-A*||, where SE is the solution set of Problem Ⅰ.The necessary and sufficient conditions for the solvability of and the general form of the solutions of problem Ⅰ are given. For problem Ⅱ, the expression for the solution, a numerical algorithm and a numerical example are provided.     

ON THE ｛2｝－INVERSE AND SOME ORDERING PROPERTIES OF NONNEGATIVE DEFINITE MATRICES

ＥＲＫＫＩＰ．ＬＩＳＫＩ（ＤｅｐｅｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃａｌＳｃｉｅｎｃｅｓ，ＵｎｉｖｅｒｓｉｔｙｏｆＴａｍｐｅｒｓ，Ｆｉｎｌａｎｄ）ＷＡＮＧＳＯＮＧＧＵＩ（王松桂）（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，Ｂｅｉ...