Accuracy and dispersion of difference schemes
โ Scribed by A.S. Makarenko; M.N. Moskal'kov
- Publisher
- Elsevier Science
- Year
- 1983
- Weight
- 389 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
โฆ Synopsis
Here, /luJ is chosen from the condition for mJ.nJ.mum III from the relation /lu.~-ea..
All the computations are then repeated for the improved control uHI(I). The iterations are peformed until the condition I~/l is satisfied. Since (17) holds only under the assumption of infinitely small variations /lu, successful optimization depends basically on making a sensible choice of e.
The problem was solved with the following data: p=3.02โข10-โข cm 2 , 110 =0.03 P, I1w -0-01 p. m=0.2, S,-O.1. L=100m, II=IOO, /l=0.0008.
At the 15th iteration the maximum /luJ was 0.00012, indicating the damping of the convergence. The value of the functional was then 0.00078.
The results obtained after the 15th iterations are shown in Figs.l and 2. REFERENCES 1.
๐ SIMILAR VOLUMES
We describe a general method for modifying a given finite-difference scheme by representing the effects of the subgrid scales in terms of the resolved scales through enslaving. The new scheme is more accurate in certain parameter regimes while retaining the time-step stability of the original scheme
This paper discusses implementation strategies for second-order ยฎnite dierence discretizations of advection. Purely explicit and implicit methods both have disadvantages, and we consider semi-implicit schemes in which the ยฏux is split into a primary implicit part and a secondary explicit correction.