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.

 

A convergent boundary integral method for three-dimensional water waves
HTML articles powered by AMS MathViewer

by J. Thomas Beale PDF
Math. Comp. 70 (2001), 977-1029 Request permission

Abstract:

We design a boundary integral method for time-dependent, three-dimensional, doubly periodic water waves and prove that it converges with $O(h^3)$ accuracy, without restriction on amplitude. The moving surface is represented by grid points which are transported according to a computed velocity. An integral equation arising from potential theory is solved for the normal velocity. A new method is developed for the integration of singular integrals, in which the Green’s function is regularized and an efficient local correction to the trapezoidal rule is computed. The sums replacing the singular integrals are treated as discrete versions of pseudodifferential operators and are shown to have mapping properties like the exact operators. The scheme is designed so that the error is governed by evolution equations which mimic the structure of the original problem, and in this way stability can be assured. The wavelike character of the exact equations of motion depends on the positivity of the operator which assigns to a function on the surface the normal derivative of its harmonic extension; similarly, the stability of the scheme depends on maintaining this property for the discrete operator. With $n$ grid points, the scheme can be implemented with essentially $O(n)$ operations per time step.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 65M12, 76B15, 65D30
  • Retrieve articles in all journals with MSC (2000): 65M12, 76B15, 65D30
Additional Information
  • J. Thomas Beale
  • Affiliation: Department of Mathematics, Duke University, Durham, NC 27708-0320
  • Email: beale@math.duke.edu
  • Received by editor(s): September 9, 1998
  • Received by editor(s) in revised form: June 10, 1999
  • Published electronically: February 17, 2000
  • Additional Notes: The author was supported in part by NSF Grant #DMS-9870091.
  • © Copyright 2000 American Mathematical Society
  • Journal: Math. Comp. 70 (2001), 977-1029
  • MSC (2000): Primary 65M12, 76B15; Secondary 65D30
  • DOI: https://doi.org/10.1090/S0025-5718-00-01218-7
  • MathSciNet review: 1709144