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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
