首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Summary. We generalize earlier results concerning an asymptotic error expansion of wavelet approximations. The properties of the monowavelets, which are the building blocks for the error expansion, are studied in more detail, and connections between spline wavelets and Euler and Bernoulli polynomials are pointed out. The expansion is used to compare the error for different wavelet families. We prove that the leading terms of the expansion only depend on the multiresolution subspaces and not on how the complementary subspaces are chosen. Consequently, for a fixed set of subspaces , the leading terms do not depend on the fact whether the wavelets are orthogonal or not. We also show that Daubechies' orthogonal wavelets need, in general, one level more than spline wavelets to obtain an approximation with a prescribed accuracy. These results are illustrated with numerical examples. Received May 3, 1993 / Revised version received January 31, 1994  相似文献   

3.
4.
Summary. We give the asymptotic formula for the error in cardinal interpolation. We generalize the Mazur Orlicz Theorem for periodic function. Received February 22, 1999 / Revised version received October 15, 1999 / Published online March 20, 2001  相似文献   

5.
0 ,G1,G2,... of supergraphs of G such that Gi is a subgraph of Gj for any i<j and Gi is an optimal (l+i)-edge-connected augmentation of G for any i≥0. In this paper we will show that the augmentation algorithm of A. Frank [3] can also be used to solve the corresponding Successive Edge-Augmentation Problem and implies (a stronger version of) the Successive Augmentation Property, even for some non-uniform demands. In addition we show the – previously unknown – Successive Augmentation Property for directed edge-connectivity (in the case of uniform demands). For several possible extensions and for the two vertex-connectivity versions counter-examples are given. Received March 1995 / Revised version received February 1997 Published online March 16, 1999  相似文献   

6.
In the author's joint paper [HJS] with Jost and Struwe, we discuss asymtotic limits of a self-dual Ginzburg–Landau functional involving a section of a line bundle over a closed Riemann surface and a connection on this bundle. In this paper, the author generalizes the above results [HJS] to the case of bounded domains. Received: 20 June 1997  相似文献   

7.
We consider the family of fibres of a polynomial function f on a smooth noncompact algebraic real surface and we characterise the regular fibres of f which are atypical due to their asymptotic behaviour at infinity. We compare to the similar problem in the complex case. Received: 5 May 1998 / Revised version: 20 March 1999  相似文献   

8.
(i) every 2-connected graph on n vertices can be made 4-connected by adding at most n new edges, and (ii) every 3-connected and 3-regular graph on n≥8 vertices can be made 4-connected by adding n/2 new edges. Received October 1995 / Revised version received March 1997 Published online March 16, 1999  相似文献   

9.
10.
Summary. This paper is concerned with the convergence of product quadrature formulas of interpolatory type based on the zeros of Jacobi polynomials for the approximation of integrals of the type is supposed to be of the form not an integer, . The kernel can be a smooth one or it can contain an algebraic or a logarithmic singularity. Received January 20, 1995  相似文献   

11.
Global and local convergence properties of a primal-dual interior-point pure potential-reduction algorithm for linear programming problems is analyzed. This algorithm is a primal-dual variant of the Iri-Imai method and uses modified Newton search directions to minimize the Tanabe-Todd-Ye (TTY) potential function. A polynomial time complexity for the method is demonstrated. Furthermore, this method is shown to have a unique accumulation point even for degenerate problems and to have Q-quadratic convergence to this point by an appropriate choice of the step-sizes. This is, to the best of our knowledge, the first superlinear convergence result on degenerate linear programs for primal-dual interior-point algorithms that do not follow the central path. Received: February 12, 1998 / Accepted: March 3, 2000?Published online January 17, 2001  相似文献   

12.
 In this paper we investigate the action of a p-group G on its powerful normal subgroup N. We shall mainly be concerned to find conditions which guarantee that G acts uniserially on N. We shall also study what consequences uniserial action on N has on the structure of N. (Received 21 August 1998; in revised form 28 June 1999)  相似文献   

13.
In order to unify these approaches, here we describe a two-phase greedy algorithm working on a slight extension of lattice polyhedra. This framework includes the rooted node-connectivity augmentation problem, as well, and hence the resulting algorithm, when appropriately specialized, finds a minimum cost of new edges whose addition to a digraph increases its rooted connectivity by one. The only known algorithm for this problem used submodular flows. Actually, the specialized algorithm solves an extension of the rooted edge-connectivity and node-connectivity augmentation problem. Received December 1996 / Revised version received January 1998 Published online March 16, 1999  相似文献   

14.
In this paper we will characterize products of balls – especially the ball and the polydisc – in by properties of the isotropy group of a single point. It will be shown that such a characterization is possible in the class of Siegel domains of the second kind, a class that extends the class of bounded homogeneous domains, and that such a characterization is no longer possible in the class of bounded domains with noncompact automorphism groups. The main result is that a Siegel domain of the second kind is biholomorphically equivalent to a product of balls, iff there is a point such that the isotropy group of p contains a torus of dimension n. As an application it will be proved that the only domains biholomorphically equivalent to a Siegel domain of the second kind and to a Reinhardt domain are exactly the domains biholomorphically equivalent to a product of b alls. Received: 27 February 1998 / In final form: 6 August 1998  相似文献   

15.
In this paper we study the Cauchy problem for overdetermined systems of linear partial differential operators with constant coefficients in some spaces of ultradifferentiable functions of class (M p ). We show that evolution is equivalent to the validity of a Phragmén-Lindel?f principle for entire and plurisubharmonic functions on some irreducible affine algebraic varieties, and make applications in different situations. We find necessary and sufficient conditions for well posedness, and relate the hyperbolicity of a given system to that of its principal part. Received: January 19, 1999?Published online: May 10, 2001  相似文献   

16.
Summary. We study the asymptotic behaviour of disconnection and non-intersection exponents for planar Brownian motionwhen the number of considered paths tends to infinity. In particular, if η n (respectively ξ (n, p)) denotes the disconnection exponent for n paths (respectively the non-intersection exponent for n paths versus p paths), then we show that lim n →∞ η n /n = 1 2 and that for a > 0 and b > 0,lim n →∞ ξ ([na],[nb])/n = (√ a + √ b) 2 /2. Received: 28 February 1996 / In revised form: 3 September 1996  相似文献   

17.
Summary. Numerical methods are considered for generating polynomials orthogonal with respect to an inner product of Sobolev type, i.e., one that involves derivatives up to some given order, each having its own (positive) measure associated with it. The principal objective is to compute the coefficients in the increasing-order recurrence relation that these polynomials satisfy by virtue of them forming a sequence of monic polynomials with degrees increasing by 1 from one member to the next. As a by-product of this computation, one gains access to the zeros of these polynomials via eigenvalues of an upper Hessenberg matrix formed by the coefficients generated. Two methods are developed: One is based on the modified moments of the constitutive measures and generalizes what for ordinary orthogonal polynomials is known as "modified Chebyshev algorithm". The other - a generalization of "Stieltjes's procedure" - expresses the desired coefficients in terms of a Sobolev inner product involving the orthogonal polynomials in question, whereby the inner product is evaluated by numerical quadrature and the polynomials involved are computed by means of the recurrence relation already generated up to that point. The numerical characteristics of these methods are illustrated in the case of Sobolev orthogonal polynomials of old as well as new types. Based on extensive numerical experimentation, a number of conjectures are formulated with regard to the location and interlacing properties of the respective zeros. Received July 13, 1994 / Revised version received September 26, 1994  相似文献   

18.
 We find natural conditions under which all continuous linear operators between two scalar or vector-valued quasi-Banach sequence spaces are compact. In the case of scalar-valued Banach sequence spaces we show that all such operators essentially factorize through diagonal operators between suitable -spaces. (Received 21 June 1999; in revised form 27 September 1999)  相似文献   

19.
 The aim of this paper is to study the moduli space of solutions of the Dirichlet problem associated to the equation of Monge-Ampeère type, det , on an exterior planar domain. We prove that this moduli space is either empty or a differentiable manifold of dimension five. (Received 23 April 1999)  相似文献   

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

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