首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
We prove C1,α-regularity for local minimizers of functionals
  相似文献   

4.
An ideal J of subsets of a Polish space X has (LK) property whenever for every sequence (An) of analytic sets in X, if lim supnHAnJ for each infinite H then ?nGJ for some infinite G. In this note we present a new class of σ-ideals with (LK) property.  相似文献   

5.
6.
The present paper is concerned with the convergence problem of inexact Newton methods. Assuming that the nonlinear operator satisfies the γ-condition, a convergence criterion for inexact Newton methods is established which includes Smale's type convergence criterion. The concept of an approximate zero for inexact Newton methods is proposed in this paper and the criterion for judging an initial point being an approximate zero is established. Consequently, Smale's α-theory is generalized to inexact Newton methods. Furthermore, a numerical example is presented to illustrate the applicability of our main results.  相似文献   

7.
In this paper second order elliptic boundary value problems on bounded domains ΩRn with boundary conditions on ∂Ω depending nonlinearly on the spectral parameter are investigated in an operator theoretic framework. For a general class of locally meromorphic functions in the boundary condition a solution operator of the boundary value problem is constructed with the help of a linearization procedure. In the special case of rational Nevanlinna or Riesz-Herglotz functions on the boundary the solution operator is obtained in an explicit form in the product Hilbert space L2(Ω)⊕(L2m(∂Ω)), which is a natural generalization of known results on λ-linear elliptic boundary value problems and λ-rational boundary value problems for ordinary second order differential equations.  相似文献   

8.
9.
From the irreducible decompositions' point of view, the structure of the cyclic GLn(C)-module generated by the α-determinant degenerates when (1?k?n−1) (see [S. Matsumoto, M. Wakayama, Alpha-determinant cyclic modules of gln(C), J. Lie Theory 16 (2006) 393-405]). In this paper, we show that -determinant shares similar properties which the ordinary determinant possesses. From this fact, one can define a new (relative) invariant called a wreath determinant. Using (GLm,GLn)-duality in the sense of Howe, we obtain an expression of a wreath determinant by a certain linear combination of the corresponding ordinary minor determinants labeled by suitable rectangular shape tableaux. Also we study a wreath determinant analogue of the Vandermonde determinant, and then, investigate symmetric functions such as Schur functions in the framework of wreath determinants. Moreover, we examine coefficients which we call (n,k)-sign appeared at the linear expression of the wreath determinant in relation with a zonal spherical function of a Young subgroup of the symmetric group Snk.  相似文献   

10.
11.
We study one-dimensional holomorphic foliations on products of complex projective spaces and present results giving the number of singularities, counting multiplicities, of a generic foliation, a criterion for a foliation to be Riccati and a Poincaré type inequality, relating degrees of foliations to degrees of hypersurfaces which are invariant by them.  相似文献   

12.
In this paper we give a sufficient condition for function to be α-starlike function and some of its applications. We use the techniques of convolution and differential subordinations.  相似文献   

13.
For X a separable metric space define p(X) to be the smallest cardinality of a subset Z of X which is not a relative γ-set in X, i.e., there exists an ω-cover of X with no γ-subcover of Z. We give a characterization of p(ω2) and p(ωω) in terms of definable free filters on ω which is related to the pseudo-intersection number p. We show that for every uncountable standard analytic space X that either p(X)=p(ω2) or p(X)=p(ωω). We show that the following statements are each relatively consistent with ZFC: (a) p=p(ωω)<p(ω2) and (b) p<p(ωω)=p(ω2)  相似文献   

14.
The α-modulation spaces , α∈[0,1], form a family of spaces that include the Besov and modulation spaces as special cases. This paper is concerned with construction of Banach frames for α-modulation spaces in the multivariate setting. The frames constructed are unions of independent Riesz sequences based on tensor products of univariate brushlet functions, which simplifies the analysis of the full frame. We show that the multivariate α-modulation spaces can be completely characterized by the Banach frames constructed.  相似文献   

15.
The permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first show a more general identity involving α-permanents: for arbitrary complex numbers α and β, we show that the α-permanent of any matrix can be expressed as a linear combination of β-permanents of related matrices. Some other identities for the α-permanent of sums and products of matrices are shown, as well as a relationship between the α-permanent and general immanants. We conclude with some discussion and a conjecture for the computational complexity of the α-permanent, and provide some numerical illustrations.  相似文献   

16.
The subject of this paper is the rigorous derivation of a quasistatic evolution model for a linearly elastic–perfectly plastic thin plate. As the thickness of the plate tends to zero, we prove via Γ-convergence techniques that solutions to the three-dimensional quasistatic evolution problem of Prandtl–Reuss elastoplasticity converge to a quasistatic evolution of a suitable reduced model. In this limiting model the admissible displacements are of Kirchhoff–Love type and the stretching and bending components of the stress are coupled through a plastic flow rule. Some equivalent formulations of the limiting problem in rate form are derived, together with some two-dimensional characterizations for suitable choices of the data.  相似文献   

17.
The paper presents a formula for the γ-interior of a set under special conditions for , more general than those in the previous paper [Acta Math. Hungar. 80 (1998) 89-93]. There are also some applications.  相似文献   

18.
A simple augmented ?-constraint (SAUGMECON) method is put forward to generate all non-dominated solutions of multi-objective integer programming (MOIP) problems. The SAUGMECON method is a variant of the augmented ?-constraint (AUGMECON) method proposed in 2009 and improved in 2013 by Mavrotas et al. However, with the SAUGMECON method, all non-dominated solutions can be found much more efficiently thanks to our innovations to algorithm acceleration. These innovative acceleration mechanisms include: (1) an extension to the acceleration algorithm with early exit and (2) an addition of an acceleration algorithm with bouncing steps. The same numerical example in Lokman and Köksalan (2012) is used to illustrate workings of the method. Then comparisons of computational performance among the method proposed by  and , the method developed by Lokman and Köksalan (2012) and the SAUGMECON method are made by solving randomly generated general MOIP problem instances as well as special MOIP problem instances such as the MOKP and MOSP problem instances presented in Table 4 in Lokman and Köksalan (2012). The experimental results show that the SAUGMECON method performs the best among these methods. More importantly, the advantage of the SAUGMECON method over the method proposed by Lokman and Köksalan (2012) turns out to be increasingly more prominent as the number of objectives increases.  相似文献   

19.
In this paper, we mainly discuss the infinite loss of regularity and μ-loss for a σ-evolution type model with oscillating in time coefficients. On the one hand, an explicit counter-example has been constructed in the frequency space to show the precise infinite loss of regularity. On the other hand, due to the finite propagation speed property for σ∈(0,1], we construct the counter-example of a sequence of solutions in R by applying state of art techniques.  相似文献   

20.
Assigning multiple service facilities to demand points is important when demand points are required to withstand service facility failures. Such failures may result from a multitude of causes, ranging from technical difficulties to natural disasters. The α-neighbor p-center problem deals with locating p service facilities. Each demand point is assigned to its nearest α service facilities, thus it is able to withstand up to α − 1 service facility failures. The objective is to minimize the maximum distance between a demand point and its αth nearest service facility. We present two optimal algorithms for both the continuous and discrete α-neighbor p-center problem. We present experimental results comparing the performance of the two optimal algorithms for α = 2. We also present experimental results showing the performance of the relaxation algorithm for α = 1, 2, 3.  相似文献   

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

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