Two variants of minimum discarded fill ordering
- Oak Ridge National Lab., TN (USA)
- Waterloo Univ., ON (Canada). Dept. of Computer Science
It is well known that the ordering of the unknowns can have a significant effect on the convergence of Preconditioned Conjugate Gradient (PCG) methods. There has been considerable experimental work on the effects of ordering for regular finite difference problems. In many cases, good results have been obtained with preconditioners based on diagonal, spiral or natural row orderings. However, for finite element problems having unstructured grids or grids generated by a local refinement approach, it is difficult to define many of the orderings for more regular problems. A recently proposed Minimum Discarded Fill (MDF) ordering technique is effective in finding high quality Incomplete LU (ILU) preconditioners, especially for problems arising from unstructured finite element grids. Testing indicates this algorithm can identify a rather complicated physical structure in an anisotropic problem and orders the unknowns in the preferred'' direction. The MDF technique may be viewed as the numerical analogue of the minimum deficiency algorithm in sparse matrix technology. At any stage of the partial elimination, the MDF technique chooses the next pivot node so as to minimize the amount of discarded fill. In this work, two efficient variants of the MDF technique are explored to produce cost-effective high-order ILU preconditioners. The Threshold MDF orderings combine MDF ideas with drop tolerance techniques to identify the sparsity pattern in the ILU preconditioners. These techniques identify an ordering that encourages fast decay of the entries in the ILU factorization. The Minimum Update Matrix (MUM) ordering technique is a simplification of the MDF ordering and is closely related to the minimum degree algorithm. The MUM ordering is especially for large problems arising from Navier-Stokes problems. Some interesting pictures of the orderings are presented using a visualization tool. 22 refs., 4 figs., 7 tabs.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- Sponsoring Organization:
- CANSERC; DOE/ER; ITRC
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 6137814
- Report Number(s):
- CONF-9104189-1; ON: DE91007852
- Resource Relation:
- Conference: IMACS symposium on iterative methods in linear algebra, Brussels (Belgium), 2-5 Apr 1991
- Country of Publication:
- United States
- Language:
- English
Similar Records
Scalable parallel Newton-Krylov solvers for discontinuous Galerkin discretizations
Improving matrix-vector product performance and multi-level preconditioning for the parallel PCG package