Inversely Symmetric Interpolatory Quadrature Rules

We consider interpolatory quadrature rules with nodes and weights satisfying symmetric properties in terms of the division operator. Information concerning these quadrature rules is obtained using a transformation that exists between these rules and classical symmetric interpolatory quadrature rules. In particular, we study those interpolatory quadrature rules with two fixed nodes. We obtain specific examples of such quadrature rules.     

Summation-by-parts operators and high-order quadrature

Summation-by-parts (SBP) operators are finite-difference operators that mimic integration by parts. The SBP operator definition includes a weight matrix that is used formally for discrete integration; however, the accuracy of the weight matrix as a quadrature rule is not explicitly part of the SBP definition. We show that SBP weight matrices are related to trapezoid rules with end corrections whose accuracy matches the corresponding difference operator at internal nodes. For diagonal weight matrices, the accuracy of SBP quadrature extends to curvilinear domains provided the Jacobian is approximated with the same SBP operator used for the quadrature. This quadrature has significant implications for SBP-based discretizations; in particular, the diagonal norm accurately approximates the L²$L^2$ norm for functions, and multi-dimensional SBP discretizations accurately approximate the divergence theorem.     

Integral refinable operators exact on polynomials

We study integral refinable operators of integral type exact on polynomials of even degree constructed by using refinable B-bases of GP type. We prove a general theorem of existence and uniqueness. Then we study the L^p$L^p$-norm of these operators and we give error bounds in approximating functions and their derivatives belonging to suitable classes. Numerical results and comparisons with other quasi-interpolatory operators having the same order of exactness on polynomial reproduction are presented.     

Szegő–Lobatto quadrature rules

Gauss-type quadrature rules with one or two prescribed nodes are well known and are commonly referred to as Gauss–Radau and Gauss–Lobatto quadrature rules, respectively. Efficient algorithms are available for their computation. Szeg? quadrature rules are analogs of Gauss quadrature rules for the integration of periodic functions; they integrate exactly trigonometric polynomials of as high degree as possible. Szeg? quadrature rules have a free parameter, which can be used to prescribe one node. This paper discusses an analog of Gauss–Lobatto rules, i.e., Szeg? quadrature rules with two prescribed nodes. We refer to these rules as Szeg?–Lobatto rules. Their properties as well as numerical methods for their computation are discussed.     

SINGULAR INTEGRAL OPERATORS ANDSINGULAR QUADRATURE OPERATORSASSOCIATED WITH SINGULAR INTEGRAL EQUATIONS

1IntroductionSingUlarlintegralequations(SIEs)withCauchytypekernelsoftheformappearfrequelltlyinproblemsOfthetheoriesofelasticity.Heretheinputfunctionsa)b,f,l,aretheH5lder-continuousfunctionsfortheirvariables,Aisagivenconstant,anditisrequiredtofindthesolutionWintheclassho[1,2].Theclassicaltheoryoftheseequationsisrathercomplete[1,2].Inthepasttwentyyearsagreatdealofinteresthasarisenintheirnumericalsolution.VariouscollocationmethodsforSIEshaveappeared,forwhichsomereferencescanbefoundinthesurv…     

Higher-order Newton–Cotes rules with end corrections

We present higher-order quadrature rules with end corrections for general Newton–Cotes quadrature rules. The construction is based on the Euler–Maclaurin formula for the trapezoidal rule. We present examples with 6 well-known Newton–Cotes quadrature rules. We analyze modified end corrected quadrature rules, which consist on a simple modification of the Newton–Cotes quadratures with end corrections. Numerical tests and stability estimates show the superiority of the corrected rules based on the trapezoidal and the midpoint rules.     

Symmetric Gauss–Lobatto and Modified Anti-Gauss Rules

The present paper is concerned with symmetric Gauss–Lobatto quadrature rules, i.e., with Gauss–Lobatto rules associated with a nonnegative symmetric measure on the real axis. We propose a modification of the anti-Gauss quadrature rules recently introduced by Laurie, and show that the symmetric Gauss–Lobatto rules are modified anti-Gauss rules. It follows that for many integrands, symmetric Gauss quadrature rules and symmetric Gauss–Lobatto rules give quadrature errors of opposite sign.     

Quadrature rules for integrals of fuzzy-number-valued functions

In this paper, we introduce some quadrature rules for the Henstock integral of fuzzy-number-valued mappings by giving error bounds for mappings of bounded variation and of Lipschitz type. We also consider generalizations of classical quadrature rules, such as midpoint-type, trapezoidal and three-point-type quadrature. Finally, we study δ-fine quadrature rules and we present some numerical applications.     

Anti-Szego quadrature rules

Szego quadrature rules are discretization methods for approximating integrals of the form . This paper presents a new class of discretization methods, which we refer to as anti-Szego quadrature rules. Anti-Szego rules can be used to estimate the error in Szego quadrature rules: under suitable conditions, pairs of associated Szego and anti-Szego quadrature rules provide upper and lower bounds for the value of the given integral. The construction of anti-Szego quadrature rules is almost identical to that of Szego quadrature rules in that pairs of associated Szego and anti-Szego rules differ only in the choice of a parameter of unit modulus. Several examples of Szego and anti-Szego quadrature rule pairs are presented.

     

Gaussian Quadrature Rules with Simple Node-Weight Relations

In this paper, we consider the symmetric Gaussian and L-Gaussian quadrature rules associated with twin periodic recurrence relations with possible variations in the initial coefficient. We show that the weights of the associated Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 4. We also show that the weights of the associated L-Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 5. Special cases of these quadrature rules are given. Finally, an easy to implement procedure for the evaluation of the nodes is described.     

Asymptotically optimal quadrature rules for uniform splines over the real line

Numerical Algorithms - We provide explicit asymptotically optimal quadrature rules for uniform Ck-splines, k =?0,1, over the real line. The nodes of these quadrature rules are given in terms...     

The Construction of Reducible Quadrature Rules for Volterra Integral and Integro-differential Equations

A formal relationship between quadrature rules and linear multistepmethods for ordinary differential equations is exploited forthe generation of quadrature weights. Employing the quadraturerules constructed in this way, step-by-step methods for secondkind Volterra integral equations and integro-differential equationsare defined and convergence and stability results are presented. The construction of the quadrature rules generated by the backwarddifferentiation formulae is discussed in detail. The use ofthese rules for the solution of Volterra type equations is proposedand their good performance is demonstrated by numerical experiments.     

Another quadrature rule of highest algebraic degree of precision

Summary. We consider certain quadrature rules of highest algebraic degree of precision that involve strong Stieltjes distributions (i.e., strong distributions on the positive real axis). The behavior of the parameters of these quadrature rules, when the distributions are strong -inversive Stieltjes distributions, is given. A quadrature rule whose parameters have explicit expressions for their determination is presented. An application of this quadrature rule for the evaluation of a certain type of integrals is also given. Received April 17, 1991 / Revised version received July 16, 1993     

Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules

We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve the near optimal order of convergence. The main problem addressed in this paper is to find an efficient way of computing the worst-case error. A general algorithm is presented and explicit expressions for base 2 are given. To obtain an efficient component-by-component construction algorithm we exploit the structure of the underlying cyclic group. We compare our new higher order multivariate quadrature rules to existing quadrature rules based on higher order digital nets by computing their worst-case error. These numerical results show that the higher order polynomial lattice rules improve upon the known constructions of quasi-Monte Carlo rules based on higher order digital nets.     

Stable high-order quadrature rules with equidistant points

Newton-Cotes quadrature rules are based on polynomial interpolation in a set of equidistant points. They are very useful in applications where sampled function values are only available on a regular grid. Yet, these rules rapidly become unstable for high orders. In this paper we review two techniques to construct stable high-order quadrature rules using equidistant quadrature points. The stability follows from the fact that all coefficients are positive. This result can be achieved by allowing the number of quadrature points to be larger than the polynomial order of accuracy. The computed approximations then implicitly correspond to the integral of a least squares approximation of the integrand. We show how the underlying discrete least squares approximation can be optimised for the purpose of numerical integration.     

Discrete Jackson-type Operators via a Boolean Sum Approach

In the present paper we consider Jackson-type operators obtained via a Boolean sum, as studied by Cao, Gonska et al. We also present an alternative to their classical method of discretization using appropriate quadrature formulas. Our goal is to obtain for the discretized operators the same degree of approximation as Cao and Gonska (in particular, DeVore-Gopengauz inequalities), at the same time making sure that the operators discretized by means of our method will inherit more properties from the initial operators than by using quadrature formulas. As an example, we will consider convolution-type operators that preserve convexity up to a certain order, and we will show that the operators discretized with our technique also preserve monotonicity and convexity.     

Boundary value methods for Volterra integral and integro-differential equations

New and effective quadrature rules generated by boundary value methods are introduced. We employ the introduced quadrature rules to construct quadrature methods for the second kind Volterra integral equations and Volterra integro-differential equations. These methods are shown to be effective and possess excellent convergence properties. The nonlinear multigrid method is applied to solve the discrete systems derived from the introduced numerical scheme. Numerical simulations are presented and confirm the efficiency and accuracy of the methods.     

SINGULAR INTEGRAL OPERATORS AND SINGULAR QUADRATURE OPERATORS ASSOCIATED WITH SINGULAR INTEGRAL EQUATIONS OF THE FIRST KIND AND THEIR APPLICATIONS

ＳＩＮＧＵＬＡＲＩＮＴＥＧＲＡＬＯＰＥＲＡＴＯＲＳＡＮＤＳＩＮＧＵＬＡＲＱＵＡＤＲＡＴＵＲＥＯＰＥＲＡＴＯＲＳＡＳＳＯＣＩＡＴＥＤＷＩＴＨＳＩＮＧＵＬＡＲＩＮＴＥＧＲＡＬＥＱＵＡＴＩＯＮＳＯＦＴＨＥＦＩＲＳＴＫＩＮＤＡＮＤＴＨＥＩＲＡＰＰＬＩＣＡＴＩ...     

Orthogonal polynomials and Gaussian quadrature for refinable weight functions

We show how to compute the modified moments of a refinable weight function directly from its mask in O(N²n) rational operations, where N is the desired number of moments and n the length of the mask. Three immediate applications of such moments are:

• the expansion of a refinable weight function as a Legendre series;

• the generation of the polynomials orthogonal with respect to a refinable weight function;

• the calculation of Gaussian quadrature formulas for refinable weight functions.

In the first two cases, all operations are rational and can in principle be performed exactly.