Abstract
The scalability and robustness of a class of non-overlapping domain decomposition preconditioners using 2-way nested dissection reordering is studied. In particular, three methods are considered: a nested symmetric successive over-relaxation (NSSOR), a nested version of modified ILU with rowsum constraint (NMILUR), and nested filtering factorization (NFF). The NMILUR preconditioner satisfies the rowsum property i.e., a right filtering condition on the vector (1, …, 1)T. The NFF method is more general in the sense that it satisfies right filtering condition on any given vector. There is a subtle difference between NMILUR and NFF, but NFF is much more robust and converges faster than NSSOR and NMILUR. The test cases consist of a Poisson problem and convection-diffusion problems with jumping coefficients.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
NIST Sparse BLAS, http://math.nist.gov/spblas/
HYPRE, http://acts.nersc.gov/hypre/
Cilk plus, online documentation at http://software.intel.com/file/40297
Davis, T.A.: Algorithm 832: UMFPACK, an unsymmetric-pattern multifrontal method. ACM Transactions on Mathematical Software 30(2), 196–199 (2004)
METIS graph partitioner, http://glaros.dtc.umn.edu/gkhome/metis/metis/download
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. In: International Conference on Parallel Processing, pp. 113–122 (1995)
Karypis, G., Kumar, V.: Analysis of Multilevel Graph Partitioning. In: Supercomputing (1995)
Karypis, G., Kumar, V.: Multilevel k-way Partitioning Scheme for Irregular Graphs. J. Parallel Distrib. Comput. 48(1), 96–129 (1998)
Grigori, L., Kumar, P., Nataf, F., Wang, K.: A class of multilevel parallel preconditioning strategies. HAL Report RR-7410 (2010) (2010), http://hal.inria.fr/inria-00524110_v1/
George, J.A.: Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis 10(2), 345–363 (1973)
Kumar, P.: A class of preconditioning techniques suitable for partial differential equations of structured and unstructured mesh. PhD thesis (2010), http://www.sudoc.fr/147701619
Weiler, W., Wittum, G.: Parallel Frequency Filtering. Computing 58, 303–316 (1997)
Wagner, C.: Tangential frequency filtering decompositions for symmetric matrices. Numer. Math. 78(1), 119–142 (1997)
Wagner, C.: Tangential frequency filtering decompositions for unsymmetric matrices. Numer. Math. 78(1), 143–163 (1997)
Wittum, G.: Filternde Zerlegungen-Schnelle Loeser fur grosse Gleichungssysteme. Teubner Skripten zur Numerik Band 1. Teubner-Verlag, Stuttgart (1992)
Axelson, O., Polman, B.: A robust preconditioner based on algebraic substructuring and two level grids. In: Hackbusch, W. (ed.) Robust multi-grid methods, NNFM, Bd.23. Vieweg-Verlag, Braunschweig
Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS publishing company, Boston (1996)
Kettler, R.: Analysis and comparison of relaxation schemes in robust multigrid and preconditioned conjugate gradient methods. In: Multigrid Methods. Lecture notes in mathematics, vol. 960, pp. 502–534 (1982)
Notay, Y.: AGMG: Agregation based AMG, http://homepages.ulb.ac.be/~ynotay
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, P., Meerbergen, K., Roose, D. (2013). Multi-threaded Nested Filtering Factorization Preconditioner. In: Manninen, P., Öster, P. (eds) Applied Parallel and Scientific Computing. PARA 2012. Lecture Notes in Computer Science, vol 7782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36803-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-36803-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36802-8
Online ISBN: 978-3-642-36803-5
eBook Packages: Computer ScienceComputer Science (R0)