We introduce a three-dimensional (3D) semi-implicit complementary volume numerical scheme for solving the level set formulation of (Riemannian) mean curvature flow problem. We apply the scheme to seg...
Parachute aerodynamics involves an interaction between the flexible, elastic, porous parachute canopy and the high speed airflow (relative to the parachute) through which the parachute falls. Compute...
You are not logged in to this journal. Log in
A Parallel Multistage ILU Factorization Based on a Hierarchical Graph Decomposition
SIAM J. Sci. Comput. Volume 28, Issue 6, pp. 2266-2293 (January 2006)
Published December 18, 2006
Connotea
CiteULike
del.icio.us
BibSonomy
PHIDAL (parallel hierarchical interface decomposition algorithm) is a parallel incomplete factorization method which exploits a hierarchical interface decomposition of the adjacency graph of the coefficient matrix. The idea of the decomposition is similar to that of the well-known wirebasket techniques used in domain decomposition. However, the method is devised for general, irregularly structured, sparse linear systems. This paper describes a few algorithms for obtaining good quality hierarchical graph decompositions and discusses the parallel implementation of the factorization procedure. Numerical experiments are reported to illustrate the scalability of the algorithm and its effectiveness as a general purpose parallel linear system solver.
©2006 Society for Industrial and Applied Mathematics| History: | Received May 14, 2004; accepted June 14, 2006; published December 18, 2006 |
| Permalink: | http://dx.doi.org/10.1137/040608258 |
KEYWORDS and AMS
PUBLICATION DATA
SIAM