Generalized Gaussian Quadrature Rules for Systems of Arbitrary Functions

Citations Over TimeTop 10% of 1996 papers

Abstract

A numerical algorithm is presented for the construction of generalized Gaussian quadrature rules, originally introduced by S. Karlin and W. Studden over three decades ago. The quadrature rules to be discussed possess most of the desirable properties of the classical Gaussian integration formulae, such as positivity of the weights, rapid convergence, mathematical elegance, etc. The algorithm is applicable to a wide class of functions, including smooth functions (not necessarily polynomials), as well as functions with end-point singularities, such as those encountered in the solution of integral equations, complex analysis, potential theory, and several other areas. The performance of the algorithm is illustrated with several numerical examples.

Related Papers

• → A note on Gauss—Hermite quadrature(1994)349 cited
• → Anti-Szego quadrature rules(2006)11 cited
• → Gauss–Hermite Quadrature in Marginal Maximum Likelihood Estimation of Item Parameters(2015)2 cited
• → The Algebraic Method in Quadrature for Uncertainty Quantification(2016)1 cited
• → The set of anti-Gaussian quadrature rules for the optimal set of quadrature rules in Borges’ sense(2023)