Upper bounds for the first zeros of Bessel functions

An upper bound for the first positive zero of the Bessel functions of first kind J_μ(z) for μ > −1 is given. This upper bound is better than a number of upper bounds found recently by several authors. The upper bound given in this paper follows from a step of the Ritz's approximation method, applied to the eigenvalue problem of a compact self-adjoint operator, defined on an abstract separable Hilbert space. Some advantages of this method in comparison with other approximation methods are presented.     

An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound

Smale's analysis of Newton's iteration function induce a lower bound on the gap between two distinct zeros of a given complex-valued analytic function . In this paper we make use of a fundamental family of iteration functions , , to derive an infinite family of lower bounds on the above gap. However, even for , where coincides with Newton's, our lower bound is more than twice as good as Smale's bound or its improved version given by Blum, Cucker, Shub, and Smale. When is a complex polynomial of degree , for small the corresponding bound is computable in arithmetic operations. For quadratic polynomials, as increases the lower bounds converge to the actual gap. We show how to use these bounds to compute lower bounds on the distance between an arbitrary point and the nearest root of . In particular, using the latter result, we show that, given a complex polynomial , , for each we can compute upper and lower bounds and such that the roots of lie in the annulus . In particular, , ; and , , where . An application of the latter bounds is within Weyl's classical quad-tree algorithm for computing all roots of a given complex polynomial.

     

Cyclicity of zeros of families of analytic functions

Let be a family of holomorphic functions in the unit disk , which are also holomorphic in a parameter . We express cyclicity (=generalized multiplicity) of a zero of at via some algebraic characteristics of the ideal generated by the Taylor coefficients of . As an example we estimate the cyclicity of the family of generalized exponential polynomials.     

Approximating the zeros of analytic functions by the exclusion algorithm

We give a practical version of the exclusion algorithm for localizing the zeros of an analytic function and in particular of a polynomial in a compact of . We extend the real exclusion algorithm to a Jordan curve and give a method which excludes discs without any zero. The result of this algorithm is a set of discs arbitrarily small which contains the zeros of the analytic function.     

Estimates for the orders of zeros of polynomials in some analytic functions

In the present paper, we consider estimates for the orders of zeros of polynomials in functions satisfying a system of algebraic differential equations and possessing a special D-property defined in the paper. The main result obtained in the paper consists of two theorems for the two cases in which these estimates are given. These estimates are improved versions of a similar estimate proved earlier in the case of algebraically independent functions and a single point. They are derived from a more general theorem concerning the estimates of absolute values of ideals in the ring of polynomials, and the proof of this theorem occupies the main part of the present paper. The proof is based on the theory of ideals in rings of polynomials. Such estimates may be used to prove the algebraic independence of the values of functions at algebraic points.     

Lower and upper bounds for characteristic functions

In the paper, several known inequalities for characteristic functions are sharpened and several new ones are derived. Proceedings of the XVII Seminar on Stability Problems for Stochastic Models, Kazan, Russia, 1995, Part III.     

Endpoint bounds for an analytic family of maximal functions

In this paper,for the plane curve T=.we define an analytic family of maximal functions asso-ciated to T asM_2f(λ)=sup_n>oh~-1∫_R相似文献   

Error bounds for rational quadrature formulae of analytic functions

We study the error of rational quadrature rules when functions which are analytic on a neighborhood of the set of integration are considered. A computable upper bound of the error is presented which is valid for a broad range of rational quadrature formulae and a comparison is made with the exact error for a number of numerical examples.This work was supported by the Dirección General de Investigación (DGI), Ministerio de Ciencia y Tecnología, under grants BFM2003-06335-C03-02 and BFM2002-04315- C02-01.     

On the zeros of analytic functions belonging to Gevrey classes

For functionsf(z) ? 0, holomorphic in the unit disk u, infinitely differentiable in u, and belonging to a given Gevrey class on ?u, we establish sufficient conditions characterizing the sets K _f ^∞ = (z: ¦z¦ = 1,f ^(k) (z) = 0,k = 0, 1, 2, ... }. These conditions are close to the necessary condition due to L. Carleson and substantially more precise than the conditions given byA.-M. Chollet (see [1, 2]).     

Some analytic bounds for zeta functions and class numbers

Inventiones mathematicae -     

A verified method for bounding clusters of zeros of analytic functions

In this paper, we propose a verified method for bounding clusters of zeros of analytic functions. Our method gives a disk that contains a cluster of m   zeros of an analytic function f(z)$f(z)$. Complex circular arithmetic is used to perform a validated computation of n  -degree Taylor polynomial p(z)$p(z)$ of f(z)$f(z)$. Some well known formulae for bounding zeros of a polynomial are used to compute a disk containing a cluster of zeros of p(z)$p(z)$. A validated computation of an upper bound for Taylor remainder series of f(z)$f(z)$ and a lower bound of p(z)$p(z)$ on a circle are performed. Based on these results, Rouché's theorem is used to verify that the disk contains the cluster of zeros of f(z)$f(z)$. This method is efficient in computation of the initial disk of a method for finding validated polynomial factor of an analytic function. Numerical examples are presented to illustrate the efficiency of the proposed method.     

A modification of the classical quadrature method for locating zeros of analytic functions

The classical method for determination of a simple zeroa of an analytic functionf(z) inside a closed contourC by using the formulaa=(2i)^–1 _C [zf'(z)/f(z)]dz is reconsidered and modified. The modification consists in using the Cauchy theorem instead of the Cauchy formula and, further, evaluating numericallya as one of the zeros of an appropriate polynomial depending on the quadrature rule used. The case of circular contours with application of the trapezoidal rule is considered in detail and numerical results are presented.     

Counting functions of zeros of analytic functions in spaces with mixed norm

We study the behavior of counting functions of zeros of analytic in a disk functions in spaces with mixed norm, in particular, the Bergman-Dzhrbashyan spaces with standard weights. We obtain corollaries that strengthen the known results on zero sets of spaces with mixed norm.