2008
DOI: 10.2514/1.36792
|View full text |Cite
|
Sign up to set email alerts
|

Block-Jacobi Implicit Algorithms for the Time Spectral Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
43
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 80 publications
(43 citation statements)
references
References 16 publications
0
43
0
Order By: Relevance
“…The published information is scarce (see [4], for instance, for the LUR) regarding detailed and consistent CPU time requirement comparisons of the two methods with URANS (for example, Hall et al [5] compare their approach to steady computations). As can be expected, it appears to be problem and implementation dependant (compare [9,10], for instance). A second objective of the present paper is thus to make the assessment over a range of significantly different flow conditions, but for the same physical problem and within the same code.…”
mentioning
confidence: 89%
See 1 more Smart Citation
“…The published information is scarce (see [4], for instance, for the LUR) regarding detailed and consistent CPU time requirement comparisons of the two methods with URANS (for example, Hall et al [5] compare their approach to steady computations). As can be expected, it appears to be problem and implementation dependant (compare [9,10], for instance). A second objective of the present paper is thus to make the assessment over a range of significantly different flow conditions, but for the same physical problem and within the same code.…”
mentioning
confidence: 89%
“…In the present paper the notation HB is retained, though all the computations presented here consider a single fundamental frequency. This method has proven its efficiency in decreasing the total CPU time of forced-motion simulations, while ensuring a good accuracy (see Sicot et al [9], among others).…”
mentioning
confidence: 99%
“…This restriction can be removed by resorting to an implicit approach in pseudo-time. Such an approach has been derived in reference [16] using a first-order backwards difference scheme in pseudo time.…”
Section: Fully Implicit Methodsmentioning
confidence: 99%
“…However, it is well known that this approach suffers stability restrictions and results in convergence degradation as the number of harmonics increases [6]. In this work, we employ a fully (time and space) implicit solution strategy originally described by Sicot [16] which in principle is capable of delivering convergence rates that are independent of the number of harmonics or time instances used in the time-spectral discretization. This approach is further accelerated through the application of a line-implicit agglomeration multigrid algorithm applied to the spatially implicit system.…”
Section: Introductionmentioning
confidence: 99%
“…Mosahebi extended the method for nonlinear problems and developed an adapted approach for two-dimensional viscous flows using the NLFD approach [57], and demonstrated its application on deformable grids [59]. Originally developed using explicit solvers such as Runge-Kutta methods for the advancement of pseudotime, the convergence speed of frequency-domain methods was improved by the use of implicit algorithms such as block-Jacobi for the TS method [75] and Lower-Upper Symmetric Gauss-Seidel (LU-SGS) for the adaptive NLFD method [58].…”
Section: Frequency-domain Solution Methodsmentioning
confidence: 99%