An implementation of the method of Ermakov and Zolotukhin for multidimensional integration and interpolation

Summary An interactive procedure is discussed for generating samples from the density function of Ermakov and Zolotukhin for application to Monte Carlo multiple integration and interpolation. The computational details of the implementation are described together with a numerical example.     

Numerische Quadratur bei Projektionsverfahren

Summary In this paper we investigate the influence of the numerical quadrature in projection methods. In particular we derive conditions for the order of the quadrature formulas in finite element methods under which the order of convergence is not perturbed. It seems that this question has been discussed only for the Ritz method. There is an essential difference between this method on one side and the Galerkin and least squares methods on the other side. The methods using numerical integration are only in the latter case still projection methods. The resulting conditions for the quadrature formulas are often much weaker than those for the Ritz method. Numerical examples using cubic splines and polynomials show that the conditions derived are realistic. These examples also allow the comparison of some projection methods.

     

A numerical method for detecting singular minimizers

Summary A numerical method for computing minimizers in one-dimensional problems of the calculus of variations is described. Such minimizers may have unbounded derivatives, even when the integrand is smooth and regular. In such cases, because of the Lavrentiev phenomenon, standard finite element methods may fail to converge to a minimizer. The scheme proposed is shown to converge to an absolute minimizer and is tested on an example. The effect of quadrature is analyzed. The implications for higher-dimensional problems, and in particular for fracture in nonlinear elasticity, are discussed.     

The error norm of Gaussian quadrature formulae for weight functions of Bernstein-Szegö type

Summary We consider the Gaussian quadrature formulae for the Bernstein-Szegö weight functions consisting of any one of the four Chebyshev weights divided by an arbitrary quadratic polynomial that remains positive on [–1, 1]. Using the method in Akrivis (1985), we compute the norm of the error functional of these quadrature formulae. The quality of the bounds for the error functional, that can be obtained in this way, is demonstrated by two numerical examples.     

Produktintegration mit nicht-äquidistanten Stützstellen

Summary For the numerical evaluation of , 0<<1 andx smooth, product integration rules are applied. It is known that high-order rules, e.g. Gauss-Legendre quadrature, become normal-order rules in this case. In this paper it is shown that the high order is preserved by a nonequidistant spacing. Furthermore, the leading error terms of this product integration method and numerical examples are given.

     

Monotony in interpolatory quadratures

Summary Let , be holomorphic in an open disc with the centrez ₀=0 and radiusr>1. LetQ _n (n=1, 2, ...) be interpolatory quadrature formulas approximating the integral . In this paper some classes of interpolatory quadratures are considered, which are based on the zeros of orthogonal polynomials corresponding to an even weight function. It is shown that the sequencesQ _n 9f] (n=1, 2, ...) are monotone. Especially we will prove monotony in Filippi's quadrature rule and with an additional assumption onf monotony in the Clenshaw-Curtis quadrature rule.     

Convergence of product formulas for the numerical evaluation of certain two-dimensional Cauchy principal value integrals

Summary We consider product rules of interpolatory type for the numerical approximation of certain two-dimensional Cauchy principal value integrals. We present convergence results which generalize those known in the one-dimensional case.Work sponsored by the Ministero della Pubblica Istruzione of Italy     

On best cubature formulas and spline interpolation

Summary A general cubature formula with an arbitrary preassigned weight function is derived using monosplines and integration by parts. The problem of determining the best cubature is formulated in terms of monosplines of least deviation and a solution to the problem is given by Theorem 3 below. This theorem may also be viewed as an optimal property of a new kind of two-dimensional spline interpolation.This work was done while the author was working at CERN, Geneva, Switzerland     

Parameter tuning and repeated application of the IMT-type transformation in numerical quadrature

Summary The IMT rule, which is especially suited for the integration of functions with end-point singularities, is generalized by introducing parameters and also by repeatedly applying the parametrized IMT transformation. The quadrature formulas thus obtained are improved considerably both in efficiency and in robustness against end-point singularities. Asymptotic error estimates and numerical results are also given.     

Optimal quadrature formula of Markov's and Locher's type with weight function

Summary A quadrature formula of Markov's type with a weight functionx (1–x), which has properties of formulas exact for polynomials of a given degree and properties of optimal formulas on some sets of functions, is given. The particular case of formula (where ==p=q=0) is the formula of Locher [1, 2].     

Barycentric formulae for cardinal (SINC-)interpolants

Summary We present a barycentric representation of cardinal interpolants, as well as a weighted barycentric formula for their efficient evaluation. We also propose a rational cardinal function which in some cases agrees with the corresponding cardinal interpolant and, in other cases, is even more accurate.In numerical examples, we compare the relative accuracy of those various interpolants with one another and with a rational interpolant proposed in former work.Dedicated to the memory of Peter HenriciThis work was done at the University of California at San Diego, La Jolla     

Product integration with the Clenshaw-Curtis points: Implementation and error estimates

Summary This paper is concerned with the practical implementation of a product-integration rule for approximating , wherek is integrable andf is continuous. The approximation is , where the weightsw _ni are such as to make the rule exact iff is any polynomial of degree n. A variety of numerical examples, fork(x) identically equal to 1 or of the form |–x| with >–1 and ||1, or of the form cosx or sinx, show that satisfactory rates of convergence are obtained for smooth functionsf, even ifk is very singular or highly oscillatory. Two error estimates are developed, and found to be generally safe yet quite accurate. In the special casek(x)1, for which the rule reduces to the Clenshaw-Curtis rule, the error estimates are found to compare very favourably with previous error estimates for the Clenshaw-Curtis rule.     

The numerical evaluation of Hadamard finite-part integrals

Summary A quadrature rule is described for the numerical evaluation of Hadamard finite-part integrals with a double pole singularity within the range of integration. The rule is based upon the observation that such an integral is the derivative of a Cauchy principal value integral.     

Onp-generator fully symmetric quadrature rules

Summary We consider fully symmetric quadrature rules for fully symmetricn-dimensional integration regions. When the region is a product region it is well known that product Gaussian rules exist. These obtain an approximation of polynomial degree 4p+1 based on (2p+1) ⁿ function values arranged on a rectangular grid. We term rules using such a grid,p-generator rules. In this paper we determine the necessary conditions on the region of integration forp-generator rules of degree 4p+1 to exist. Regions with this property are termed PropertyQ regions and besides product spaces, this class includes the hypersphere and other related regions.Work performed under the auspices of the U.S. Energy Research and Development Administration     

Error estimates for interpolatory quadrature formulae

Summary In this paper we study the remainder of interpolatory quadrature formulae. For this purpose we develop a simple but quite general comparison technique for linear functionals. Applied to quadrature formulae it allows to eliminate one of the nodes and to estimate the remainder of the old formula in terms of the new one. By repeated application we may compare with quadrature formulae having only a few nodes left or even no nodes at all. With the help of this method we obtain asymptotically best possible error bounds for the Clenshaw-Curtis quadrature and other Pólya type formulae.Our comparison technique can also be applied to the problem of definiteness, i.e. the question whether the remainderR[f] of a formula of orderm can be represented asc·f ^(m)(). By successive elimination of nodes we obtain a sequence of sufficient criteria for definiteness including all the criteria known to us as special cases.Finally we ask for good and worst quadrature formulae within certain classes. We shall see that amongst all quadrature formulae with positive coefficients and fixed orderm the Gauss type formulae are worst. Interpreted in terms of Peano kernels our theorem yields results on monosplines which may be of interest in themselves.     

Zur Interpolation und Integration differenzierbarer periodischer Funktionen

Summary Letx ₀<x ₁<...<x _n–1<x ₀+2 be nodes having multiplicitiesv ₀,...,v _n–1, 1v _k r (0k<n). We approximate the evaluation functional ,x fixed, and the integral respectively by linear functionals of the form and determine optimal weights for the Favard classesW _r C ₂. In the even case of optimal interpolation these weights are unique except forr=1,x(x _k +x _k–1)/2 mod 2. Moreover we get periodic polynomial splinesw _{k, j} (0k<n, 0j<v _k ) of orderr such that are the optimal weights. Certain optimal quadrature formulas are shown to be of interpolatory type with respect to these splines. For the odd case of optimal interpolation we merely have obtained a partial solution.

Bojanov hat in [4, 5] ähnliche Resultate wie wir erzielt. Um Wiederholungen zu vermeiden, werden Resultate, deren Beweise man bereits in [4, 5] findet, nur zitiert     

Monotonie bei den Quadraturverfahren von Gauß und Newton-Cotes

Summary LetQ _n be the quadrature rule of Gauss or Newton-Cotes withn abscissas. It is proven here, thatf ⁽²ⁿ⁾0 impliesQ _n ^G [f]Q _m ^G [f] (for allm>n) andQ _2n–1 ^NC [f]Q _2n ^NC [f]Q _2n+1 ^NC [f]. It follows that the sequenceQ _n[f] (n=1, 2, ...) is monotone, if all derivatives off are positive.

     

Dividierte Differenzen und Monotonie von Quadraturformeln

Summary As a generalisation of divided differences we consider linear functionals vanishing for polynomials of given degree and with discrete support. It is shown that functionals of that type may be uniquely represented by a linear combination of divided differences. On the basis of this representation theorem we introduce the concept of positivity and definiteness of functions and linear functionals. Next we show that in many cases positivity follows from the number of sign changes of the coefficients of the given linear functional. These results may be applied to the problems of nonexistence of Newton-Côtes and Gegenbauer quadrature formulas with positive weights and to the monotony problem of Gauss and Newton Côtes quadrature.

     

Bases de type schauder deC[0,1] et formules de quadrature associées

Résumé On caractérise deux familles de bases deC[0,1] et l'on étudie les formules de quadrature associées. On montre en particulier que les formules de quadrature de Romberg proviennent d'une suite de bases engendrées par des polynômes.

---

Bases of schauder type inC[0, 1] and associated quadrature formulas

Summary We characterize two families of bases ofC[0,1] and we study the associated quadrature formulae. In particular, we prove that the Romberg quadrature formulae come from a sequence of bases generated by polynomials.