Abstract
There has been increased interest in the effect of the ordering of the unknowns on Preconditioned Conjugate Gradient (PCG) methods. A recently proposed Minimum Discarded Fill (MDF) ordering technique is effective in finding goodILU(l) preconditioners, especially for problems arising from unstructured finite element grids. This algorithm can identify anisotropy in complicated physical structures and orders the unknowns in an appropriate direction. TheMDF technique may be viewed as an analogue of the minimum deficiency algorithm in sparse matrix technology, and hence is expensive to compute for high levelILU(l) preconditioners.
In this work, several less expensive variants of theMDF technique are explored to produce cost-effectiveILU preconditioners. The ThresholdMDF ordering combinesMDF ideas with drop tolerance techniques to identify the sparsity pattern in theILU preconditioners. The Minimum Update Matrix (MUM) ordering technique is a simplification of theMDF ordering and is an analogue of the minimum degree algorithm. TheMUM ordering method is especially effective for large matrices arising from Navier-Stokes problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. Axelsson,Solution of Linear Systems of Equations: Iterative Methods, Springer-Verlag, Berlin, Heidelberg, New York, 1977, pp. 2–51.
A. Behie and P. A. Forsyth,Comparison of fast iterative methods for symmetric systems, IMA J. Num. Anal., 3 (1983), pp. 41–63.
T. F. Chan,Analysis of preconditioners for domain decomposition, SIAM J. Num. Anal., 24 (1987).
T. F. Chan and D. C. Resasco,Analysis of domain decomposition preconditioners on irregular regions, inAdvances on Computer Methods for Partial Differential Equations VI, R. Vichnevetsky and R. S. Stepleman, eds., IMACS, 1987, pp. 317–322.
P. Chin, E. F. D'Azevedo, P. A. Forsyth and W.-P. Tang,Iterative methods for solution of full Newton Jacobians in incompressible viscous flow, International Journal on Numerical Methods in Fluids, (1991). (submitted).
E. F. D'Azevedo, P. A. Forsyth and W.-P. Tang,An automatic ordering method for incomplete factorization iterative solvers, in Proceedings of the 1991 Reservoir Simulation Symposium, Anaheim, 1991. Paper SPE 21226.
E. F. D'Azevedo, P. A. Forsyth and W.-P. Tang,Ordering methods for preconditioned conjugate gradient methods applied to unstructured grid problems, SIAM Journal On Matrix Analysis and Applications, (1992). (to appear).
S. Doi,A graph-theory approach for analyzing the effects of ordering on ILU preconditioning, SIAM J. Sci. Statist. Comp. (submitted).
S. Doi and A. Lichnewsky,An ordering theory for incomplete LU factorizations on regular grids, SIAM J. Sci. Statist. Comp. (submitted).
I. S. Duff and G. A. Meurant,The effect of ordering on preconditioned conjugate gradients, BIT, (1989), pp. 635–657.
V. Eijkhout,Analysis of parallel incomplete point factorizations, Tech. Rep. CSRD Report No. 1045, Center for Supercomputing Research and Development, University of Illinois, Urbana, Illinois, 1990.
P. A. Forsyth,A control volume finite element approach to NAPL groundwater contamination, SIAM J. Sci. Statist. Comp., 12 (1991), pp. 1029–1057.
G. Forsythe and W. Wasow,Finite Difference Methods for Partial Differential Equations, Wiley, New York, 1960.
A. George and J. W. H. Liu,Computer Solution of large Sparse Positive-definite Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
A. Greenbaum and G. Rodrigue,Optimal preconditioners of a given sparsity pattern, BIT, 29 (1989), pp. 610–634.
I. Gustafsson,A class of first order factorization methods, BIT, 18 (1978), pp. 142–156.
T. Hughes, I. Levit and J. Winget,An element by element solution algorithm for problems of structural and solid mechanics, Computer Methods in Applied Mechanics and Engineering, 36 (1983), pp. 241–254.
P. S. Huyakorn and G. F. Pinder,Computational Methods in Subsurface Flow, Academic Press, New York, 1983.
D. S. Kershaw,The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations, Journal of Computational Physics, 26 (1978), pp. 43–65.
D. Keyes and W. Gropp,A comparison of domain decomposition techniques for elliptic partial differential equations, SIAM J. Sci. Statist. Comp., 8 (March (1987)), pp. 166–202.
L. Y. Kolotilina and A. Y. Yeremin,On a family of two-level preconditionings of the incomplete block factorization type, Sov. Journal of Numerical Analysis and Mathematical Modelings, 1 (1986), pp. 293–320.
H. P. Langtangen,Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns, International Journal on Numerical Methods in Fluids, 9 (1989), pp. 213–233.
F. W. Letniowski,Three dimensional Delaunay triangulations for finite element approximations to a second order diffusion operator, SIAM J. Sci. Statist. Comp., (accepted) (1989).
H. M. Markowitz,The elimination form of the inverse and its application to linear programming, Management Science, 3 (1957), pp. 255–269.
J. A. Meijerink and H. A. van der Vorst,An iterative solution method for linear systems of which the coefficient matrix is a M-matrix, Mathematics of Computation, 31 (1977), pp. 148–162.
J. A. Meyerink and H. A. van der Vorst,Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems, Journal of Computational Physics, 44 (1981), pp. 134–15.
N. Munksgaard,Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients, ACM Trans. Math. Software, 6 (June 1980), pp. 206–219.
J. M. Ortega,Orderings for conjugate gradient preconditionings, Tech. Rep. TR-90-24, Department of Computer Science, University of Virginia, Charlottesville, Virginia, August 14, 1990.
S. V. Parter,The use of linear graphs in Gaussian elimination, SIAM Review, 3 (1961), pp. 364–369.
S. V. Patankar,Numerical Heat Transfer and Fluid Flow, Hemisphere, New York, 1980.
O. Pironneau,Finite Element Methods for Fluids, John Wiley & Sons, New York, 1989.
D. Rose,A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, inGraph Theory and Computing, R. C. Read, ed., Academic Press, 1972, pp. 183–217.
Y. Saad and M. Schultz,GMRES: a generalized minimal residual algorithm for solving non-symmetric linear systems, SIAM J. Sci. Statist. Comp., 7 (1986), pp. 856–869.
H. L. Stone,Iterative solution of implicit approximations of multidimensional partial differential equations, SIAM J. Num. Anal., 5 (1968), pp. 530–558.
G. Townsend and W.-P. Tang,Matview 1.1—A two dimensional matrix visualization tool, Tech. Rep. CS89-36, Department of Computer Science, University of Waterloo, Waterloo, Ontario, 1989.
H. A. van der Vorst,Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comp., (1991). (to appear).
H. A. van der Vorst and P. Sonneveld,CGSTAB: A more smoothly converging variant of CG-S, Tech. Rep. Report 90-50, Delft University of Technology, Delft, the Netherlands, May 21, 1990.
Z. Zlatev,Use of iterative refinement in the solution of sparse linear systems, SIAM J. Num. Anal., 19 (1982), pp. 381–399.
Author information
Authors and Affiliations
Additional information
This work was supported by the Natural Sciences and Engineering Research Council of Canada, by the Information Technology Research Centre, which is funded by the Province of Ontario, and by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy under contract DE-AC05-84OR21400 with Martin Marietta Energy Systems, Inc., through an appointment to the U.S. Department of Energy Postgraduate Research Program administered by Oak Ridge Associated Universities.
Rights and permissions
About this article
Cite this article
D'Azevedo, E.F., Forsyth, P.A. & Tang, WP. Towards a cost-effective ILU preconditioner with high level fill. BIT 32, 442–463 (1992). https://doi.org/10.1007/BF02074880
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02074880