Scribd Logo
Upload

Welcome to Scribd!

  • Numerical Methods For Discretization

    Uploaded by

    Harry Puri
    8 views1 page
    An algorithm to approximate the solution of Laplace's equation by finite difference scheme is to (1) discretize the domain into a grid, (2) express the Laplace operator as a difference quotient using the grid, and (3) iteratively update the potential at interior points using values at neighboring points until the solution converges.

    Original Description:

    Original Title

    numerical methods for discretization.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    An algorithm to approximate the solution of Laplace's equation by finite difference scheme is to (1) discretize the domain into a grid, (2) express the Laplace operator as a difference quotient using the grid, and (3) iteratively update the potential at interior points using values at neighboring points until the solution converges.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    Numerical Methods For Discretization

    Uploaded by

    Harry Puri
    An algorithm to approximate the solution of Laplace's equation by finite difference scheme is to (1) discretize the domain into a grid, (2) express the Laplace operator as a difference quotient using the grid, and (3) iteratively update the potential at interior points using values at neighboring points until the solution converges.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    QUIZ NO.

    8
    Q1. Write down an algorithm to approximate the solution of Laplace equation by finite
    difference scheme.

    You might also like