CPDS3, Coupled 3-D Partial Differential Equation Solution

1 - Description of program or function: CPDES3 solves the linear asymmetric matrix equations arising from coupled partial differential equations in three dimensions. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximation employed. CPDES3 allows each spatial operator to have 7, 15, 19, or 27 point stencils, permits general couplings between all of the component PDE's, and automatically generates the matrix structures needed to perform the algorithm. 2 - Method of solution: The resulting sparse matrix equation with a complicated sub-band structure and generally asymmetric is solved by either the preconditioned conjugate gradient (CG) method or the preconditioned bi-conjugate gradient (BCG) algorithm. BCG enjoys faster convergence in most cases but in rare instances diverges. Then, CG iterations must be used. 3 - Restrictions on the complexity of the problem: The discretization of the coupled three-dimensional PDE's and their boundary conditions must result in an operator stencil which fits in the Cray2 memory. In addition, the matrix must possess a reasonable amount of diagonal dominance for the preconditioning technique to be effective