Finite difference approximation of the Laplacian in $mathbbR^N$ Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)norm for estimating the error of the numerical methodReference for Finite Difference SchemesFinite Difference without boundary conditionsFinite Difference Methods for arbitrary elliptic PDEBoundary Conditions for a Finite Difference Approximation of a Sixth DerivativeDiscretization of the Anisotropic Diffusion Operator for Finite Difference MethodExample of forward difference approaching derivative only up to $O(h)$Finite Difference Boundary Conditionshow to calculate the derivative of a discrete LaplacianCoarse grid correction

Releasing Patch File for BSD3 Licensed Project

Can gravitational waves pass through a black hole?

Putting class ranking in CV, but against dept guidelines

Order between one to one functions and their inverses

3D Masyu - A Die

2018 MacBook Pro won't let me install macOS High Sierra 10.13 from USB installer

Was the pager message from Nick Fury to Captain Marvel unnecessary?

Why are current probes so expensive?

Should man-made satellites feature an intelligent inverted "cow catcher"?

NIntegrate on a solution of a matrix ODE

Can haste grant me and my beast master companion extra attacks?

What is a more techy Technical Writer job title that isn't cutesy or confusing?

What is the proper term for etching or digging of wall to hide conduit of cables

By what mechanism was the 2017 UK General Election called?

Is there a verb for listening stealthily?

Random body shuffle every night—can we still function?

Inverse square law not accurate for non-point masses?

newbie Q : How to read an output file in one command line

What does 丫 mean? 丫是什么意思?

How to evaluate this function?

How does TikZ render an arc?

New Order #6: Easter Egg

Can two people see the same photon?

The Nth Gryphon Number



Finite difference approximation of the Laplacian in $mathbbR^N$



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)norm for estimating the error of the numerical methodReference for Finite Difference SchemesFinite Difference without boundary conditionsFinite Difference Methods for arbitrary elliptic PDEBoundary Conditions for a Finite Difference Approximation of a Sixth DerivativeDiscretization of the Anisotropic Diffusion Operator for Finite Difference MethodExample of forward difference approaching derivative only up to $O(h)$Finite Difference Boundary Conditionshow to calculate the derivative of a discrete LaplacianCoarse grid correction










0












$begingroup$


What is the discrete (finite difference) Laplacian operator $Delta_h$ in $mathbbR^N$? What is the corresponding matrix $A_h$ such that
$Delta_h f = A_h cdot f$?



On Wikipedia and on most textbooks only one or two-dimensional case is considered:
$$Delta_h f(x,y)approx frac f(x-h,y)+f(x+h,y)+f(x,y-h)+f(x,y+h)-4f(x,y)h^2.$$










share|cite|improve this question











$endgroup$
















    0












    $begingroup$


    What is the discrete (finite difference) Laplacian operator $Delta_h$ in $mathbbR^N$? What is the corresponding matrix $A_h$ such that
    $Delta_h f = A_h cdot f$?



    On Wikipedia and on most textbooks only one or two-dimensional case is considered:
    $$Delta_h f(x,y)approx frac f(x-h,y)+f(x+h,y)+f(x,y-h)+f(x,y+h)-4f(x,y)h^2.$$










    share|cite|improve this question











    $endgroup$














      0












      0








      0





      $begingroup$


      What is the discrete (finite difference) Laplacian operator $Delta_h$ in $mathbbR^N$? What is the corresponding matrix $A_h$ such that
      $Delta_h f = A_h cdot f$?



      On Wikipedia and on most textbooks only one or two-dimensional case is considered:
      $$Delta_h f(x,y)approx frac f(x-h,y)+f(x+h,y)+f(x,y-h)+f(x,y+h)-4f(x,y)h^2.$$










      share|cite|improve this question











      $endgroup$




      What is the discrete (finite difference) Laplacian operator $Delta_h$ in $mathbbR^N$? What is the corresponding matrix $A_h$ such that
      $Delta_h f = A_h cdot f$?



      On Wikipedia and on most textbooks only one or two-dimensional case is considered:
      $$Delta_h f(x,y)approx frac f(x-h,y)+f(x+h,y)+f(x,y-h)+f(x,y+h)-4f(x,y)h^2.$$







      calculus pde numerical-methods numerical-linear-algebra






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Apr 2 at 19:39







      Rene

















      asked Apr 2 at 14:54









      ReneRene

      1012




      1012




















          2 Answers
          2






          active

          oldest

          votes


















          0












          $begingroup$

          In one dimension we have the approximation for the second derivative:



          $$f^(2)(x)approx fracf(x+h) + f(x-h) + 2h^2$$



          This then gives you the approximation for the second partial derivative in some particular direction, the Laplacian is the sum of the second derivatives w.r.t. all the coordinates.






          share|cite|improve this answer









          $endgroup$




















            0












            $begingroup$

            There are many different possible finite difference approximations of many different orders of accuracy. In numerical methods a common choice is to use ''centered in space:''
            $$f(x+h) = f(x) + f'(x)h + f''(x)frach^22 + f'''(x)frach^36 + f''''(x)frach^424$$



            $$f(x-h) = f(x) - f'(x)h + f''(x)frach^22- f'''(x)frach^36+f''''(x)frach^424$$



            $$Longrightarrowfracf(x+h) + f(x-h) - 2f(x)h^2= f''(x) + f''''(xi)frach^212 $$
            $$Longrightarrow f''(x) = fracf(x+h) + f(x-h) - 2f(x)h^2 + mathcalO(h^2)$$



            This will correspond to a differentiation matrix:
            $$D_+-xf(x) =
            frac1h^2beginpmatrix
            &-2 & 1& &\
            &1 &ddots &ddots & \
            & &ddots & ddots & 1 \
            & & & 1 & -2
            endpmatrixbeginpmatrixf_1(x) \ f_2(x) \ vdots \ f_n-1(x) \ f_k(x) endpmatrix$$

            where $k$ is total number of grid points used



            what you are looking at is the analogous idea for a 2 variable function



            In general, the formula for $f(x_1,dots,x_n)$ will be:



            $$nabla f = sum_j=1^n fracpartial^2 fdx_j^2 = left(sum_j=1^n D_+-x_jright)f +mathcalO(h^2)$$ (assuming you use the same grid spacing for each variable)






            share|cite|improve this answer











            $endgroup$













              Your Answer








              StackExchange.ready(function()
              var channelOptions =
              tags: "".split(" "),
              id: "69"
              ;
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function()
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled)
              StackExchange.using("snippets", function()
              createEditor();
              );

              else
              createEditor();

              );

              function createEditor()
              StackExchange.prepareEditor(
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: true,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: 10,
              bindNavPrevention: true,
              postfix: "",
              imageUploader:
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              ,
              noCode: true, onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              );



              );













              draft saved

              draft discarded


















              StackExchange.ready(
              function ()
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3171951%2ffinite-difference-approximation-of-the-laplacian-in-mathbbrn%23new-answer', 'question_page');

              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              0












              $begingroup$

              In one dimension we have the approximation for the second derivative:



              $$f^(2)(x)approx fracf(x+h) + f(x-h) + 2h^2$$



              This then gives you the approximation for the second partial derivative in some particular direction, the Laplacian is the sum of the second derivatives w.r.t. all the coordinates.






              share|cite|improve this answer









              $endgroup$

















                0












                $begingroup$

                In one dimension we have the approximation for the second derivative:



                $$f^(2)(x)approx fracf(x+h) + f(x-h) + 2h^2$$



                This then gives you the approximation for the second partial derivative in some particular direction, the Laplacian is the sum of the second derivatives w.r.t. all the coordinates.






                share|cite|improve this answer









                $endgroup$















                  0












                  0








                  0





                  $begingroup$

                  In one dimension we have the approximation for the second derivative:



                  $$f^(2)(x)approx fracf(x+h) + f(x-h) + 2h^2$$



                  This then gives you the approximation for the second partial derivative in some particular direction, the Laplacian is the sum of the second derivatives w.r.t. all the coordinates.






                  share|cite|improve this answer









                  $endgroup$



                  In one dimension we have the approximation for the second derivative:



                  $$f^(2)(x)approx fracf(x+h) + f(x-h) + 2h^2$$



                  This then gives you the approximation for the second partial derivative in some particular direction, the Laplacian is the sum of the second derivatives w.r.t. all the coordinates.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Apr 3 at 3:08









                  Count IblisCount Iblis

                  8,62221534




                  8,62221534





















                      0












                      $begingroup$

                      There are many different possible finite difference approximations of many different orders of accuracy. In numerical methods a common choice is to use ''centered in space:''
                      $$f(x+h) = f(x) + f'(x)h + f''(x)frach^22 + f'''(x)frach^36 + f''''(x)frach^424$$



                      $$f(x-h) = f(x) - f'(x)h + f''(x)frach^22- f'''(x)frach^36+f''''(x)frach^424$$



                      $$Longrightarrowfracf(x+h) + f(x-h) - 2f(x)h^2= f''(x) + f''''(xi)frach^212 $$
                      $$Longrightarrow f''(x) = fracf(x+h) + f(x-h) - 2f(x)h^2 + mathcalO(h^2)$$



                      This will correspond to a differentiation matrix:
                      $$D_+-xf(x) =
                      frac1h^2beginpmatrix
                      &-2 & 1& &\
                      &1 &ddots &ddots & \
                      & &ddots & ddots & 1 \
                      & & & 1 & -2
                      endpmatrixbeginpmatrixf_1(x) \ f_2(x) \ vdots \ f_n-1(x) \ f_k(x) endpmatrix$$

                      where $k$ is total number of grid points used



                      what you are looking at is the analogous idea for a 2 variable function



                      In general, the formula for $f(x_1,dots,x_n)$ will be:



                      $$nabla f = sum_j=1^n fracpartial^2 fdx_j^2 = left(sum_j=1^n D_+-x_jright)f +mathcalO(h^2)$$ (assuming you use the same grid spacing for each variable)






                      share|cite|improve this answer











                      $endgroup$

















                        0












                        $begingroup$

                        There are many different possible finite difference approximations of many different orders of accuracy. In numerical methods a common choice is to use ''centered in space:''
                        $$f(x+h) = f(x) + f'(x)h + f''(x)frach^22 + f'''(x)frach^36 + f''''(x)frach^424$$



                        $$f(x-h) = f(x) - f'(x)h + f''(x)frach^22- f'''(x)frach^36+f''''(x)frach^424$$



                        $$Longrightarrowfracf(x+h) + f(x-h) - 2f(x)h^2= f''(x) + f''''(xi)frach^212 $$
                        $$Longrightarrow f''(x) = fracf(x+h) + f(x-h) - 2f(x)h^2 + mathcalO(h^2)$$



                        This will correspond to a differentiation matrix:
                        $$D_+-xf(x) =
                        frac1h^2beginpmatrix
                        &-2 & 1& &\
                        &1 &ddots &ddots & \
                        & &ddots & ddots & 1 \
                        & & & 1 & -2
                        endpmatrixbeginpmatrixf_1(x) \ f_2(x) \ vdots \ f_n-1(x) \ f_k(x) endpmatrix$$

                        where $k$ is total number of grid points used



                        what you are looking at is the analogous idea for a 2 variable function



                        In general, the formula for $f(x_1,dots,x_n)$ will be:



                        $$nabla f = sum_j=1^n fracpartial^2 fdx_j^2 = left(sum_j=1^n D_+-x_jright)f +mathcalO(h^2)$$ (assuming you use the same grid spacing for each variable)






                        share|cite|improve this answer











                        $endgroup$















                          0












                          0








                          0





                          $begingroup$

                          There are many different possible finite difference approximations of many different orders of accuracy. In numerical methods a common choice is to use ''centered in space:''
                          $$f(x+h) = f(x) + f'(x)h + f''(x)frach^22 + f'''(x)frach^36 + f''''(x)frach^424$$



                          $$f(x-h) = f(x) - f'(x)h + f''(x)frach^22- f'''(x)frach^36+f''''(x)frach^424$$



                          $$Longrightarrowfracf(x+h) + f(x-h) - 2f(x)h^2= f''(x) + f''''(xi)frach^212 $$
                          $$Longrightarrow f''(x) = fracf(x+h) + f(x-h) - 2f(x)h^2 + mathcalO(h^2)$$



                          This will correspond to a differentiation matrix:
                          $$D_+-xf(x) =
                          frac1h^2beginpmatrix
                          &-2 & 1& &\
                          &1 &ddots &ddots & \
                          & &ddots & ddots & 1 \
                          & & & 1 & -2
                          endpmatrixbeginpmatrixf_1(x) \ f_2(x) \ vdots \ f_n-1(x) \ f_k(x) endpmatrix$$

                          where $k$ is total number of grid points used



                          what you are looking at is the analogous idea for a 2 variable function



                          In general, the formula for $f(x_1,dots,x_n)$ will be:



                          $$nabla f = sum_j=1^n fracpartial^2 fdx_j^2 = left(sum_j=1^n D_+-x_jright)f +mathcalO(h^2)$$ (assuming you use the same grid spacing for each variable)






                          share|cite|improve this answer











                          $endgroup$



                          There are many different possible finite difference approximations of many different orders of accuracy. In numerical methods a common choice is to use ''centered in space:''
                          $$f(x+h) = f(x) + f'(x)h + f''(x)frach^22 + f'''(x)frach^36 + f''''(x)frach^424$$



                          $$f(x-h) = f(x) - f'(x)h + f''(x)frach^22- f'''(x)frach^36+f''''(x)frach^424$$



                          $$Longrightarrowfracf(x+h) + f(x-h) - 2f(x)h^2= f''(x) + f''''(xi)frach^212 $$
                          $$Longrightarrow f''(x) = fracf(x+h) + f(x-h) - 2f(x)h^2 + mathcalO(h^2)$$



                          This will correspond to a differentiation matrix:
                          $$D_+-xf(x) =
                          frac1h^2beginpmatrix
                          &-2 & 1& &\
                          &1 &ddots &ddots & \
                          & &ddots & ddots & 1 \
                          & & & 1 & -2
                          endpmatrixbeginpmatrixf_1(x) \ f_2(x) \ vdots \ f_n-1(x) \ f_k(x) endpmatrix$$

                          where $k$ is total number of grid points used



                          what you are looking at is the analogous idea for a 2 variable function



                          In general, the formula for $f(x_1,dots,x_n)$ will be:



                          $$nabla f = sum_j=1^n fracpartial^2 fdx_j^2 = left(sum_j=1^n D_+-x_jright)f +mathcalO(h^2)$$ (assuming you use the same grid spacing for each variable)







                          share|cite|improve this answer














                          share|cite|improve this answer



                          share|cite|improve this answer








                          edited Apr 5 at 13:39

























                          answered Apr 4 at 5:06









                          GeauxMathGeauxMath

                          1114




                          1114



























                              draft saved

                              draft discarded
















































                              Thanks for contributing an answer to Mathematics Stack Exchange!


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid


                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.

                              Use MathJax to format equations. MathJax reference.


                              To learn more, see our tips on writing great answers.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function ()
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3171951%2ffinite-difference-approximation-of-the-laplacian-in-mathbbrn%23new-answer', 'question_page');

                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              Popular posts from this blog

                              Boston (Lincolnshire) Stedsbyld | Berne yn Boston | NavigaasjemenuBoston Borough CouncilBoston, Lincolnshire

                              Trouble understanding the speech of overseas colleaguesHow can I better understand manager or clients with strong accents?Adding more movement and speech at the fundamental level to a highly-sedentary job?Difficulty in understanding Manager's accent(language and communication)How to adjust yourself where your colleagues are not understanding to you?Understanding manager's expectationsForeigner and colleagues using slangHaving difficulty understanding meetingsHow do you breathe when giving a speech?Trouble Waking Up for Emergencies (On-Call)Problems with colleaguesColleagues feeling insecure when I do my work

                              Ballerup Komuun Stääden an saarpen | Futnuuten | Luke uk diar | Nawigatsjuunwww.ballerup.dkwww.statistikbanken.dk: Tabelle BEF44 (Folketal pr. 1. januar fordelt på byer)Commonskategorii: Ballerup Komuun55° 44′ N, 12° 22′ O