Moduli of smoothness and approximation on the unit sphere and the unit ball

A new modulus of smoothness based on the Euler angles is introduced on the unit sphere and is shown to satisfy all the usual characteristic properties of moduli of smoothness, including direct and inverse theorem for the best approximation by polynomials and its equivalence to a K-functional, defined via partial derivatives in Euler angles. The set of results on the moduli on the sphere serves as a basis for defining new moduli of smoothness and their corresponding K-functionals on the unit ball, which are used to characterize the best approximation by polynomials on the ball.     

Bernstein-Kantorovich算子的迭代布尔和的逼近性质

本文利用光滑模及最佳逼近多项式的性质,研究了Bernstein-Kantorovich算子的迭代布尔和对Lp[0,1]中的函数的逼近性质,得到了逼近正定理,弱逆不等式及等价定理.     

On the degree of approximation by spline functions with free knots

Summary A comparison theorem is derived for Chebyshev approximation by spline functions with free knots. This generalizes a result of Bernstein for approximation by polynomials.     

A general approach to counterexamples in numerical analysis

Summary The purpose of this paper is to indicate a unified approach to quantitative negative results in numerical analysis. This is done via a rather general theorem which in fact subsumes our previous quantitative uniform boundedness principles. The proof is based upon a gliding hump method. The general theorem is exemplarily applied to discuss the sharpness of various direct and inverse approximation results, known for the compound trapezoidal rule and for the approximate solution of the heat equation. The treatment outlines a program which may also be worked out for other procedures.Supported by Deutsche Forschungsgemeinschaft Grant No. Ne 171/5-1     

Erdös-Turán theorems on a system of Jordan curves and arcs

Erdös and Turán established in [4] a qualitative result on the distribution of the zeros of a monic polynomial, the norm of which is known on [–1, 1]. We extend this result to a polynomial bounded on a systemE of Jordan curves and arcs. If all zeros of the polynomial are real, the estimates are independent of the number of components ofE for any regular compact subsetE ofR. As applications, estimates for the distribution of the zeros of the polynomials of best uniform approximation and for the extremal points of the optimal error curve (generalizations of Kadec's theorem) are given.Communicated by Dieter Gaier.     

On approximation of functions by algebraic polynomials in Hölder spaces

We study approximation of functions by algebraic polynomials in the Hölder spaces corresponding to the generalized Jacobi translation and the Ditzian–Totik moduli of smoothness. By using modifications of the classical moduli of smoothness, we give improvements of the direct and inverse theorems of approximation and prove the criteria of the precise order of decrease of the best approximation in these spaces. Moreover, we obtain strong converse inequalities for some methods of approximation of functions. As an example, we consider approximation by the Durrmeyer–Bernstein polynomial operators.     

More on Comonotone Polynomial Approximation

The main achievement of this paper is that we show, what was to us, a surprising conclusion, namely, twice continuously differentiable functions in (0,1) (with some regular behavior at the endpoints) which change monotonicity at least once in the interval, are approximable better by comonotone polynomials, than are such functions that are merely monotone. We obtain Jackson-type estimates for the comonotone polynomial approximation of such functions that are impossible to achieve for monotone approximation. July 7, 1998. Date revised: May 5, 1999. Date accepted: July 23, 1999.     

Adaptive polynomial preconditioning for hermitian indefinite linear systems

This paper explores the use of polynomial preconditioned CG methods for hermitian indefinite linear systems,Ax=b. Polynomial preconditioning is attractive for several reasons. First, it is well-suited to vector and/or parallel architectures. It is also easy to employ, requiring only matrix-vector multiplication and vector addition. To obtain an optimum polynomial preconditioner we solve a minimax approximation problem. The preconditioning polynomial,C(), is optimum in that it minimizes a bound on the condition number of the preconditioned matrix,C(A)A. We also characterize the behavior of this minimax polynomial, which makes possible a thorough understanding of the associated CG methods. This characterization is also essential to the development of an adaptive procedure for dynamically determining the optimum polynomial preconditioner. Finally, we demonstrate the effectiveness of polynomial preconditioning in a variety of numerical experiments on a Cray X-MP/48. Our results suggest that high degree (20–50) polynomials are usually best.This research was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Dept. of Energy, by Lawrence Livermore National Laboratory under contract W-7405-ENG-48.This research was supported in part by the Dept. of Energy and the National Science Foundation under grant DMS 8704169.This research was supported in part by U.S. Dept. of Energy grant DEFG02-87ER25026 and by National Science Foundation grant DMS 8703226.     

Joint discrete universality for periodic zeta-functions

Abstract

In the paper, joint universality theorems for periodic zeta functions with multiplicative coefficients and periodic Hurwitz zeta-functions are proved. The main theorem of [11] is extended, and two new joint universality theorems on the approximation of a collection of analytic functions by discrete shifts of the above zeta-functions are obtained. For this, certain linear independence hypotheses are applied.     

Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle

We construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation points for the triangle. As opposed to good interpolation points, such meshes are straightforward to compute for any degree. The construction can be extended to polygons by triangulation.     

A shape-preserving quasi-interpolation operator satisfying quadratic polynomial reproduction property to scattered data

In this paper, we construct a univariate quasi-interpolation operator to non-uniformly distributed data by cubic multiquadric functions. This operator is practical, as it does not require derivatives of the being approximated function at endpoints. Furthermore, it possesses univariate quadratic polynomial reproduction property, strict convexity-preserving and shape-preserving of order 3 properties, and a higher convergence rate. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operator with that of Wu and Schaback’s quasi-interpolation scheme.     

Quasi-interpolation with translates of a function having noncompact support

We establish a result related to a theorem of de Boor and Jia [1]. Their theorem, in turn, corrected and extended a result of Fix and Strang [5] concerning controlled approximation. In our result, the approximating functions are not required to have compact support, but satisfy instead conditions on their behavior at . Our theorem includes some recent results of Jackson [6] and is closely related to the work of Buhmann [2].Communicated by Carl de Boor     

Approximation by entire functions on countable unions of segments of the real axis: 2. proof of the main theorem

In this study, we consider an approximation of entire functions of Hölder classes on a countable union of segments by entire functions of exponential type. It is essential that the approximation rate in the neighborhood of segment ends turns out to be higher in the scale that had first appeared in the theory of polynomial approximation by functions of Hölder classes on a segment and made it possible to harmonize the so-called “direct” and “inverse” theorems for that case, i.e., restore the Hölder smoothness by the rate of polynomial approximation in this scale. Approximations by entire functions on a countable union of segments have not been considered earlier. The first section of this paper presents several lemmas and formulates the main theorem. In this study, we prove this theorem on the basis of earlier given lemmas.     

A remark on Serrin’s Theorem

An approximation theorem for families of weakly coercive convex functions by means of countably many smooth families of convex functions is proved. As a consequence, the classical “three-fold” lower semicontinuity theorem for integral functionals of the Calculus of Variations by James Serrin is unified in one single statement.     

Greedy Algorithm and m -Term Trigonometric Approximation

We study the following nonlinear method of approximation by trigonometric polynomials in this paper. For a periodic function f we take as an approximant a trigonometric polynomial of the form , where is a set of cardinality m containing the indices of the m biggest (in absolute value) Fourier coefficients of function f . We compare the efficiency of this method with the best m -term trigonometric approximation both for individual functions and for some function classes. It turns out that the operator G _m provides the optimal (in the sense of order) error of m -term trigonometric approximation in the L _p -norm for many classes. September 23, 1996. Date revised: February 3, 1997.     

Convergence and computation of simultaneous rational quadrature formulas

We discuss the convergence and numerical evaluation of simultaneous quadrature formulas which are exact for rational functions. The problem consists in integrating a single function with respect to different measures using a common set of quadrature nodes. Given a multi-index n, the nodes of the integration rule are the zeros of the multi-orthogonal Hermite–Padé polynomial with respect to (S, α, n), where S is a collection of measures, and α is a polynomial which modifies the measures in S. The theory is based on the connection between Gauss-type simultaneous quadrature formulas of rational type and multipoint Hermite–Padé approximation. The numerical treatment relies on the technique of modifying the integrand by means of a change of variable when it has real poles close to the integration interval. The output of some tests show the power of this approach in comparison with other ones in use.     

Error estimates of quasi-interpolation and its derivatives

Quasi-interpolation of radial basis functions on finite grids is a very useful strategy in approximation theory and its applications. A notable strongpoint of the strategy is to obtain directly the approximants without the need to solve any linear system of equations. For radial basis functions with Gaussian kernel, there have been more studies on the interpolation and quasi-interpolation on infinite grids. This paper investigates the approximation by quasi-interpolation operators with Gaussian kernel on the compact interval. The approximation errors for two classes of function with compact support sets are estimated. Furthermore, the approximation errors of derivatives of the approximants to the corresponding derivatives of the approximated functions are estimated. Finally, the numerical experiments are presented to confirm the accuracy of the approximations.     

Polynomial approximation of piecewise analytic functions on a compact subset of the real line

We discuss Totik’s extension of the classical Bernstein theorem on polynomial approximation of piecewise analytic functions on a closed interval. The error of the best uniform approximation of such functions on a compact subset of the real line is studied.     

Minimally supported error representations and approximation by the constants

Summary. Distribution theory is used to construct minimally supported Peano kernel type representations for linear functionals such as the error in multivariate Hermite interpolation. The simplest case is that of representing the error in approximation to f by the constant polynomial f(a) in terms of integrals of the first order derivatives of f. This is discussed in detail. Here it is shown that suprisingly there exist many representations which are not minimally supported, and involve the integration of first order derivatives over multidimensional regions. The distance of smooth functions from the constants in the uniform norm is estimated using our representations for the error. Received June 30, 1997 / Revised version received April 6, 1999 / Published online February 17, 2000     

Cost-Reduction in Hyperinterpolation

Discretized Newman–Shapiro-operators furnish a generalized hyperinterpolation method on the sphere with valuable mathematical properties. Unfortunately the price is high numerical evaluation cost, which, however, can be reduced significantly, in a first step, by a truncation method. The remaining, relevant terms, now small in number, are values of a (zonal) kernel function with arguments near the pole. Here, and with respect to the degree, the kernel function satisfies an asymptotic formula. It is based on a generalized Mehler–Heine-type formula which concerns certain ‘divided’ Gegenbauer-polynomials and Bessel-functions. This formula is proved and used in order to reduce, in a second step, the evaluation cost once more, such that the discretized Newman–Shapiro-operators become a competitive direct numerical polynomial approximation method on the sphere. For example, the graph of a degree 160 approximation to a rather complicated spherical function has been calculated with a time (cost) reduction, in total, by a factor about 10⁻⁴.