Analysis of Various Fixed Point Iterative Schemes and Their Convergence

Abstract

Fixed point iterative processes are used to find the solutions of various functions or equations newlinederived from many physical problems. In computational mathematics, to identify the newlineiteration processes which converges more efficiently with a reduced complexity (or minimum newlineerror) to the required solution is of great considerable importance. Many researchers are newlineinvolved in designing the fixed point procedures which estimate the empirical solutions of newlinethe given problems with more accurate form. It is very essential to ensure that a fixed-point newlineiteration process converges consistently while constructing it. After that the efficiency of the newlinerate of convergence of that iterative procedure is needed to be investigated. In the present newlineresearch work, we discuss about the speed of convergence of various fixed point iterative newlineprocesses and many applications of these processes. The study is motivated from the research newlinedone by leading researchers and their subsequent contributions in the real-world newlineapplications. The present thesis consists of nine chapters in all. newline