首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, the problem of phase reconstruction from magnitude of multidimensional band-limited functions is considered. It is shown that any irreducible band-limited function f(z1…,zn), zi ? C, i=1, …, n, is uniquely determined from the magnitude of f(x1…,xn): | f(x1…,xn)|, xi ? R, i=1,…, n, except for (1) linear shifts: i(α1z1+…+αn2n+β), β, αi?R, i=1,…, n; and (2) conjugation: f1(z11,…,zn1).  相似文献   

2.
This paper presents a demonstrably convergent method of feasible directions for solving the problem min{φ(ξ)| gi(ξ)?0i=1,2,…,m}, which approximates, adaptively, both φ(x) and ▽φ(x). These approximations are necessitated by the fact that in certain problems, such as when φ(x) = max{f(x, y) ¦ y ? Ωy}, a precise evaluation of φ(x) and ▽φ(x) is extremely costly. The adaptive procedure progressively refines the precision of the approximations as an optimum is approached and as a result should be much more efficient than fixed precision algorithms.It is outlined how this new algorithm can be used for solving problems of the form miny ? Ωxmaxy ? Ωyf(x, y) under the assumption that Ωmξ={x|gi(x)?0, j=1,…,s} ∩Rn, Ωy={y|ζi(y)?0, i-1,…,t} ∩ Rm, with f, gj, ζi continuously differentiable, f(x, ·) concave, ζi convex for i = 1,…, t, and Ωx, Ωy compact.  相似文献   

3.
Davio and Deschamps have shown that the solution set, K, of a consistent Boolean equation ?(x1, …, xn)=0 over a finite Boolean algebra B may be expressed as the union of a collection of subsets of Bn, each of the form {(x1, …, xn) | aixibi, ai?B, bi?B, i = 1, …, n}. We refer to such subsets of Bn as segments and to the collection as a segmental cover of K. We show that ?(x1, …, xn) = 1 is consistent if and only if ? can be expressed by one of a class of sum-of-products expressions which we call segmental formulas. The object of this paper is to relate segmental covers of K to segmental formulas for ?.  相似文献   

4.
This paper presents sufficient conditions for the existence of a nonnegative and stable equilibrium point of a dynamical system of Volterra type, (1) (ddt) xi(t) = ?xi(t)[fi(x1(t),…, xn(t)) ? qi], i = 1,…, n, for every q = (q1,…, qn)T?Rn. Results of a nonlinear complementarity problem are applied to obtain the conditions. System (1) has a nonnegative and stable equilibrium point if (i) f(x) = (f1(x),…,fn(x))T is a continuous and differentiable M-function and it satisfies a certain surjectivity property, or (ii), f(x) is continuous and strongly monotone on R+0n.  相似文献   

5.
Solutions of Cauchy problems for the singular equations utt + (Ψ(t)t) ut = Mu (in a Hilbert space setting) and ut + Δu + mi=1 ((kixi)(?i?i)) + g(t)u=0 in ω × |0,T), ω={(x1,…,xMRm: 0 < xi < ci for each i=1,…,m} are shown to be unique and to depend Hölder continuously on the initial data in suitably chosen measures for 0?t < T < ∞. Logarithmic convexity arguments are used to derive the inequalities from which such results can be deduced.  相似文献   

6.
Let (A, G, α) be a C1-dynamical system, where G is abelian, and let φ be an invariant state. Suppose that there is a neighbourhood Ω of the identity in G? and a finite constant κ such that Πi = 1n φ(xi1xi) ? κ Πi = 1n φ(xixi1) whenever xi lies in a spectral subspace Rαi), where Ω1 + … + Ωn ? Ω. This condition of complete spectral passivity, together with self-adjointness of the left kernel of φ, ensures that φ satisfies the KMS condition for some one-parameter subgroup of G.  相似文献   

7.
Let A be an n-square normal matrix over C, and Qm, n be the set of strictly increasing integer sequences of length m chosen from 1,…, n. For α,βQm, n denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k∈{0,1,…,m} write z.sfnc;αβ|=k if there exists a rearrangement of 1,…,m, say i1,…,ik, ik+1,…,im, such that α(ij)=β(ij), j=1,…,k, and {α(ik+1),…,α(im)};∩{β(ik+1),…,β(im)}=ø. Let
be the group of n-square unitary matrices. Define the nonnegative number
?k(A)= maxU∈|det(U1AU) [α|β]|
, where |αβ|=k. Theorem 1 establishes a bound for ?k(A), 0?k<m?1, in terms of a classical variational inequality due to Fermat. Let A be positive semidefinite Hermitian, n?2m. Theorem 2 leads to an interlacing inequality which, in the case n=4, m=2, resolves in the affirmative the conjecture that
?m(A)??m?1(A)????0(A)
.  相似文献   

8.
9.
A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, Im(x, y) denotes
χyχv2?χv2i=1mF(νi)dν12?dνm
, and Am(x, y) denotes an approximation of Im(x, y) of the form
(y?x)mk=1naki=1mF(χik)
, where ak and yik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and xik = x + (y ? x)yik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F(1) exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, (b ? a)n = h < 1, xi = a + hi for i = 0, 1,…, n and 0 < r ? s ? n, then
χr?χs(I+F dχ)?i=rsI+j=1pIji?1i)
=hpH(χr?1s)+O(hp+1)
Further, if F(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when Aj is substituted for Ij.  相似文献   

10.
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.  相似文献   

11.
The multiparameter eigenvalue problem Wm(λ) xm = xm, Wm(λ) = Tm + n = 1k λnVmn, m = 1,…, k, where /gl /gE Ck, xm is a nonzero element of the separable Hilbert space Hm, and Tm and Vmn are compact symmetric is studied. Various properties, including existence and uniqueness, of λ = λi ? Ck for which the imth greatest eigenvalue of Wm(λi) equals one are proved. “Right definiteness” is assumed, which means positivity of the determinant with (m, n)th entry (ym, Vmnym) for all nonzero ym?Hm, m = 1 … k. This gives a “Klein oscillation theorem” for systems of an o.d.e. satisfying a definiteness condition that is usefully weaker than in previous such results. An expansion theorem in terms of the corresponding eigenvectors xmi is also given, thereby connecting the abstract oscillation theory with a result of Atkinson.  相似文献   

12.
The probability generating function (pgf) of an n-variate negative binomial distribution is defined to be [β(s1,…,sn)]?k where β is a polynomial of degree n being linear in each si and k > 0. This definition gives rise to two characterizations of negative binomial distributions. An n-variate linear exponential distribution with the probability function h(x1,…,xn)exp(Σi=1n θixi)f(θ1,…,θn) is negative binomial if and only if its univariate marginals are negative binomial. Let St, t = 1,…, m, be subsets of {s1,…, sn} with empty ∩t=1mSt. Then an n-variate pgf is of a negative binomial if and only if for all s in St being fixed the function is of the form of the pgf of a negative binomial in other s's and this is true for all t.  相似文献   

13.
By a result of L. Lovász, the determination of the spectrum of any graph with transitive automorphism group easily reduces to that of some Cayley graph.We derive an expression for the spectrum of the Cayley graph X(G,H) in terms of irreducible characters of the group G:
λti,1+…+λti,ni=g1,…,gt∈HXiΠs=1tgs
for any natural number t, where ξi is an irreducible character (over C), of degree ni , and λi,1 ,…, λi,ni are eigenvalues of X(G, H), each one ni times. (σni2 = n = | G | is the total'number of eigenvalues.) Using this formula for t = 1,…, ni one can obtain a polynomial of degree ni whose roots are λi,1,…,λi,ni. The results are formulated for directed graphs with colored edges. We apply the results to dihedral groups and prove the existence of k nonisomorphic Cayley graphs of Dp with the same spectrum provided p > 64k, prime.  相似文献   

14.
Given the iterative scheme xi+1 = BTxi + r where B, T are fixed n×:n real matrices, r a fixed real n-vector and xi a real n-vector we investigate the convergence and monotonicity of schemes of the type
vi+1wi+1 = BOOBS11?S12?S21S22viwi + rr
, where Sij are n×:n real matrices related to T. The n-vector iterates vi,wi bracket in a certain sense solutions x of x = BTx + r. We also give necessary and sufficient conditions for the monotonicity of the original iterative scheme itself xi+1 = BTxi + r. This leads to monotonici results for classical iterative schemes such as the Jacobi, Gauss-Seidel, and successive overrelaxation methods.  相似文献   

15.
Let X = {x1, x2,…} be a finite set and associate to every xi a real number αi. Let f(n) [g (n)] be the least value such that given any family F of subsets of X having maximum degree n [cardinality n], one can find integers αi, i=1,2,… so that αi ? αi|<1 and
xi ? Eai?xi ? Eαi≤?(n) xi ? Eai? xi ? Eαig(n)
for all E ? F. We prove
f(n)≤n ? 1 and g(n)≤c(n log n)12
.  相似文献   

16.
For 1 ? p ? ∞, let
|A|p = Σi=1mΣj=1n, |αij|p1p
, be the lp norm of an m × n complex A = (αij) ?Cm × n. The main purpose of this paper is to find, for any p, q ? 1, the best (smallest) possible constants τ(m, k, n, p, q) and σ(m, k, n, p, q) for which inequalities of the form
|AB|p ? τ(m, k, n, p, q) |A|p|B|q, |AB|p ? σ (m, k, n, p, q)|A|q|B|p
hold for all A?Cm × k, B?Ck × n. This leads to upper bounds for inner products on Ck and for ordinary lp operator norms on Cm × n.  相似文献   

17.
The following is proved (in a slightly more general setting): Let α1, …, αm be positive real, γ1, …, γm real, and suppose that the system [i + γi], i = 1, …, m, n = 1, 2, …, contains every positive integer exactly once (= a complementing system). Then αiαj is an integer for some ij in each of the following cases: (i) m = 3 and m = 4; (ii) m = 5 if all αi but one are integers; (iii) m ? 5, two of the αi are integers, at least one of them prime; (iv) m ? 5 and αn ? 2n for n = 1, 2, …, m ? 4.For proving (iv), a method of reduction is developed which, given a complementing system of m sequences, leads under certain conditions to a derived complementing system of m ? 1 sequences.  相似文献   

18.
Let Δ(α + β) = |Hλ2?r+1| where Hr is the complete symmetric function in (α1 + β1), (α2 + β2), …, (αn + βn). It is proved that Δ(α + β) ? Δ(α) + Δ(β). This inequality is generalised for certain symmetric functions defined by Littlewood. Let Ω(α + β) = |Qλ2?r+1staggered(α + β) (t, k1, k2, …, km)|. Then we prove that Ω(α + β) ? Ω(α) + Ω(β). Here λ1, λ2, λ3, …, λn is a partition such that λn > λn?1 > ··· > λ2 > λ1.  相似文献   

19.
Let V denote a finite dimensional vector space over a field K of characteristic 0, let Tn(V) denote the vector space whose elements are the K-valued n-linear functions on V, and let Sn(V) denote the subspace of Tn(V) whose members are the fully symmetric members of Tn(V). If Ln denotes the symmetric group on {1,2,…,n} then we define the projection PL : Tn(V) → Sn(V) by the formula (n!)?1Σσ ? Ln Pσ, where Pσ : Tn(V) → Tn(V) is defined so that Pσ(A)(y1,y2,…,yn = A(yσ(1),yσ(2),…,yσ(n)) for each A?Tn(V) and yi?V, 1 ? i ? n. If xi ? V1, 1 ? i ? n, then x1?x2? … ?xn denotes the member of Tn(V) such that (x1?x2· ? ? ?xn)(y1,y2,…,yn) = Пni=1xi(yi) for each y1 ,2,…,yn in V, and x1·x2xn denotes PL(x1?x2? … ?xn). If B? Sn(V) and there exists x i ? V1, 1 ? i ? n, such that B = x1·x2xn, then B is said to be decomposable. We present two sets of necessary and sufficient conditions for a member B of Sn(V) to be decomposable. One of these sets is valid for an arbitrary field of characteristic zero, while the other requires that K = R or C.  相似文献   

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

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