Skip to main content
Log in

Algorithm 33 Wilf-quadrature

Algorithmus 33. Wilfsche Quadratur

  • Algorithm
  • Published:
Computing Aims and scope Submit manuscript

Abstract

Nodes and weights for Wilf-quadrature formulae with 2 (1) 32 nodes are given to 26 D as well as a FORTRAN program illustrating their use. These formulae are particularly well suited for numerically integrating functions with singularities.

Zusammenfassung

Stützstellen und Gewichte für Wilfsche Quadraturformeln mit 2 (1) 32 Stützstellen werden mit einer Genauigkeit von 26 D angegeben. Ein typisches FORTRAN-Programm illustriert die Implementation solcher Formeln, die sich besonders zur numerischen Integration von Funktionen mit Singularitäten eignen.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Engels, H., Eckhardt, U.: Symmetrische Wilfsche Quadraturformeln. KFA Jülich Research Report, Jül-1094-MA, August 1974.

  2. Engels, H., Eckhardt, U.: The determination of nodes and weights in Wilf quadrature formulas. Abh. Math. Sem. Univ. Hamburg (to appear).

  3. Wilf, H. S.: Exactness conditions in numerical quadrature. Numer. Math.6, 315–319 (1964).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Engels, H., Eckhardt, U. Algorithm 33 Wilf-quadrature. Computing 18, 271–279 (1977). https://doi.org/10.1007/BF02253214

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02253214

Keywords

Navigation