Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions |
| |
| Authors: | J.J. Camata A.L. Rossa A.M.P. Valli L. Catabriga G.F. Carey A.L.G.A. Coutinho |
| |
| Affiliation: | 1. Department of Civil Engineering, NACAD, COPPE, Federal University of Rio de Janeiro, , Rio de Janeiro, Brazil;2. LCAD, Computer Science Department, Federal University of Espírito Santo, , Vitória, ES, Brazil;3. ICES, CFD Lab, The University of Texas at Austin, , Austin, TX, USA |
| |
| Abstract: | The effects of reordering the unknowns on the convergence of incomplete factorization preconditioned Krylov subspace methods are investigated. Of particular interest is the resulting preconditioned iterative solver behavior when adaptive mesh refinement and coarsening (AMR/C) are utilized for serial or distributed parallel simulations. As representative schemes, we consider the familiar reverse Cuthill–McKee and quotient minimum degree algorithms applied with incomplete factorization preconditioners to CG and GMRES solvers. In the parallel distributed case, reordering is applied to local subdomains for block ILU preconditioning, and subdomains are repartitioned dynamically as mesh adaptation proceeds. Numerical studies for representative applications are conducted using the object‐oriented AMR/C software system libMesh linked to the PETSc solver library. Serial tests demonstrate that global unknown reordering and incomplete factorization preconditioning can reduce the number of iterations and improve serial CPU time in AMR/C computations. Parallel experiments indicate that local reordering for subdomain block preconditioning associated with dynamic repartitioning because of AMR/C leads to an overall reduction in processing time. Copyright © 2011 John Wiley & Sons, Ltd. |
| |
| Keywords: | reordering ILU preconditioning adaptive mesh refinement Krylov subspace solvers parallel implementation |
|
|
