Date of Award

1991

Document Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Mechanical Engineering

First Advisor

Sumanta Acharya

Abstract

This thesis deals with the formulation of a computationally efficient multiple-grid adaptive differencing (MAD) scheme for two-dimensional elliptic flow and heat transfer problems. This algorithm equidistributes a measure of the error by using higher order differencing schemes locally in adaptively determined high error-estimate regions. The third-order accurate QUICK scheme is used in regions of high error estimate which are dynamically flagged on the basis of a preliminary first order upwind solution. Boundary conditions for the flagged regions are taken from the preliminary upwind solution. Multigrid type calculations are performed. Three multiple-grid schemes are developed. In the first scheme, MAD1-WFDS, the entire domain and flagged subdomains are solved at each multiple-grid iteration. The second scheme, MAD2-WDS, solves the entire domain at each iteration, employing the QUICK form of the discretized equations in the flagged regions and the original upwind formulation elsewhere. The third algorithm, MAD3-FDS, is similar to the first, except the entire domain is not solved after the subdomain solution. Instead, only the unflagged portion of the problem domain is solved, using the improved values obtained in the flagged regions as boundary conditions. The three MAD algorithms are applied to two convection-diffusion and two flow problems. The results are compared to the exact solution (if available), the upwind and QUICK solutions, and to each other. MAD1-WFDS shows the best improvement to the upwind scheme but requires the most additional computing time. MAD2-WDS requires the least additional computing time, but shows the least improvement over the upwind solution. The code for MAD1-WFDS is parallelized to reduce the real computation time required for problem solutions. The upwind and QUICK schemes are also parallelized for comparison. Several program levels or granularities were parallelized to determine an optimal level of parallelization. Parallelizing on the subdomain level and parallelizing the solution of the general variable equation yielded good results. A real time savings of 26.4% was achieved in one case (in spite of the fact that the solution was not computed on a dedicated machine) at a cost of a 7.8% increase in cpu time required by the parallel run over the serial run.

Pages

216

Share

COinS