نتایج جستجو برای: uniform approximation

تعداد نتایج: 302620  

1997
Martin Sieber Henning Schomerus

We derive a uniform approximation for semiclassical contributions of periodic orbits to the spectral density which is valid for generic period-quadrupling bifurcations in systems with a mixed phase space. These bifurcations involve three periodic orbits which coalesce at the bifurcation. In the vicinity of the bifurcation the three orbits give a collective contribution to the spectral density w...

2007
JOHN WERMER

Let X be a compact set in the z-plane. We are interested in two function spaces associated with X: C(X) — space of all continuous complex-valued functions on X. P(X) =space of all uniform limits of polynomials on X. Thus a function ƒ on X lies in P{X) if there exists a sequence {Pn} of polynomials converging to ƒ uniformly on X. Clearly P(X) is part of C(X). QUESTION I. When is P(X) = C(X)t i.e...

2004
E. B. SAFF V. TOTIK

We investigate the asymptotic behavior of the polynomials {Pn(f)}'t' of best uniform approximation to a function f that is continuous on a compact set K of the complex plane C and analytic in the interior of K, where K has connected complement. For example, we show that for "most" functions f, the error f -Pn(f) does not decrease faster at interior points of K than on K itself. We also describe...

2000
C. A. A. de Carvalho R. M. Cavalcanti E. S. Fraga S. E. Jorás

We present a simple method to deal with caustics in the semiclassical approximation to the partition function of a one-dimensional quantum system. The procedure, which makes use of complex trajectories, is applied to the quartic double-well potential.

Journal: :Journal of Approximation Theory 2008
Jean-Paul Calvi Norman Levenberg

We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...

2011
Adrian Holhoş

We characterize the functions defined on a weighted space, which are uniformly approximated by a sequence of positive linear operators and we obtain the range of the weights which can be used for uniform approximation. We, also, obtain an estimation of the remainder in terms of the usual modulus of continuity. We give particular results for the Szász-Mirakjan and Baskakov operators. Mathematics...

1997
Paulo J. S. G. Ferreira

This work studies some of the approximating properties of feedforward neural networks as a function of the number of nodes. Two cases are considered: sigmoidal and radial basis function networks. Bounds for the approximation error are given. The methods through which we arrive at the bounds are constructive. The error studied is the L1 or sup error.

2012
TERRENCE M. ADAMS ANDREW B. NOBEL

For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik–Chervonenkis (VC) dimension or (ii) for every ε > 0 there is a finite partition π such the essential π -boundary of each set has measure at most ε. Immediate corollaries include the fact that a separable family with finite VC dimension has finite bracketing numbers, and satisfies uni...

2005
Minghui Jiang Binhai Zhu Michael Oudshoorn

We study two geometric optimization problems motivated by cartographic applications: Map Labeling with Uniform Circles (MLUC) and Map Labeling with Uniform Circle Pairs (MLUCP). We show that the decision problems of both MLUC and MLUCP are NP-hard, and that the related optimization problems for maximizing the label sizes are NP-hard to approximate within factor 1.0349. We design approximation a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید