2011
DOI: 10.1142/9789814313193_0013
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Relaxation Methods for High-Order Discretization of Steady Problems

Abstract: We review the current status of solution methods for nonlinear systems arising from high-order discretization of steady compressible flow problems. In this context, many of the difficulties that one faces are similar to, but more pronounced than, those that have always been present in industrial-strength CFD computations. We highlight similarities and differences between the high-order paradigm and the mature solver technology of lower oder discretization methods, such as second order finitevolume schemes.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 46 publications
0
8
0
Order By: Relevance
“…In order to speed up the convergence, one can use other relaxation methods, which are developed specifically for integrating steady-state equations ( e.g. May and Jameson 2011). They often involve a relaxation variable which is called ‘pseudo time’.…”
Section: Introductionmentioning
confidence: 99%
“…In order to speed up the convergence, one can use other relaxation methods, which are developed specifically for integrating steady-state equations ( e.g. May and Jameson 2011). They often involve a relaxation variable which is called ‘pseudo time’.…”
Section: Introductionmentioning
confidence: 99%
“…Various approaches are used in practice, including NewtonKrylov methods such as GMRES, block Jacobi methods, line Jacobi methods, Gauss-Seidel (GS) methods, symmetric GS (SGS) methods, and lower-upper SGS (LU-SGS) methods (developed by Jameson and Yoon [68] and Yoon and Jameson [145]). For full details of all aforementioned approaches the reader is referred to the review of Wang [139], and the book chapter of May and Jameson [90]. However, we will note two important points here.…”
Section: Implicit Methodsmentioning
confidence: 99%
“…This topic is discussed in some detail within the general review article of Wang [139]. More recently, reviews specifically on this topic by Iacono and May [60] and Iacono, May and Wang [61] have been presented, along with a book chapter by May and Jameson [90]. Based on this literature, it is apparent that two major issues are inhibiting the efficient temporal integration of unstructured high-order spatial discretizations.…”
Section: Time Integration 331 Overviewmentioning
confidence: 99%
“…As has been realized by many researchers [1,2], one big challenge in the development of high-order method is to design a robust, scalable and efficient algorithm for solving the nonlinear system which governs complex fluid flow, e.g., high Reynolds number turbulent flow over complex geometry. For steady flow simulation, mature convergence acceleration techniques [3,4,5,6,7] have been established for low-order finite volume methods.…”
Section: Introductionmentioning
confidence: 99%
“…For steady flow simulation, mature convergence acceleration techniques [3,4,5,6,7] have been established for low-order finite volume methods. However, these techniques cannot be directly carried over to highorder schemes [2]. Much effort [8,9,10,11,12,13,14] has been spent on developing robust and efficient solution algorithm for high-order schemes.…”
Section: Introductionmentioning
confidence: 99%