对称正交对称矩阵逆特征值问题

Let P∈ Rn×n such that PT = P, P-1 = PT.A∈Rn×n is termed symmetric orthogonal symmetric matrix ifAT = A, (PA)T = PA.We denote the set of all n × n symmetric orthogonal symmetric matrices byThis paper discuss the following two problems:Problem I. Given X ∈ Rn×m, A = diag(λ1,λ 2, ... ,λ m). Find A SRnxnP such thatAX =XAProblem II. Given A ∈ Rnδn. Find A SE such thatwhere SE is the solution set of Problem I, ||·|| is the Frobenius norm. In this paper, the sufficient and necessary conditions under which SE is nonempty are obtained. The general form of SE has been given. The expression of the solution A* of Problem II is presented. We have proved that some results of Reference [3] are the special cases of this paper.     

THE BI-SELF-CONJUGATE AND NONNEGATIVE DEFINITE SOLUTIONS TO THE INVERSE EIGENVALUE PROBLEM OF QUATERNION MATRICES

The main aim of this paper is to discuss the following two problems:λm)∈Hm×m, find A ∈ BSH≥n×n such that AX= X∧, where BSH≥n×n denotes the set of all n × n quaternion matrices which are bi-self-conjugate and nonnegative definite.Problem Ⅱ:Given B ∈ Hn×m, find -B∈SE such that ||B- B||Q = minA∈sE ||B - A||Q,necessary and sufficient conditions for SE being nonempty are obtained. The general form of elements in SE and the expression of the unique solution B of problem Ⅱ are given.     

对称正交对称矩阵反问题的最小二乘解

Let P ∈ Rn×n be a symmetric orthogonal matrix. A∈Rn×n is called a symmetric orthogonal symmetric matrix if AT = A and (PA) T = PA. The set of all n × n symmetric orthogonal symmetric matrices is denoted by SRnxnp. This paper discusses the following problems: Problem I. Given X,B∈ Rn×m, find A ∈SRn×np such that||AX - B|| = min Problem II. Given A∈ Rn×n, find A∈SL such thatwhere ||·|| is the Frobenius norm, and SL is the solution set of Problem I.The general form of SL is given. The solvability conditions for the inverseproblem AX = B in SRn×nP are obtained. The expression of the solution toProblem II is presented.     

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…     

COMPUTING THE NEAREST BISYMMETRIC POSITIVE SEMIDEFINITE MATRIX UNDER THE SPECTRAL RESTRICTION

Let A and C denote real n × n matrices. Given real n-vectors x1, ... ,xm, m ≤ n, and a set of numbers L = {λ1,λ2,... ,λm}. We describe (I) the set (?) of all real n × n bisymmetric positive seidefinite matrices A such that Axi is the "best" approximate to λixi, i = 1,2,...,m in Frobenius norm and (II) the Y in set (?) which minimize Frobenius norm of ||C - Y||.An existence theorem of the solutions for Problem I and Problem II is given and the general expression of solutions for Problem I is derived. Some sufficient conditions under which Problem I and Problem II have an explicit solution is provided. A numerical algorithm of the solution for Problem II has been presented.     

TO SOLVE MATRIX EQUATION sum (A~iXBi=c) BY THE SMITH NORMAL FORM

§ 1　IntroductionLet F be a field,F[λ] be the polynomial ring over F,Fm× n( or Fm× n[λ] ) be the setofall m×n matrices over F( or F[λ] ) .Let M(i) be the ith column of M∈Fm× m[λ] ,i=1 ,...,n.A g-inverse of M∈Fm× n will be denoted by M- and understood as a matrix for whichMM- M=M.In this paper,we discuss the linear matrix equation ki=0Ai XBi =C, ( 1 )where A∈Fm× m,Bi∈Fn× q,i=0 ,1 ,...,k,and C∈Fm× q.Equation( 1 ) is called universally solvable if ithas a solution f…     

Several Results on Systems of Residue Classes

Let (m,n) and a(n) denote the g.c.d, of m, n and the residue class {x∈Z∶x≡α (mod n)} respectively. Any period of the characteristic function ofkU a_i(n_i) is called a covering period of {a_i(n_i)}_(i-1)~k.i-ITheorem Let A = {a_i(n_i)}_(i-1)~k. be a disjoint system (i. e. a_I(n_I,...,a_k(n_k) are pairwise disjoint). Let [n_I,...,n_k] (the I.c.m. of n_1,...,n_k) have the prime faetorization [n_1,...,n_k] = Πp_i~ai and T = Πp_iβi(β_i≥0 be the smallest positive covering period of A. Then     

A common property of R(E,F) and B(R~n,R~m) and a new method for seeking a path to connect two operators

Given two Banach spaces E,F,let B(E,F) be the set of all bounded linear operators from E into F,and R(E,F) the set of all operators in B(E,F) with finite rank.It is well-known that B(Rn) is a Banach space as well as an algebra,while B(Rn,Rm) for m = n,is a Banach space but not an algebra;meanwhile,it is clear that R(E,F) is neither a Banach space nor an algebra.However,in this paper,it is proved that all of them have a common property in geometry and topology,i.e.,they are all a union of mutual disjoint path-connected and smooth submanifolds (or hypersurfaces).Let Σr be the set of all operators of finite rank r in B(E,F) (or B(Rn,Rm)).In fact,we have that 1) suppose Σr∈ B(Rn,Rm),and then Σr is a smooth and path-connected submanifold of B(Rn,Rm) and dimΣr = (n + m)r-r2,for each r ∈ [0,min{n,m});if m = n,the same conclusion for Σr and its dimension is valid for each r ∈ [0,min{n,m}];2) suppose Σr∈ B(E,F),and dimF = ∞,and then Σr is a smooth and path-connected submanifold of B(E,F) with the tangent space TAΣr = {B ∈ B(E,F) : BN(A)-R(A)} at each A ∈Σr for 0 r ∞.The routine methods for seeking a path to connect two operators can hardly apply here.A new method and some fundamental theorems are introduced in this paper,which is development of elementary transformation of matrices in B(Rn),and more adapted and simple than the elementary transformation method.In addition to tensor analysis and application of Thom’s famous result for transversility,these will benefit the study of infinite geometry.     

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.     

Lp-Solutions of Vector Refinement Equations with General Dilation Matrix

The purpose of this paper is to investigate the solutions of refinement equations of the form ψ（x）∑α∈Z α（α）ψ（Mx-α）,x∈R, where the vector of functions ψ = （ψ1,..., ψr）^T is in （Lp（R^n））^r, 0 〈 p≤∞, α（α）, α ∈ Z^n, is a finitely supported sequence of r × r matrices called the refinement mask, and M is an s × s integer matrix such that limn→∞M^-n=0, In this article, we characterize the existence of an Lp=solution of the refinement equation for 0〈 p ≤∞, Our characterizations are based on the p-norm joint spectral radius.     

Vector subdivision schemes in (Lp(Rs))r(1 ≤ p ≤∞) spaces

The purpose of this paper is to investigate the refinement equations of the form ψ(x) = ∑α∈Zs a(α)ψ(Mx - α), x ∈ Rs,where the vector of functions ψ=(ψ1,…,ψr)T is in (Lp(Rs))r, 1≤p≤∞,a(α),α∈Zs,is a finitely supported sequence of r × r matrices called the refinement mask, and M is an s × s integer matrix suchthat lim n→∞ M-n = 0. In order to solve the refinement equation mentioned above, we start with a vectorof compactly supported functions ψ0 ∈ (Lp(Rs))r and use the iteration schemes fn := Qnaψ0,n = 1,2,…,where Qa is the linear operator defined on (Lp(Rs))r given by Qaψ:= ∑α∈Zs a(α)ψ(M·- α),ψ∈ (Lp(Rs))r. This iteration scheme is called a subdivision scheme or cascade algorithm. In this paper, we characterize the Lp-convergence of subdivision schemes in terms of the p-norm joint spectral radius of a finite collection of somelinear operators determined by the sequence a and the set B restricted to a certain invariant subspace, wherethe set B is a complete set of representatives of the distinct cosets of the quotient group Zs/MZs containing 0.     

保Taylor联合谱的线性映射

设L(H),Lncom(H)分别是HilbertH上有界算子及n个两两交换的算子组的集合.设T∈Lncom(H),sp(T)表示Taylor联合谱,φi(i=1,2,…,n)是L(H)上满的线性映射且满足φi(Tl)φj(Tk)=φj(Tk)φi(Tl)当且仅当TlTk=TkTl,i,j=1,2,…,n.设T=(T1,T2,…,Tn)∈Lncom(H),φ=(φ1,φ2,…,φn),φ(T)=(φ1(T1),φ2(T2),…,φn(Tn)).文章证明了如果dimH<∞,对任意T=(T1,T2,…Tn)∈Lncom(H),sp(φ(T))=sp(T),则φi=φj,i,j=1,2,…,n.如果dimH=∞,T=(T1,T2,…Tn)∈Lncom(H),sp(φ(T))=sp(T),则φ是自同构或反自同构.     

关于广义Thue－Mahler方程的解数

设ａ，ｂ是非零整数，ｐ１，…，ｐｒ是不同的素数，Ｐ＝｛±｜ｍ１，…，ｍｒ是非负整数｝．设Ｋ是ｎ（ｎ≥３）次代数数域，α１，…，αｍ∈ｋ（１＜ｍ＜ｎ），△（α１，…，αｍ）是α１，…，αｍ的判别式，ｆ（ｘ１，…，ｘｍ）＝αＮｋ／Ｑ（α１ｘ１＋…＋αｍｘｍ）∈ｚ［ｘ１，…，ｘｍ］．本文证明了：当ｆ（ｘ１，…，ｘｍ）非退化且Ｐｉ△（α１，…，αｍ）（ｉ＝１，…，ｒ）时，方程ｆ（ｘ１，…，ｘｍ）＝ｂｙ，ｘ１，…，ｘｍ∈ｚ，ｇｃｄ（ｘ１，…，ｘｍ）＝１，ｙ∈Ｐ至多有（４Ｓｄ２）（Ｓｄ）组解（ｘ１，…，ｘｍ，ｙ），其中ｄ＝ｎ！，Ｓ＝ｒ＋ω是ｂ的不同素因数的个数，ｈＡ是Ｋ的类数．     

Banach空间非扩张映像不动点强收敛定理

设E是具弱序列连续对偶映像自反Banach空间, C是E中闭凸集, T:C→ C是具非空不动点集F(T)的非扩张映像.给定u∈ C,对任意初值x0∈ C,实数列{αn}n∞=0,{βn}∞n=0∈ (0,1),满足如下条件:(i)sum from n=α to ∞α_n=∞, α_n→0;(ii)β_n∈[0,α) for some α∈(0,1);(iii)sun for n=α to ∞|α_(n-1) α_n|<∞,sum from n=α|β_(n-1)-β_n|<∞设{x_n}_(n_1)~∞是由下式定义的迭代序列:{y_n=β_nx_n (1-β_n)Tx_n x_(n 1)=α_nu (1-α_n)y_n Then {x_n}_(n=1)~∞则{x_n}_(n=1)~∞强收敛于T的某不动点.     

On approximation of smooth functions from null spaces of optimal linear differential operators with constant coefficients

For a real valued function f defined on a finite interval I we consider the problem of approximating f from null spaces of differential operators of the form Ln(ψ) = n ∑ k=0 akψ(k), where the constant coefficients ak ∈ R may be adapted to f . We prove that for each f ∈ C(n)(I), there is a selection of coefficients {a1, ,an} and a corresponding linear combination Sn( f ,t) = n ∑ k=1 bkeλkt of functions ψk(t) = eλkt in the nullity of L which satisfies the following Jackson’s type inequality: f (m) Sn(m )( f ,t) ∞≤ |an|2n|Im|1/1q/ep|λ|λn|n|I||nm1 Ln( f ) p, where |λn| = mka x|λk|, 0 ≤ m ≤ n 1, p,q ≥ 1, and 1p + q1 = 1. For the particular operator Mn(f) = f + 1/(2n) f(2n) the rate of approximation by the eigenvalues of Mn for non-periodic analytic functions on intervals of restricted length is established to be exponential. Applications in algorithms and numerical examples are discussed.     

The Bergman kernel function of some Reinhardt domains (Ⅱ)

The boundary behavior of the Bergman kernel function of a kind of Reinhardt domain is studied. Upper and lower bounds for the Bergman kernel function are found at the diagonal points (Z,(Z-)). Let Ω be the Reinhardt domainm(X) where αj>0,j=1,2,…,n,N=N1+N2+…+Nn,‖Zj‖ is the standard Euclidean norm in CNj,j=1,2,…,n; and let K(Z,(W-)) be the Bergman kernel function of Ω. Then there exist two positive constants m and M,and a function F such that mF(Z,(Z-))≤K(Z,(Z-))≤MF(Z,(Z-))holds for every Z∈Ω. Here (X) and r(Z)=‖Z‖α-1 is the defining function of Ω. The constants m and M depend only on α=(α1,…,αn) and N1,N2,…,Nn,not on Z. This result extends some previous known results.     

格子点上随机场的回归系数的估计问题

<正> §1.引言U.Grenander 研究了随机叙列的回归系数的估计问题,最近 M.Rosenblatt 研究了随机向量叙列的回归系数的估计问题.我们这桌案里研究格子点上随机场的回归系数的估计问题.前二作者所采用的方法是一样的,但是对于随机场而言若采用同一方法则有     

广义分数次积分多线性交换子的端点估计

设函数b=（b1,b2,…,bm）和广义分数次积分L-a／2（0〈α〈n）,它们生成多线性算子定义如下 Lb -a/2 f = [bm …, [b2[b1, L-a/2]],…, ]f,其中m ∈ Z＋ , bi ∈ Lipβi （0 〈βi 〈 1）,其中（1≤i≤m）．将讨论Lb -1a/2。从Mp^q（Rn）到Lip（α＋β-n/ q） （ Rn ）和q^q （ Rn ）到BMO（Rn）的有界性．     

Hammerstein型非线性积分方程正解的个数

<正> 本文是作者工作[8]、[9]的继续.在[9]中作者利用Leray-Schauder拓扑度理论研究了多项式型Hammerstein非线性积分方程的固有值,即设