
doi: 10.1137/0733048
The authors present a numerical algorithm for the construction of generalized Gaussian quadrature rules for a Chebyshev system on the interval \([a,b]\), originally introduced by \textit{S. Karlin} and \textit{W. J. Studden} [Tchebycheff systems: With applications in analysis and statistics (1966; Zbl 0153.38902)]. This algorithm is extended to functions with end-point singularities. The performance of the algorithm is demonstrated with several numerical examples.
numerical examples, algorithm, end-point singularities, Gaussian quadrature rules, Chebyshev system, Numerical quadrature and cubature formulas, Approximate quadratures
numerical examples, algorithm, end-point singularities, Gaussian quadrature rules, Chebyshev system, Numerical quadrature and cubature formulas, Approximate quadratures
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 221 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 1% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
