In this expository work we shall conduct a survey of iterative techniques for solving the linear operator equations Ax=y in a Hilbert space. Whenever convenient these iterative schemes are given in the context of a complex Hilbert space -- Chapter II is devoted to those methods (three in all) which are given only for real Hilbert space. Thus chapter III covers those methods which are valid in a complex Hilbert space except for the two methods which are singled out for special attention in the last two chapters. Specifically, the method of successive approximations is covered in Chapter IV, and Chapter V consists of a discussion of gradient methods. While examining these techniques, our primary concern will be with the convergence of the sequence of approximate solutions. However, we shall often look at estimates of the error and the speed of convergence of a method.

Mathematics of Computing -- General.

This thesis focuses on iterative methods for the treatment of the steady state neutron transport equation in slab geometry, bounded convex domain of Rn (n = 2,3) and in 1-D spherical geometry. We introduce a generic Alternate Direction Implicit (ADI)-like iterative method based on positive definite and m-accretive splitting (PAS) for linear operator equations with operators admitting such splitting. This method converges unconditionally and its SOR acceleration yields convergence results similar to those obtained in presence of finite dimensional systems with matrices possessing the Young property A. The proposed methods are illustrated by a numerical example in which an integro-differential problem of transport theory is considered. In the particular case where the positive definite part of the linear equation operator is self-adjoint, an upper bound for the contraction factor of the iterative method, which depends solely on the spectrum of the self-adjoint part is derived. As such, this method has been successfully applied to the neutron transport equation in slab and 2-D cartesian geometry and in 1-D spherical geometry. The self-adjoint and m-accretive splitting leads to a fixed point problem where the operator is a 2 by 2 matrix of operators. An infinite dimensional adaptation of minimal residual and preconditioned minimal residual algorithms using Gauss-Seidel, symmetric Gauss-Seidel and polynomial preconditioning are then applied to solve the matrix operator equation. Theoretical analysis shows that the methods converge unconditionally and upper bounds of the rate of residual decreasing which depend solely on the spectrum of the self-adjoint part of the operator are derived. The convergence of theses solvers is illustrated numerically on a sample neutron transport problem in 2-D geometry. Various test cases, including pure scattering and optically thick domains are considered.