Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Numerical construction of Gaussian quadrature formulas for $\int _{0}^{1}(-\textrm {Log}\ x)\cdot x^{\alpha }\cdot f(x)\cdot dx$ and $\int _{0}^{\infty } E_{m}(x)\cdot f(x)\cdot dx$
HTML articles powered by AMS MathViewer

by Bernard Danloy PDF
Math. Comp. 27 (1973), 861-869 Request permission

Abstract:

Most nonclassical Gaussian quadrature rules are difficult to construct because of the loss of significant digits during the generation of the associated orthogonal polynomials. But, in some particular cases, it is possible to develop stable algorithms. This is true for at least two well-known integrals, namely \[ \int _0^1 { - ({\operatorname {Log}}\;x) \cdot {x^\alpha } \cdot f(x) \cdot dx\quad {\text {and}}\quad \int _0^\infty {{E_m}(x) \cdot f(x) \cdot } dx.} \] A new approach is presented, which makes use of known classical Gaussian quadratures and is remarkably well-conditioned since the generation of the orthogonal polynomials requires only the computation of discrete sums of positive quantities. Finally, some numerical results are given.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65D30
  • Retrieve articles in all journals with MSC: 65D30
Additional Information
  • © Copyright 1973 American Mathematical Society
  • Journal: Math. Comp. 27 (1973), 861-869
  • MSC: Primary 65D30
  • DOI: https://doi.org/10.1090/S0025-5718-1973-0331730-X
  • MathSciNet review: 0331730