Parallel hierarchical solvers and preconditioners for boundary element methods

  • Authors:

  • Ananth Grama;Vipin Kumar;Ahmed Sameh

  • Affiliations:

  • Department of Computer Science, 4-192, EE/CSci Building, 200 Union St. S. E., University of Minnesota, Minneapolis, MN;Department of Computer Science, 4-192, EE/CSci Building, 200 Union St. S. E., University of Minnesota, Minneapolis, MN;Department of Computer Science, 4-192, EE/CSci Building, 200 Union St. S. E., University of Minnesota, Minneapolis, MN

  • Venue:
  • Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

The method of moments is an important tool for solving boundary integral equations arising in a variety of applications. It transforms the physical problem into a dense linear system. Due to the large number of variables and the associated computational requirements, these systems are solved iteratively using methods such as GMRES, CG and its variants. The core operation of thes itertive solvers is the application of the system matrix to a vector. This requres O(n2) operations and memory using accurate dense methods. The computational complexity can be reduced to O(n log n) and the memory requirement to O(n) using hierarchical approximation techniques. The algorithmic speedup from approximation can be combined with parallelism to yield very fast dense solvers. In this paper, we present efficient parallel formulations of dense iterative solvers based on hierarchical approximations for solving the integral form of Laplace equation. We study the impact of various parameters on the accuracy and performance of the parallel solver. We present two preconditioning techniques for accelerating the convergence of the iterative solver. Thes techniques are based on an inner-outer scheme and a block diagonal scheme based on a truncated Green's function. We present detailed experimental results on up to 256 processors of a Cray T3D.