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.

 

Generalized finite-difference schemes
HTML articles powered by AMS MathViewer

by Blair Swartz and Burton Wendroff PDF
Math. Comp. 23 (1969), 37-49 Request permission

Abstract:

Finite-difference schemes for initial boundary-value problems for partial differential equations lead to systems of equations which must be solved at each time step. Other methods also lead to systems of equations. We call a method a generalized finite-difference scheme if the matrix of coefficients of the system is sparse. Galerkin’s method, using a local basis, provides unconditionally stable, implicit generalized finite-difference schemes for a large class of linear and nonlinear problems. The equations can be generated by computer program. The schemes will, in general, be not more efficient than standard finite-difference schemes when such standard stable schemes exist. We exhibit a generalized finite-difference scheme for Burgers’ equation and solve it with a step function for initial data.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65.65
  • Retrieve articles in all journals with MSC: 65.65
Additional Information
  • © Copyright 1969 American Mathematical Society
  • Journal: Math. Comp. 23 (1969), 37-49
  • MSC: Primary 65.65
  • DOI: https://doi.org/10.1090/S0025-5718-1969-0239768-7
  • MathSciNet review: 0239768