Mateescu, Gabriel2014-03-142014-03-141998-12-14etd-011999-204811http://hdl.handle.net/10919/26014Accelerating the convergence rate of Krylov subspace methods with parallelizable preconditioners is essential for obtaining effective iterative solvers for very large linear systems of equations. Substructuring provides a framework for constructing robust and parallel preconditioners for linear systems arising from the discretization of boundary value problems. Although collocation is a very general and effective discretization technique for many PDE problems, there has been relatively little work on preconditioners for collocation problems. This thesis proposes two preconditioning methods for solving linear systems of equations arising from Hermite bicubic collocation discretization of elliptic partial differential equations on square domains with mixed boundary conditions. The first method, called <i>edge preconditioning</i>, is based on a decomposition of the domain in parallel strips, and the second, called <i>edge-vertex preconditioning</i>, is based on a two-dimensional decomposition. The preconditioners are derived in terms of two special rectangular grids -- a coarse grid with diameter <i>H</i> and a hybrid coarse/fine grid -- which together with the fine grid of diameter <i>h</i> provide the framework for approximating the interface problem induced by substructuring. We show that the proposed methods are effective for nonsymmetric indefinite problems, both from the point of view of the cost per iteration and of the number of iterations. For an appropriate choice of <i>H</i>, the edge preconditioner requires <i>O(N)</i> arithmetic operations per iteration, while the edge-vertex preconditioner requires <i>O(N^4/3)</i> operations, where <i>N</i> is the number of unknowns. For the edge-vertex preconditioner, the number of iterations is almost constant when <i>h</i> and <i>H</i> decrease such that <i>H/h</i> is held constant and it increases very slowly with <i>H</i> when <i>h</i> is held constant. For both the edge- and edge-vertex preconditioners the number of iterations depends only weakly on <i>h</i> when <i>H</i> is constant. The edge-vertex preconditioner outperforms the edge-preconditioner for small enough <i>H</i>. Numerical experiments illustrate the parallel efficiency of the preconditioners which is similar or even better than that provided by the well-known PETSc parallel software library for scientific computing.In CopyrightInterface PreconditionersGMRESSchur ComplementCollocationDissertationhttp://scholar.lib.vt.edu/theses/available/etd-011999-204811/