The importance of finding a powerful numerical solution for the Laplacian matrix A in the Laplace and Poisson partial differential equations is obvious.

The classical conventional numerical procedure for solving the Laplace partial differential equation is based on the discretization of the 1D, 2D, 3D geometric space into n equidistant free nodes and on the use of the finite difference method FDM supplemented by the Dirichlet boundary conditions (vector b) to obtain a system of algebraic equations of order n prime in the matrix form A,

A . U(x,y,z,t) = b

The solution to the above equation is U(x,y,z,t) = A^-1.b which is often quite complicated since the matrix A is singular.

It is worth mentioning that common numerical iteration methods such as Gaussian elimination and Gauss-Seidel methods are complicated and require the use of ready-made algorithms such as those in Matlab or Python..etc .

We assume that there exists another SIMPLE statistical numerical solution expressed by:

A^-1=(I-A)^-1=A^0+A+A+A^2+....+A^N

Where A^0=I and N is the number of iterations or time steps dt.

As simple as that!

More Ismail Abbas's questions See All
Similar questions and discussions