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.

 

Graded-mesh difference schemes for singularly perturbed two-point boundary value problems
HTML articles powered by AMS MathViewer

by Eugene C. Gartland PDF
Math. Comp. 51 (1988), 631-657 Request permission

Abstract:

This paper is concerned with the numerical approximation by compact finite-difference schemes of differential operators of the form ${L_\varepsilon }u = \varepsilon {u^{(m)}} + \Sigma _{\nu = 0}^{m - 1}{a_\nu }{u^{(\nu )}}$ without turning points. The stability of ${L_\varepsilon }$ combined with various auxiliary conditions is discussed, and a representation result for solutions of problems involving it is proven. This representation decomposes the solution into a smooth outer component plus a decaying exponential layer term along the lines of the Method of Multiple Scales. The stability of compact difference analogues of ${L_\varepsilon }$ is studied, and a stability result is proven which generalizes earlier work. This result encompasses, for example, discretizations of second-order problems that fail to possess a maximum principle. It allows for standard polynomial-based differences in outer regions (away from boundary layers) with uniform meshes, even though such schemes admit oscillatory solutions. A family of finite-difference schemes based on an exponentially graded mesh and local polynomial basis functions is discussed. These schemes can be constructed to have arbitrarily high uniform order of convergence. To achieve a scheme of order $O({h^K})$, roughly K times as many points are distributed inside the layer as outside. The high order is achieved by using extra local evaluations of the coefficient functions and source term of the problem. A rigorous discretization error analysis of these schemes, using the established stability and representation results, is given. Numerical results exhibiting the performance of these schemes are presented and generalizations of the results in the paper are discussed.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65L10, 34E15
  • Retrieve articles in all journals with MSC: 65L10, 34E15
Additional Information
  • © Copyright 1988 American Mathematical Society
  • Journal: Math. Comp. 51 (1988), 631-657
  • MSC: Primary 65L10; Secondary 34E15
  • DOI: https://doi.org/10.1090/S0025-5718-1988-0935072-1
  • MathSciNet review: 935072