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.

 

On the SHASTA FCT algorithm for the equation $\partial \rho /\partial \ t+(\partial /\partial x)(v(\rho ) \rho )=0$
HTML articles powered by AMS MathViewer

by Tsutomu Ikeda and Tomoyasu Nakagawa PDF
Math. Comp. 33 (1979), 1157-1169 Request permission

Abstract:

In recent years, Boris, Book and Hain have proposed a family of finite difference methods called FCT techniques for the Cauchy problem of the continuity equation. The purpose of this paper is to study the stability and convergence about the SHASTA FCT algorithm, which is one of the basic schemes among many FCT techniques, though not in its original form but a slightly modified one for our technical reason. (Our numerical experiments indicate less distinction between the algorithm dealt with here and the original SHASTA FCT one in terms of reproduction of sharp discontinuities.) The main results are Theorems 1 and 2 concerning the ${L^\infty }$-stability and the $L_{{\operatorname {loc}}}^1$-convergence, respectively.
References
Similar Articles
Additional Information
  • © Copyright 1979 American Mathematical Society
  • Journal: Math. Comp. 33 (1979), 1157-1169
  • MSC: Primary 65M05; Secondary 35L65, 65M10
  • DOI: https://doi.org/10.1090/S0025-5718-1979-0537963-7
  • MathSciNet review: 537963