Search

This paper poses a magnetic field problem in cylindrical coordinate for two regions with different permeability for each one. The linear partial differential equation governing this problem is in the form of Laplace and Poisson equation. This problem is then solved using classical Gauss-Seidel Algorithm for the Finite difference (FD) solution of linear partial differential equation. In order to obtain adequate solution for a reasonable number of grid points for the regions under consideration a considerable amount of time will take for the program to converge. The paper presents a different technique known as Weighted Multi-Grid which will speed up the convergence process. In this method, the solution to the differential equation between two grid points for obtaining the initial condition is considered to be linear in nature with different weight for the value of each grid point. This problem is then solved for the minimum number of grid points let’s say one point in each region plus the boundary points. The initial guess for each new point for every level of computation is found as the weighted average of the two adjacent points. It then continues with finding the optimum weighting values for Laplace’s or Poisson’s equation. The main contribution is made by regarding the effect of the optimum initial weighted values of the variable vector in the convergence time for the Gauss-Seidel algorithm. [ABSTRACT FROM AUTHOR]