Abstract
Our goal is to alleviate the constraint of the classical 1D interpolatory nested quadratures than one should go from a set of n to a set of (2\(n+1\)) points (for Fejér second rule [5]) or (2\(n-1\)) points (for Clenshaw-Curtis rule [1]) to benefit from the nesting property. In this work a sequence of recursively included quadrature sets for all odd number of quadrature points is proposed to define interpolatory rules. These sets are confounded with the one of Fejér’s second rule when the cardinal is a power of two minus one and different if not. The weights of the corresponding interpolatory rule are studied. This rule is efficient for calculating integrals of very regular functions with control of accuracy via application of successive formulas of increasing order.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Clenshaw, C.W., Curtis, A.R.: A method for numerical integration on an automatic computer. Numer. Math. 2, 197–205 (1960)
Dahlquist, G., Björck, A.: Numerical Methods in Scientific Computing. SIAM, New York (2008)
Davis, P.J., Rabinowitz, P.: Methods of Numerical Integration. Academic press, New York, San Francisco, London (1975)
Imhof, J.P.: On the method for numerical integration of Clenshaw and Curtis. Numer. Math. 5, 138–141 (1963)
Fejér, L.: Mechanische Quadraturen mit positiven Cotesschen Zahlen. Math. Z. 37, 287–309 (1933)
Trefethen, L.N.: Is Gauss quadrature better than Clenshaw-Curtis? SIAM Rev. 50(1), 67–87 (2008)
Acknowledgments
The author is very grateful to professor Albert Cohen for his explanations and recommendations, in particular about the comparison of a function and its Fourier series. He thanks the reviewer for his useful remarks. He warmly thanks Andrea Resmini for his careful check of this document.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendices
1.1 Properties of the Non-ordered Rules
In the definition of the proposed rule, in Sect. 1.4, the way to successively add the points of \(\mathcal{F}_{2M+1}\) that do not belong to \(\mathcal{F}_{M}\), to define the intermediate sets of points \(\mathcal{S}_{M+2}\) to \(\mathcal{S}_{2M-1}\) has been explicitely prescribed: the opposite largest and lowest missing values are successively added. This procedure (qualified here as “ordered” as in Sect. 1.3) may seem arbitrary and the reader may wonder whether there are other ways of defining a fully nested rule with positive weights. The possible other sets (qualified as “non-ordered” as in Sect. 1.3.) of 5 points (resp. 9 11 and 13 points) are considered in this appendix. In order to avoid confusions between formulae and numerical values for ordered and non-ordered rules, an underline is added to the notation of the sets, the weights and the delta functions related to non-ordered rules.
The first proposed rule distinct from the ones of Fejér is the five-point rule. Instead of \(\pm \cos (\pi /8)\), \(\pm \cos (3\pi /8)\) could be added to \( \mathcal{S}_3\) to build \( \underline{\mathcal{S}_5}\) while preserving the property of successive inclusion of the sets. The corresponding weights are
A weight is negative; that is not satisfactory for the reason discussed in Sect. 1.1 and in the conclusion. The definition of sequentially included 9-point, 11-point and 13-point sets between \(\mathcal{F}_7\) and \(\mathcal{F}_{15}\) is discussed. The numerical values of the weights have been calculated using LAPACK. For systems of corresponding sizes with known solution, an accuracy of eight to nine digits is obtained. The weights of the non-ordered rules are printed below with four digits for the sake of readability.
The abscissae of \(\mathcal{F}_{15}\) that can be added to \(\mathcal{F}_7\) without having a negative weight in the 9-point rule are \(\pm \cos (\pi /16) \) (proposed standard choice) and \(\pm \cos (5\pi /16)\). The two choices lead to positive weights for the corresponding 9-point rule. Unfortunately, no 11-point rule with positive weights can be built by adding \(\pm \cos (\pi /16)\), \(\pm \cos (3\pi /16)\) or \(\pm \cos (7\pi /16)\) to the non-ordered set \(\underline{\mathcal{S}}_9\):
A sequence of sets corresponding to positive weights is then searched based on \(\mathcal{S}_9\). Adding \(\pm \cos (3 \pi /16)\) (as in the 11-point ordered rule) or \(\pm \cos (7 \pi /16) \) leads to a set of positive weights. If the second choice is retained, neither \(\pm \cos (3 \pi /16)\) nor \(\pm \cos (5 \pi /16)\) can be added to the non-ordered 11-point set while still obtaining positive weights.
If the ordered set \(\mathcal{S}_{11}\) is considered, then the last four abscissae \(\pm \cos (5 \pi /16)\), \(\pm \cos (7 \pi /16)\) can only be added to the set in this order to build the 13- and then 15-point rule (if not, the 13-point rule has a negative weight).
Hence, for small numbers of points, it is impossible (set of 5 points) or only partly possible (set of 9, 11, 13 points) to define fully nested successive sets of quadrature points between two standard sets of Fejér quadrature that lead to interpolatory quadratures with only positive weights.
1.2 Calculation of \(\varphi ^j_{{\tiny {M}}}\)
Let us first define \(\overline{\varPhi }^j_s(\theta )\) (s being an even integer) as
Using the trigonometric identity for \( \sin (a)\cos (b) \) the \(\overline{\varPhi }^j_s\) can be expanded in a series of sine functions with odd-integer-times-\(\theta \) arguments. This series is “symmetric” about \(\sin (s \theta )\). Let \(\overline{\varphi }^j_s\) denote the integral of \(\overline{\varPhi }^j_s\) over \([0,\pi ]\). Another consequence of \( \sin (a)\cos (b) \) identity is that \( \overline{\varPhi }^{j+1}_s(\theta )\), \( \overline{\varPhi }^{j}_{s-2}(\theta )\), \( \overline{\varPhi }^{j}_{s}(\theta )\), and \( \overline{\varPhi }^{j}_{s+2}(\theta )\) satisfy a simple recurrence relation:
When applying the trigonometric identity \( \sin (a)\cos (b) \) with \(B=2\theta \) for all \(\sin ( k \theta )\) terms of \(\overline{\varPhi }^j_s(\theta )\), the sum of two series with the same coefficients \(\overline{\varPhi }^j_s\) but shifted factors \(\sin ((k-2)\theta )\) and \(\sin ((k+2)\theta )\) is obtained so that
and
From the first values of \(\overline{\varphi }^j_s\), the general following form is assumed for these integrals:
Plugging this expression in the right-hand side of Eq. (33), a similar expression for \(\overline{\varphi }^j_{s+1}\) with \( a_{j+1}= (4j^2 - 2j) a_j \) is obtained. The latter and the expression for \(\overline{\varphi }^1_s\) validate Eq. (34). Finally, \(\overline{\varphi }^j_s\) takes the following form:
The convention for the index s of \(\overline{\varPhi }\) and \(\overline{\varphi }\) leads to symmetric expressions about s and makes the derivation of \(\overline{\varphi }^j_s\) not do difficult. On the contrary, for the derivation of \(\varDelta _{M+2m}\), \(w_{M+2m}\) expressions in Sect. 4, its is more practical to introduce
1.3 Computational Weight Calculations
Among the four methods presented in Sect. 3, those of Subsects. 3.1, 3.2 and 3.3 were used for weight calculation and the values were checked with respect to the theoretical values obtained by Fejér (Eq. (7)) whenever \(\mathcal{S}_n\) and \(\mathcal{F}_n\) are the same.The resolution of a linear system for the weights (Eq. (2)) and the polynomial method (Eq. (13)) appeared to be more prone to numerical errors than the trigonometric polynomial method (Eq. (15)).
The focus was then put on the last method. Eq. (15) was used to calculate the successive trigonometric polynomials of the points already involved in the quadrature starting from Eq. (23) for M=3.
The trigonometric polynomial of a new abscissa in [0, 1], \(\cos (\xi )\), is calculated for the one corresponding to the null abscissa times \((\cos (2 \theta ) + 1 )\) plus a proper renormalisation of the coefficients:
This non-intuitive normalisation is simply the counterpart of:
For this method, the \(\varDelta _n^\alpha \) functions and the weights have been calculated for increasing n. The numerical error was checked (a) for the standard Fejér rule for \(n=7,15,31...\) based on Eqs. (7) and (23); (b) with respect to analytical expressions obtained in Sect. 4. The difference between theoretical coefficients of Fejér up to the 31-point rule and the computed values appeared to be less than \(8.~10^{-14}\) and the residual of the first four equations of the linear system for the weights (exact quadrature of \(0,x^2, x^4, x^6\)) appeared to be less than \(5.~10^{-13}\). The author can provide the calculated weights for odd n from 3 to 31 (not printed here for the sake of conciseness) and/or the program used to calculate them.
1.4 Lebesgue Constants of Sets \(\mathcal{S}_n\)
As an interpolatory rule calculates the exact sum over \([-1,+1]\) of the Lagragian polynomial that interpolates the considered function in its set, it is interesting to check the Lebesgue constants of the sets \(\mathcal{S}_n\) proposed for quadrature. Their values are plotted in Fig. 5. They unfortunately strongly grow between two successive \(2^Q-1\) integers. The lowest values for large sets are \(\Lambda _{2^Q-1}\) that is found numerically to be equal to the cardinal of the set, \(2^Q-1\), and \(\Lambda _{2^Q+1}\) that is found numerically to be close to \(ln ( 2^Q+1) \).
The corresponding Gauss-Lobatto sets \( \mathcal{L}_n = \{-1,1\} \cup \mathcal{S}_{n-2}\) were considered. They do not exhibit significantly better or worse Lebesgue constants.
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Peter, J. (2015). A Fully-Nested Interpolatory Quadrature Based on Fejér’s Second Rule. In: Boissonnat, JD., et al. Curves and Surfaces. Curves and Surfaces 2014. Lecture Notes in Computer Science(), vol 9213. Springer, Cham. https://doi.org/10.1007/978-3-319-22804-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-22804-4_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22803-7
Online ISBN: 978-3-319-22804-4
eBook Packages: Computer ScienceComputer Science (R0)