2004
DOI: 10.4310/cms.2004.v2.n3.a7
|View full text |Cite
|
Sign up to set email alerts
|

On large time step Godunov scheme for hyperbolic conservation laws

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…From 2001 to 2004, there was a focus on investigating more mathematical properties of LTS methods: Helzel and Warnecke [55] and Wang et al [146] studied the entropy stability of the LTS-Godunov scheme, Huang et al [62] investigated the error bounds for the LTS-Glimm scheme and Tang and Warnecke [133] studied the monotonicity of (2K+1)-point schemes.…”
Section: Large Timementioning
confidence: 99%
See 1 more Smart Citation
“…From 2001 to 2004, there was a focus on investigating more mathematical properties of LTS methods: Helzel and Warnecke [55] and Wang et al [146] studied the entropy stability of the LTS-Godunov scheme, Huang et al [62] investigated the error bounds for the LTS-Glimm scheme and Tang and Warnecke [133] studied the monotonicity of (2K+1)-point schemes.…”
Section: Large Timementioning
confidence: 99%
“…Later, Wang et al [146] proved entropy stability of the LTS-Godunov method for any Courant number for some additional types of initial data. An example of monotone, hence entropy stable LTS method is an LTS version of Lax-Friedrichs scheme studied by Tang and Warnecke [133].…”
Section: Entropy Stabilitymentioning
confidence: 99%
“…A parallel large time step version of the Glimm scheme and similar results were subsequently given by LeVeque [9], Brenier [1] and Wang [12,13]. In addition, Wang [12] obtained the consistency of the LTS Glimm scheme for systems of conservation laws in one space dimension for any choice of time step and convergence of the scheme for the case that C ≤ 1, if the total variation of v 0 is sufficiently small and each eigenvalue of the system does not change its' sign. Using the Roe approximate Riemann solver as building block, similar results were obtained by Brenier [1].…”
Section: A Description Of the Lts Schemementioning
confidence: 74%
“…(14) also holds in this case. Summing up (11), (12) and (14), it can be concluded that, for Case 3, we can choose α, β and ω such that…”
Section: Lemma 5 For Case 3 We Can Choose α β and ω Such Thatmentioning
confidence: 98%
“…settingû j+1/2 (x, t) to be the solution to the Riemann problem (35) for (79) yields a conservative approximation to Godunov's method. For scalar equations, this is also known as Murman's method [18,24].…”
Section: The Large Timementioning
confidence: 99%