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.


The discrete Galerkin method for integral equations
HTML articles powered by AMS MathViewer

by Kendall Atkinson and Alex Bogomolny PDF
Math. Comp. 48 (1987), 595-616 Request permission


A general theory is given for discretized versions of the Galerkin method for solving Fredholm integral equations of the second kind. The discretized Galerkin method is obtained from using numerical integration to evaluate the integrals occurring in the Galerkin method. The theoretical framework that is given parallels that of the regular Galerkin method, including the error analysis of the superconvergence of the iterated Galerkin and discrete Galerkin solutions. In some cases, the iterated discrete Galerkin solution is shown to coincide with the Nyström solution with the same numerical integration method. The paper concludes with applications to finite element Galerkin methods.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65R20
  • Retrieve articles in all journals with MSC: 65R20
Additional Information
  • © Copyright 1987 American Mathematical Society
  • Journal: Math. Comp. 48 (1987), 595-616
  • MSC: Primary 65R20
  • DOI:
  • MathSciNet review: 878693