GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Implicit solvers for unstructured meshes
Journal of Computational Physics
An adaptively refined Cartesian mesh solver for the Euler equations
Journal of Computational Physics
On essentially non-oscillatory schemes on unstructured meshes: analysis and implementation
Journal of Computational Physics
Convergence to steady state solutions of the Euler equations on unstructured grids with limiters
Journal of Computational Physics
Journal of Computational Physics
Approximate Riemann solvers, parameter vectors, and difference schemes
Journal of Computational Physics - Special issue: commenoration of the 30th anniversary
High resolution schemes for hyperbolic conservation laws
Journal of Computational Physics - Special issue: commenoration of the 30th anniversary
Journal of Computational Physics
Weighted essentially non-oscillatory schemes on triangular meshes
Journal of Computational Physics
Comparison of several spatial discretizations for the Navier-Stokes equations
Journal of Computational Physics
A high-order-accurate unstructured mesh finite-volume scheme for the advection-diffusion equation
Journal of Computational Physics
Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Journal of Computational Physics
Journal of Computational Physics
A generalized framework for high order anisotropic mesh adaptation
Computers and Structures
Journal of Computational Physics
Hi-index | 31.47 |
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.