کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
522185 | 867813 | 2008 | 21 صفحه PDF | دانلود رایگان |

This article studies the effect of discretization order on preconditioning and convergence of a high-order Newton–Krylov unstructured flow solver. The generalized minimal residual (GMRES) algorithm is used for inexactly solving the linear system arising from implicit time discretization of the governing equations. A first-order Jacobian is used as the preconditioning matrix. The complete lower–upper factorization (LU) and an incomplete lower–upper factorization (ILU(4)) techniques are employed for preconditioning of the resultant linear system. The solver performance and the conditioning of the preconditioned linear system have been compared in detail for second, third, and fourth-order accuracy. The conditioning and eigenvalue spectrum of the preconditioned system are examined to investigate the quality of preconditioning.
Journal: Journal of Computational Physics - Volume 227, Issue 4, 1 February 2008, Pages 2366–2386