Abstract
In this paper, finite difference and finite element methods are used with nonlinear SOR to solve the problems of minimizing strict convex functionals. The functionals are discretized by both methods and some numerical quadrature formula. The convergence of such discretization is guaranteed and will be discussed. As for the convergence of the iterative process, it is necessary to vary the relaxation parameter in each iterations. In addition, for the model catenoid problem, boundary grid refinements play an essential role in the proposed nonlinear SOR algorithm. Numerical results which illustrate the importance of the grid refinements will be presented. *Deceased.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have