首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
We study the complexity of second-order indefinite elliptic problems −div(au) +bu=f(with homogeneous Dirichlet boundary conditions) over ad-dimensional domain Ω, the error being measured in theH1(Ω)-norm. The problem elementsfbelong to the unit ball ofWr, p, (Ω), wherep [2, ∞] andr>d/p. Information consists of (possibly adaptive) noisy evaluations off,a, orb(or their derivatives). The absolute error in each noisy evaluation is at most δ. We find that thenth minimal radius for this problem is proportional tonr/d+ δ and that a noisy finite element method with quadrature (FEMQ), which uses only function values, and not derivatives, is a minimal error algorithm. This noisy FEMQ can be efficiently implemented using multigrid techniques. Using these results, we find tight bounds on the -complexity (minimal cost of calculating an -approximation) for this problem, said bounds depending on the costc(δ) of calculating a δ-noisy information value. As an example, if the cost of a δ-noisy evaluation isc(δ) = δs(fors> 0), then the complexity is proportional to (1/)d/r + s.  相似文献   

2.
We study the complexity of Fredholm problems (ITk)u=f of the second kind on Id=[0,1]d, where Tk is an integral operator with kernel k. Previous work on the complexity of this problem has assumed either that we had complete information about k or that k and f had the same smoothness. In addition, most of this work has assumed that the information about k and f was exact. In this paper, we assume that k and f have different smoothness; more precisely, we assume that fWr,p(Id) with r>d/p and that kWs,∞(I2d) with s>0. In addition, we assume that our information about k and f is contaminated by noise. We find that the nth minimal error is Θ(n−μ+δ), where μ=min{r/d,s/(2d)} and δ is a bound on the noise. We prove that a noisy modified finite element method has nearly minimal error. This algorithm can be efficiently implemented using multigrid techniques. We thus find tight bounds on the -complexity for this problem. These bounds depend on the cost c(δ) of calculating a δ-noisy information value. As an example, if the cost of a δ-noisy evaluation is proportional to δt, then the -complexity is roughly (1/)t+1/μ.  相似文献   

3.
For linear multistep methods with constant stepsize we consider error bounds in terms of weightedL 2-norms ofh px(p) rather than ofh px(p+1). The bounds apply to stiff systemsx'=Ax+f(t,x) where the spectrum ofA lies in a sector andf is of moderate size.  相似文献   

4.
We study the Riesz potentials Iαf on the generalized Lebesgue spaces Lp(·)(?d), where 0 < α < d and Iαf(x) ? ∫equation/tex2gif-inf-3.gif |f(y)| |xy|αd dy. Under the assumptions that p locally satisfies |p(x) – p(x)| ≤ C/(– ln |xy|) and is constant outside some large ball, we prove that Iα : Lp(·)(?d) → Lp?(·)(?d), where . If p is given only on a bounded domain Ω with Lipschitz boundary we show how to extend p to on ?d such that there exists a bounded linear extension operator ? : W1,p(·)(Ω) ? (?d), while the bounds and the continuity condition of p are preserved. As an application of Riesz potentials we prove the optimal Sobolev embeddings Wk,p(·)(?d) ?Lp*(·)(Rd) with and W1,p(·)(Ω) ? Lp*(·)(Ω) for k = 1. We show compactness of the embeddings W1,p(·)(Ω) ? Lq(·)(Ω), whenever q(x) ≤ p*(x) – ε for some ε > 0. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

5.
Letf(P s d ) be the set of allf-vectors of simpliciald-polytopes. ForP a simplicial 2d-polytope let Σ(P) denote the boundary complex ofP. We show that for eachff(P s d ) there is a simpliciald-polytopeP withf(P)=f such that the 11 02 simplicial diameter of Σ(P) is no more thanf 0(P)−d+1 (one greater than the conjectured Hirsch bound) and thatP admits a subdivision into a simpliciald-ball with no new vertices that satisfies the Hirsch property. Further, we demonstrate that the number of bistellar operations required to obtain Σ(P) from the boundary of ad-simplex is minimum over the class of all simplicial polytopes with the samef-vector. This polytopeP will be the one constructed to prove the sufficiency of McMullen's conditions forf-vectors of simplicial polytopes.  相似文献   

6.
In this paper, we study the solvability of the Steklov problem Δpu=|u|p−2u in Ω, on Ω, under assumptions on the asymptotic behaviour of the quotients f(x,s)/|s|p−2s and pF(x,s)/|s|p which extends the classical results with Dirichlet boundary conditions that for a.e. xΩ, the limits at the infinity of these quotients lie between the first two eigenvalues.  相似文献   

7.
For every polynomial mapf=(f 1,…,f k): ℝ n →ℝ k , we consider the number of connected components of its zero set,B(Z f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off i), and thek-tuple (Δ1,...,Δ4), Δ k being the Newton polyhedron off i respectively. Our aim is to boundB(Z f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ d (n)=d(2d−1) n−1. Considered as a polynomial ind, μ d (n) has leading coefficient equal to 2 n−1. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n k−1 dn, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.  相似文献   

8.
A priori bounds for positive, very weak solutions of semilinear elliptic boundary value problems −Δu=f(x,u) on a bounded domain ΩRn with u=0 on ∂Ω are studied, where the nonlinearity 0?f(x,s) grows at most like sp. If Ω is a Lipschitz domain we exhibit two exponents p* and p*, which depend on the boundary behavior of the Green function and on the smallest interior opening angle of ∂Ω. We prove that for 1<p<p* all positive very weak solutions are a priori bounded in L. For p>p* we construct a nonlinearity f(x,s)=a(x)sp together with a positive very weak solution which does not belong to L. Finally we exhibit a class of domains for which p*=p*. For such domains we have found a true critical exponent for very weak solutions. In the case of smooth domains is an exponent which is well known from classical work of Brezis, Turner [H. Brezis, R.E.L. Turner, On a class of superlinear elliptic problems, Comm. Partial Differential Equations 2 (1977) 601-614] and from recent work of Quittner, Souplet [P. Quittner, Ph. Souplet, A priori estimates and existence for elliptic systems via bootstrap in weighted Lebesgue spaces, Arch. Ration. Mech. Anal. 174 (2004) 49-81].  相似文献   

9.
《Journal of Complexity》1996,12(1):58-79
LetBH(Ω) be the space of analytic functionsfin the region Ω for which |f(z)| ≤ 1,z∈ Ω, and letKbe a compact subset of Ω. How can we compute the values of any functionfBH(Ω) at an arbitrary pointzK? One of the approaches to this problem applies the results concerning then-widths and ϵ-entrophy of classBH(Ω) in the metricC(K). In the case whenKhas a simply connected complement inC and Ω is a canonical neighbourhood ofK, the classical tools for approximation offBH(Ω) inC(K) give the Faber series. This work is concerned with the following: the exact values of Kolmogorov and othern-widths of Hardy spacesHp, then-widths and ϵ-entrophy of classBH(Ω), the optimality of Faber approximations, and computing values of analytic functions with the help of Faber series.  相似文献   

10.
Letf be a non-decreasing C1-function such that andF(t)/f 2 a(t)→ 0 ast → ∞, whereF(t)=∫ 0 t f(s) ds anda ∈ (0, 2]. We prove the existence of positive large solutions to the equationΔu +q(x)|Δu| a =p(x)f(u) in a smooth bounded domain Ω ⊂RN, provided thatp, q are non-negative continuous functions so that any zero ofp is surrounded by a surface strictly included in Ω on whichp is positive. Under additional hypotheses onp we deduce the existence of solutions if Ω is unbounded.  相似文献   

11.
This article deals with a class of nonlocal and degenerate quasilinear parabolic equation u t = f(u)(Δu + aΩ u(x, t)dx ? u) with homogeneous Dirichlet boundary conditions. The local existence of positive classical solutions is proved by using the method of regularization. The global existence of positive solutions and blow-up criteria are also obtained. Furthermore, it is shown that, under certain conditions, the solutions have global blow-up property. When f(s) = s p , 0 < p ≤ 1, the blow-up rate estimates are also obtained.  相似文献   

12.
13.
In this paper we give a complete expansion formula for Bernstein polynomials defined on ans-dimensional simplex. This expansion for a smooth functionf represents the Bernstein polynomialB n (f) as a combination of derivatives off plus an error term of orderO(ns ).Communicated by Wolfgang Dahmen.  相似文献   

14.
Let Z denote the ring of integers and for a prime p and positive integers r and d, let fr(P, d) denote the smallest positive integer such that given any sequence of fr(p, d) elements in (Z/pZ(d, there exists a subsequence of (rp) elements whose sum is zero in (Z/pZ(d. That f1(p, 1) = 2p − 1, is a classical result due to Erdős, Ginzburg and Ziv. Whereas the determination of the exact value of f1(p, 2) has resisted the attacks of many well known mathematicians, we shall see that exact values of fr(p, 1) for r ≥ 1 can be easily obtained from the above mentioned theorem of Erdős, Ginzburg and Ziv and those of fr(p, 2) for r ≥ 2 can be established by the existing techniques developed by Alon, Dubiner and Rónyai in connection with obtaining good upper bounds for f1(p, 2). We shall also take this opportunity to describe some of the early results in the introduction.  相似文献   

15.
The problem considered is that of estimating the error of a class of quadrature formulae for –1 1 w r (x)f(x)dx, (w r (x) being a positive weight-function), where only values off(x) in (–1,1) and off(x) and its derivatives at the end-points of the interval are considered.  相似文献   

16.
The interpolation problem at uniform mesh points of a quadratic splines(x i)=f i,i=0, 1,...,N ands(x 0)=f0 is considered. It is known that s–f=O(h 3) and s–f=O(h 2), whereh is the step size, and that these orders cannot be improved. Contrary to recently published results we prove that superconvergence cannot occur for any particular point independent off other than mesh points wheres=f by assumption. Best error bounds for some compound formulae approximatingf i andf i (3) are also derived.  相似文献   

17.
Summary This investigation was originally motivated by the problem of determining the maximum number of points in finiten-dimensional projective spacePG(n, s) based on the Galois fieldGF(s) of orders=p h (wherep andh are positive integers andp is the prime characteristic of the field), such that not of these chosen points are linearly dependent. A set ofk distinct points inPG(n, s), not linearly dependent, is called a (k, t)-set fork 1 >k. The maximum value ofk is denoted bym t (n+1, s). The purpose of this paper is to find new upper bounds for some values ofn, s andt. These bounds are of importance in the experimental design and information theory problems.  相似文献   

18.
In this paper, we investigate the multiple and infinitely solvability of positive solutions for nonlinear fractional differential equation Du(t)=tνf(u), 0<t<1, where D=tβδDβγδ,δ, β>0, γ?0, 0<δ<1, ν>−β(γ+1). Our main work is to deal with limit case of f(s)/s as s→0 or s→∞ and Φ(s)/s, Ψ(s)/s as s→0 or s→∞, where Φ(s), Ψ(s) are functions connected with function f. In J. Math. Appl. 252 (2000) 804-812, we consider the existence of a positive solution for the particular case of Eq. (1.1), i.e., the Riemann-Liouville type (β=1, γ=0) nonlinear fractional differential equation, using the super-lower solutions method. Here, we devote to the existence of positive solution and multi-positive solutions for Eq. (1.1) by means of the fixed point theorems for the cone.  相似文献   

19.
LetR n(f; x) be a trigonometric polynomial of ordern satisfying Eqs. (1.1) and (1.2). The object of this note is to obtain sufficient conditions in order that thepth derivative ofR n(f, x) converges uniformly tof (p)(x) on the real line. The sufficient conditions turns out to bef (p)(x) ∈ Lipα, α>0 with the restrictions of Eq. (1.3). The author acknowledges financial support for this work from the University of Alberta, Post Doctoral Fellowship 1966–67. The author is extremely grateful to the referee for pointing out some valuable results and suggestions.  相似文献   

20.
Let f(z) be analytic on the unit disk, and let p*(z) be the best (Chebyshev) polynomial approximation to f(z) on the disk of degree at most n. It is observed that in typical problems the “error curve,” the image of the unit circle under (fp*)(z), often approximates to a startling degree a perfect circle with winding number n + 1. This phenomenon is approached by consideration of related problems whose error curves are exactly circular, making use of a classical theorem of Carathéodory and Fejér. This leads to a technique for calculating approximations in one step that are roughly as close to best as the best approximation error curve is close to circular, and hence to strong theorems on near-circularity as the radius of the domain shrinks to 0 or as n increases to ∞. As a computational example, very tight bounds are given for approximation of ez on the unit disk. The generality of the near-circularity phenomenon (more general domains, rational approximation) is discussed.  相似文献   

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

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