1982
DOI: 10.1016/s0307-904x(82)80008-5
|View full text |Cite
|
Sign up to set email alerts
|

A node-moving algorithm with application to Burgers equation and the Moltz problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1987
1987
2017
2017

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…Substitute the derivative approximations, Eqs. (12) and (13) in linearized Burgers' equation, Eq. (4) leads to the discretized Burgers' equation Eq.…”
Section: Step 2: Discretizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Substitute the derivative approximations, Eqs. (12) and (13) in linearized Burgers' equation, Eq. (4) leads to the discretized Burgers' equation Eq.…”
Section: Step 2: Discretizationmentioning
confidence: 99%
“…Morandi et al conducted the stability and error estimate of the numerical method proposed by Varoglu. Further, finite elements methods for Burgers' equation are described in . Bressan and Quarteroni used Chebyshev spectral collocation methods for solving viscid Burgers' equation.…”
Section: Introductionmentioning
confidence: 99%