Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Runge-Kutta Methods and Local Uniform Grid Refinement

R. A. Trompert and J. G. Verwer
Mathematics of Computation
Vol. 60, No. 202 (Apr., 1993), pp. 591-616
DOI: 10.2307/2153104
Stable URL: http://www.jstor.org/stable/2153104
Page Count: 26
  • Read Online (Free)
  • Download ($34.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Runge-Kutta Methods and Local Uniform Grid Refinement
Preview not available

Abstract

Local uniform grid refinement (LUGR) is an adaptive grid technique for computing solutions of partial differential equations possessing sharp spatial transitions. Using nested, finer-and-finer uniform subgrids, the LUGR technique refines the space grid locally around these transitions, so as to avoid discretization on a very fine grid covering the entire physical domain. This paper examines the LUGR technique for time-dependent problems when combined with static regridding. Static regridding means that in the course of the time evolution, the space grid is adapted at discrete times. The present paper considers the general class of Runge-Kutta methods for the numerical time integration. Following the method of lines approach, we develop a mathematical framework for the general Runge-Kutta LUGR method applied to multispace-dimensional problems. We hereby focus on parabolic problems, but a considerable part of the examination applies to hyperbolic problems as well. Much attention is paid to the local error analysis. The central issue here is a "refinement condition" which is to underly the refinement strategy. By obeying this condition, spatial interpolation errors are controlled in a manner that the spatial accuracy obtained is comparable to the spatial accuracy on the finest grid if this grid would be used without any adaptation. A diagonally implicit Runge-Kutta method is discussed for illustration purposes, both theoretically and numerically.

Page Thumbnails

  • Thumbnail: Page 
591
    591
  • Thumbnail: Page 
592
    592
  • Thumbnail: Page 
593
    593
  • Thumbnail: Page 
594
    594
  • Thumbnail: Page 
595
    595
  • Thumbnail: Page 
596
    596
  • Thumbnail: Page 
597
    597
  • Thumbnail: Page 
598
    598
  • Thumbnail: Page 
599
    599
  • Thumbnail: Page 
600
    600
  • Thumbnail: Page 
601
    601
  • Thumbnail: Page 
602
    602
  • Thumbnail: Page 
603
    603
  • Thumbnail: Page 
604
    604
  • Thumbnail: Page 
605
    605
  • Thumbnail: Page 
606
    606
  • Thumbnail: Page 
607
    607
  • Thumbnail: Page 
608
    608
  • Thumbnail: Page 
609
    609
  • Thumbnail: Page 
610
    610
  • Thumbnail: Page 
611
    611
  • Thumbnail: Page 
612
    612
  • Thumbnail: Page 
613
    613
  • Thumbnail: Page 
614
    614
  • Thumbnail: Page 
615
    615
  • Thumbnail: Page 
616
    616