SINC-GALERKIN METHOD FOR NUMERICAL SOLUTION OF THE BRATU’S PROBLEM

This paper presents a study of the performance of the Galerkin method using sinc basis functions for solving Bratu’s problem.The current approach converges to the exact solution rapidly, with order, O(exp (¡c p n)) accuracy, where c is independent of n. By considering the maximum absolute errors in the solution at sinc grid points and tabulated in tables for different choices of step size we justify the convergence practically too.