✦ LIBER ✦

Effect of discretization order on preconditioning and convergence of a high-order unstructured Newton-GMRES solver for the Euler equations

✍ Scribed by Amir Nejat; Carl Ollivier-Gooch

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 520 KB
Volume: 227
Category: Article
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2007.10.024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A compact high-order unstructured grids

A compact high-order unstructured grids method for the solution of Euler equations

✍ R.K. Agarwal; D.W. Halt 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB 👁 2 views

Two compact higher-order methods are presented for solving the Euler equations in two dimensions. The flow domain is discretized by triangles. The methods use a characteristic-based approach with a cell-centered finite volume method. Polynomials of order 0 through 3 are used in each cell to represen

A comparative study of the behaviour of

A comparative study of the behaviour of a direct solver and a preconditioned iterative solver for the equations arising from the discretization by Chebyshev collocation of a second-order partial differential equation on a square

✍ Bo Kjellmert 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 757 KB

The convergence of two Newton-like metho

The convergence of two Newton-like methods for solving block nonlinear equations and a class of r-point (r + 1)st-order A-stable one-block methods

✍ Shuangsuo Zhao; Guofeng Zhang; Changyin Wang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 775 KB

In this paper, for a Newton-like method for solving block nonlinear equations arising in the numerical solution of stiff ODEs y' = f(y), which involves a smaller quantity of computation, we prove that it is convergent and the convergence is independent of the stiffness of f(y), and give the error es