首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let H be an n × n matrix, and let the trace, the rank, the conjugate transpose, the Moore-Penrose inverse, and a g-inverse (or an inner inverse) of H be respectively denoted by trH, ρ(H), H1, H2, and H?. This note develops two results: (i) the class of idempotent g-inverse of an idempotent matrix, and (ii) if H is an n × n matrix and ρ(H) = trH, then tr(H2H2H1) ? ρ(H), and the equality holds iff H is idempotent. This result is compared with the previous result of Khatri (1983), and some consequences of (i) and (ii) are given.  相似文献   

2.
Let (Wt) = (W1t,W2t,…,Wdt), d ? 2, be a d-dimensional standard Brownian motion and let A(t) be a bounded measurable function from R+ into the space of d × d skew-symmetric matrices and x(t) such a function into Rd. A class of stochastic processes (LtA,x), a particular example of which is Levy's “stochastic area” Lt = 120?t (W1s,dW2s ? W2s,dW1s), is dealt with.The joint characteristic function of Wt and L1A,x is calculated and based on this result a formula for fundamental solutions for the hypoelliptic operators which generate the diffusions (Wt,LtA,x) is given.  相似文献   

3.
Given n×n complex matrices A, C, the C-numerical radius of A is the nonnegative quantity
rc(A)≡ma{|tr(CU1AU)|:U unitary}
. For C=diag(1,0,…,0) it reduces to the classical numerical radius r(A)= max{|x1Ax|:x1x=1}. We show that rc is a generalized matrix norm if and only if C is nonscalar and trC≠0. Next, we consider an arbitrary generalized matrix norm and characterize all constants v?0 for which vN is multiplicative. A technique to obtain such v is then applied to C-numerical radii with Hermitian C. In particular we find that vr is a matrix norm if and only if v?4.  相似文献   

4.
Let m and vt, 0 ? t ? 2π be measures on T = [0, 2π] with m smooth. Consider the direct integral H = ⊕L2(vt) dm(t) and the operator (L?)(t, λ) = e?iλ?(t, λ) ? 2e?iλtT ?(s, x) e(s, t) dvs(x) dm(s) on H, where e(s, t) = exp ∫stTdvλ(θ) dm(λ). Let μt be the measure defined by T?(x) dμt(x) = ∫0tT ?(x) dvs dm(s) for all continuous ?, and let ?t(z) = exp[?∫ (e + z)(e ? z)?1t(gq)]. Call {vt} regular iff for all t, ¦?t(e)¦ = ¦?(e for 1 a.e.  相似文献   

5.
Let the n × n complex matrix A have complex eigenvalues λ12,…λn. Upper and lower bounds for Σ(Reλi)2 are obtained, extending similar bounds for Σ|λi|2 obtained by Eberlein (1965), Henrici (1962), and Kress, de Vries, and Wegmann (1974). These bounds involve the traces of A1A, B2, C2, and D2, where B=12 (A + A1), C=12 (A ? A1) /i, and D = AA1 ? A1A, and strengthen some of the results in our earlier paper “Bounds for eigenvalues using traces” in Linear Algebra and Appl. [12].  相似文献   

6.
Let A be a real or complex n × n interval matrix. Then it is shown that the Neumann series Σk=0Ak is convergent iff the sequence {Ak} converges to the null matrix O, i.e., iff the spectral radius of the real comparison matrix B constructed in [2] is less than one.  相似文献   

7.
Let A be an n×n matrix with complex entries. A necessary and sufficient condition is established for the existence of a Hermitian solution H to the equations
AH+HA1=HA+A1H=I
.  相似文献   

8.
9.
The message m = {m(t)} is a Gaussian process that is to be transmitted through the white Gaussian channel with feedback: Y(t) = ∫0tF(s, Y0s, m)ds + W(t). Under the average power constraint, E[F2(s, Y0s, m)] ≤ P0, we construct causally the optimal coding, in the sense that the mutual information It(m, Y) between the message m and the channel output Y (up to t) is maximized. The optimal coding is presented by Y(t) = ∫0t A(s)[m(s) ? m?(s)] ds + W(t), where m?(s) = E[m(s) ¦ Y(u), 0 ≤ u ≤ s] and A(s) is a positive function such that A2(s) E |m(s) ? m?(s)|2 = P0.  相似文献   

10.
Let x?Sn, the symmetric group on n symbols. Let θ? Aut(Sn) and let the automorphim order of x with respect to θ be defined by
γθ(x)=min{k:x xθ xθ2 ? xθk?1=1}
where is the image of x under θ. Let αg? Aut(Sn) denote conjugation by the element g?Sn. Let b(g; s, k : n) ≡ ∥{x ? Sn : kγαg(x)sk}∥ where s and k are positive integers and ab denotes a divides b. Further h(s, k : n) ≡ b(1; s, k : n), where 1 denotes the identity automorphim. If g?Sn let c = f(g, s) denote the number of symbols in g which are in cycles of length not dividing the integer s, and let gs denote the product of all cycles in g whose lengths do not divide s. Then gs moves c symbols. The main results proved are: (1) recursion: if n ? c + 1 and t = n ? c ? 1 then b(g; s, 1:n)=∑is b(g; s, 1:n?1)(ti?1(i?1)! (2) reduction: b(g; s, 1 : c)h(s, 1 : i) = b(g; s, 1 : i + c); (3) distribution: let D(θ, n) ≡ {(k, b) : k?Z+ and b = b(θ; 1, k : n) ≠ 0}; then D(θ, m) = D(φ, m) ∨ m ? N = N(θ, φ) iff θ is conjugate to φ; (4) evaluation: the number of cycles in gss of any given length is smaller than the smallest prime dividing s iff b(gs; s, 1 : c) = 1. If g = (12 … pm)t and skpm then b(g;s,k:pm) {0±1(mod p).  相似文献   

11.
Asymptotic results are obtained for pA(k)(n), the kth difference of the function pA(n) which is the number of partitions of n into integers from A. Under certain restrictions on A it is shown that
PA(k+1)(n)PA(k)(n) = O(n?1/2) (n→ ∫)
thereby verifying for these A a conjecture of Bateman and Erdös.  相似文献   

12.
The determinants of solutions X to any of the 2×2 matrix equations: (1) XAX>?1=At, t denoting transpose; (2) A=XY, X, Y symmetric; (3) X=AB?BA; and (4) XAX?1=A1, the matrix of cofactors of A transposed, are characterized over a commutative ring R as the negative of norms from the quadratic extension R[A] whenever certain elements in the Picard group Pic (R[A]) are trivial. This characterization is realized by the utilization of galois cohomology and a generalized Latimer–MacDuffee correspondence between similarity classes and the elements in Pic (R[A]). The results represent a ramification of several articles by O. Taussky on the specializations of equations (1)–(3) to either the field of rational numbers or the ring of rational integers.  相似文献   

13.
Given a cocycle a(t) of a unitary group {U1}, ?∞ < t < ∞, on a Hilbert space H, such that a(t) is of bounded variation on [O, T] for every T > O, a(t) is decomposed as a(t) = f;t0Usxds + β(t) for a unique x ? H, β(t) yielding a vector measure singular with respect to Lebesgue measure. The variance is defined as σ2({rmUt}, a(t)) = limT→∞(1T)∥∝t0 Us x ds∥2 if existing. For a stationary diffusion process on R1, with Ω1, the space of paths which are natural extensions backwards in time, of paths confined to one nonsingular interval J of positive recurrent type, an information function I(ω) is defined on Ω1, based on the paths restricted to the time interval [0, 1]. It is shown that I(Ω) is continuous and bounded on Ω1. The shift τt, defines a unitary representation {Ut}. Assuming Ω1 I dm = 0, dm being the stationary measure defined by the transition probabilities and the invariant measure on J, I(Ω) has a C spectral density function f;. It is then shown that σ2({Ut}, I) = f;(O).  相似文献   

14.
On Rn, n?1 and n≠2, we prove the existence of a sharp constant for Sobolev inequalities with higher fractional derivatives. Let s be a positive real number. For n>2s and q=2nn?2s any function f∈Hs(Rn) satisfies
6f62q?Sn,s(?Δ)s/2f22,
where the operator (?Δ)s in Fourier spaces is defined by (?Δ)sf(k):=(2π|k|)2sf(k). To cite this article: A. Cotsiolis, N.C. Tavoularis, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 801–804.  相似文献   

15.
Let An(ω) be the nxn matrix An(ω)=(aij with aijij, 0?i,j?n?1, ωn=1. For n=rs we show
An(w)PsrPrs0s?1Ar(ws)Psr{Trs(w)}0r?1As(wr)
=(Ar?Is)Tsr(Ir?As). When r and s are relatively prime this identity implies a wide class of identities of the form PAn(ω)QT=Ar(ωαs)?As(ωβr). The matrices Psr, Prs, P, and Q are permutation matrices corresponding to the “data shuffling” required in a computer implementation of the FFT, and Tsr is a diagonal matrix whose nonzeros are called “twiddle factors.” We establish these identities and discuss their algorithmic significance.  相似文献   

16.
We obtain, for a large class of measures μ, general inequalities of the form ∫Rn|u|p A(log1|u|) dμ ? K(6u : Wm,p(Rn,dμ)6p + 6 u 6p A(log1 6 u 6)), where 6u6 = 6 u: Lp(Rn,dμ)6p, log1 t = max{1, log t}, and the function A depends in an appropriate way on μ. Our results extend similar results obtained by Rosen for the case p = 2, A(t) = ts. We also investigate some implications of these inequalities for the imbedding of Sobolev spaces into Orlicz spaces.  相似文献   

17.
Let fk(n) denote the maximum of k-subsets of an n-set satisfying the condition in the title. It is proven that f2t ? 1(n) ? f2t(n + 1) ? (tn)(t2t?1) with equalities holding iff there exists a Steiner-system S(t, 2t ? 1, n). The bounds are approximately best possile for k ? 6 and of correct order of magnitude for k >/ 7, as well, even if the corresponding Steiner-systems do not exist.Exponential lower and upper bounds are obtained for the case if we do not put size restrictions on the members of the family (i.e., the nonuniform case).  相似文献   

18.
Let Ω be a simply connected domain in the complex plane, and A(Ωn), the space of functions which are defined and analytic on Ωn, if K is the operator on elements u(t, a1, …, an) of A(Ωn + 1) defined in terms of the kernels ki(t, s, a1, …, an) in A(Ωn + 2) by Ku = ∑i = 1naitk i(t, s, a1, …, an) u(s, a1, …, an) ds ? A(Ωn + 1) and I is the identity operator on A(Ωn + 1), then the operator I ? K may be factored in the form (I ? K)(M ? W) = (I ? ΠK)(M ? ΠW). Here, W is an operator on A(Ωn + 1) defined in terms of a kernel w(t, s, a1, …, an) in A(Ωn + 2) by Wu = ∝antw(t, s, a1, …, an) u(s, a1, …, an) ds. ΠW is the operator; ΠWu = ∝an ? 1w(t, s, a1, …, an) u(s, a1, …, an) ds. ΠK is the operator; ΠKu = ∑i = 1n ? 1aitki(t, s, a1, …, an) ds + ∝an ? 1tkn(t, s, a1, …, an) u(s, a1, …, an) ds. The operator M is of the form m(t, a1, …, an)I, where m ? A(Ωn + 1) and maps elements of A(Ωn + 1) into itself by multiplication. The function m is uniquely derived from K in the following manner. The operator K defines an operator K1 on functions u in A(Ωn + 2), by K1u = ∑i = 1n ? 1ait ki(t, s, a1, …, an) u(s, a, …, an + 1) ds + ∝an + 1t kn(t, s, a1, …, an) u((s, a1, …, an + 1) ds. A determinant δ(I ? K1) of the operator I ? K1 is defined as an element m1(t, a1, …, an + 1) of A(Ωn + 2). This is mapped into A(Ωn + 1) by setting an + 1 = t to give m(t, a1, …, an). The operator I ? ΠK may be factored in similar fashion, giving rise to a chain factorization of I ? K. In some cases all the matrix kernels ki defining K are separable in the sense that ki(t, s, a1, …, an) = Pi(t, a1, …, an) Qi(s, a1, …, an), where Pi is a 1 × pi matrix and Qi is a pi × 1 matrix, each with elements in A(Ωn + 1), explicit formulas are given for the kernels of the factors W. The various results are stated in a form allowing immediate extension to the vector-matrix case.  相似文献   

19.
Let a complex pxn matrix A be partitioned as A′=(A1,A2,…,Ak). Denote by ?(A), A′, and A? respectively the rank of A, the transpose of A, and an inner inverse (or a g-inverse) of A. Let A(14) be an inner inverse of A such that A(14)A is a Hermitian matrix. Let B=(A(14)1,A(14)2,…,Ak(14)) and ρ(A)=i=1kρ(Ai).Then the product of nonzero eigenvalues of BA (or AB) cannot exceed one, and the product of nonzero eigenvalues of BA is equal to one if and only if either B=A(14) or Ai>Aj1=0 for all ij,i, j=1,2,…,k . The results of Lavoie (1980) and Styan (1981) are obtained as particular cases. A result is obtained for k=2 when the condition ρ(A)=i=1kρ(Ai) is no longer true.  相似文献   

20.
Some quadratic identities associated with positive definite Hermitian matrices are derived by use of the theory of reproducing kernels. For example, the following identity is obtained: Let{Aj}mj=1 be N × N positive definite Hermitian matrices. Then, for any complex vector x ∈ CN, we have the identity
x1j=1m A-1j-1x = minj=1mx1jAjxj
. The minimum is taken here over all the decompositions x =∑mj=1xj. This identity gives, in a sense, a precise converse for an inequality which was derived by T. Ando. Moreover, this paper shows that the sum of two reproducing kernels is naturally related to the harmonic-arithmetic-mean inequality for matrices and also that the geometric-arithmetic-mean inequality for matrices can be naturally interpreted in terms of tensor-product spaces.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号