Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 24 - Finite Difference Methods for Elliptic Problems

  • from Part V - Boundary and Initial Boundary Value Problems
  • Abner J. Salgado, University of Tennessee, Knoxville, Steven M. Wise, University of Tennessee, Knoxville
  • Book:
    Classical Numerical Analysis
    Published online:
    29 September 2022
    Print publication:
    20 October 2022, pp 664-699

  • Summary

    This chapter studies finite difference methods for elliptic problems. It begins with a rather lengthy and general discussion of grid domains, grid functions, finite difference operators, and their consistency. We then introduce the notion of stability of a finite difference scheme and Lax’s principle: a consistent and stable scheme is convergent. Then we apply all these notions to elliptic operators in one and two dimensions, with the main focus being the Laplacian. We show the discrete maximum principle, energy arguments and how these can be used to attain stability and convergence in various norms. For more general operators we introduce the notions of homogeneous schemes and upwinding. For operators in divergence form we provide an analysis via energy arguments. For non divergence form operators we analyze the monotonicity and comparison principles of the arising schemes.