BAIL 2006 Book of Abstracts - Institut für Numerische und ...

BAIL 2006 Book of Abstracts - Institut für Numerische und ... BAIL 2006 Book of Abstracts - Institut für Numerische und ...

num.math.uni.goettingen.de
from num.math.uni.goettingen.de More from this publisher
04.02.2013 Views

H. TIAN: Uniformly Convergent Numerical Methods for Singularly Perturbed Delay Differential Equations ✬ ✫ where we assume that −fy(t, y, z) ≥ α > 0 for all t ≥ 0 and all real y, z. We now linearize (5) and introduce the Newton sequence {ys(t)} ∞ s=0 for the initial guess y0(t) satisfying the initial condition y0(t) = φ(t), t ∈ [−1, 0]. This is done by defining ys+1(t), for all s ≥ 0, to be the solution of the linear problem �Lsys+1(t) ≡ ε dys+1(t) dt − fy(t, ys(t), ys(t − 1))ys+1(t) −fz(t, ys(t), ys(t − 1))ys+1(t − 1) = f(t, ys(t), ys(t − 1)) − fy(t, ys(t), ys(t − 1))ys(t) −fz(t, ys(t), ys(t − 1))ys(t − 1), t > 0, ys+1(t) = φ(t), −1 ≤ t ≤ 0. We may show that not only the convergence of this sequence is quadratic, but also its proportionality constant is independent of s and ε. If the initial guess y0(t) is sufficiently close to y(t), converges to y(t). then the Newton sequence {ys(t)} ∞ s=0 3 Numerical experiments Consider We take initial guess as y0(t) = � εy ′ (t) = −y(t) + y 2 (t − 1), t ≥ 0, y(t) = 2, t ∈ [−1, 0]. t − 4 − 2e ε , t ∈ [0, 1), 16 − (8 + 16 t−1 t−1 t−1 −2 ε )e− ε − 4e ε , t ∈ [1, 2). The true solution and the numerical solution using the optimal scheme after two iterations are plotted in Figure 1. This figure indicates that the uniformly convergent scheme works well also for nonlinear problem. References y 18 16 14 12 10 8 6 4 Numerical and analytic solutions:ε y’(t)=−y(t)+y 2 (t−1),ε=10 −2 Numerical solution True solution 2 0 0.2 0.4 0.6 0.8 1 t 1.2 1.4 1.6 1.8 2 Figure 1: Comparison between numerical and analytical solutions. [1] M. W. Derstine, H. M. Gibbs, F. A. Hopf, D. L. Kaplan, Bifurcation gap in a hybrid optical system, Phys. Rev., A, 26(1982)3720–3722. [2] M. C. Mackey, L. Glass, Oscillation and chaos in physiological control systems, Science, 197(1977)287–289. Speaker: TIAN, H. 148 BAIL 2006 2 (6) ✩ ✪

A.I. TOLSTYKH, M.V. LIPAVSKII, E.N. CHIGEREV: Highly accurate 9th-order schemes and their applications to DNS of thin shear layer instability ✬ ✫ Highly accurate 9th-order schemes and their applications to DNS of thin shear layer instability A.I.Tolstykh , M.V.Lipavskii, E.N.Chigerev Computing Center of Russian Academy of Sciences, Vavilova str.40, 119991 Moscow GSP-1, Russia e-mail tol@ccas.ru ABSTRACT The principle of constructing arbitrary-order approximations and schemes is outlined. Its essence is forming linear combinations of basis operators from certain types of one-parametric operators families by fixing distinct values of the parameter. The details of the procedure first proposed in [1] can be found in [2],[3] where the linear combinations were referred to as multioperators. The multioperators were designed for parallel machines providing approximation orders which are linear functions of numbers of processors involved in calculations. In the present talk, extremely accurate ninth-order multioperators-based schemes for fluid dynamics equations are presented, the basis operators being Compact Upwind Differencing (CUD) ones from [4]. The schemes preserve upwinding and conservation properties of CUD schemes; they are characterized by very small phase & amplitude errors for physically relevant wave numbers supported by grids and damping spurious oscillations. They are capable to resolve properly small scale phenomena using reasonable meshes and allow to perform highaccuracy unsteady calculations for large time intervals. Their properties make them very useful, in particular, for thin layers, DNS and LES computations. Illustrative examples followed by direct numerical simulations of thin incompressible 2D shear layers instability are presented. The Navier-Stokes calculations were carried out for various high Reynolds number flows with complete resolution of turbulent scales as well as for zero molecular viscosity. In the latter case, ninth-order dissipative mechanism was responsible for generating small-scale vorticity. The results obtained for large time intervals show the full history of the flow development with rolling-up,pairing,generation and decaying of turbulence.The resulting energy and enstrophy spectra are discussed. References [1] A. I. Tolstykh, Multioperator high-order compact upwind methods for CFD parallel calculations, in Parallel Computational Fluid Dynamics, Elsevier, Amsterdam, 1998, pp. 383-390. [2] A. I. Tolstykh, On ultioperators principle for constructing arbitrary-order difference schemes, Applied Numerical Mathematics 46 (2003),pp.411-423 [3] A. I. Tolstykh, Centered prescribed-order approximations with structured grids and resulting finite-volume schemes, Applied Numerical Mathematics, 49(2004),pp.431-440. [4] A. I. Tolstykh, High accuracy non-centered compact difference schemes for fluid dynamics applications, World Scientific, Singapore, 1994. Speaker: TOLSTYKH, A.I. 149 BAIL 2006 ✩ ✪

H. TIAN: Uniformly Convergent Numerical Methods for Singularly Perturbed Delay<br />

Differential Equations<br />

✬<br />

✫<br />

where we assume that −fy(t, y, z) ≥ α > 0 for all t ≥ 0 and all real y, z. We now linearize (5)<br />

and introduce the Newton sequence {ys(t)} ∞<br />

s=0 for the initial guess y0(t) satisfying the initial<br />

condition y0(t) = φ(t), t ∈ [−1, 0]. This is done by defining ys+1(t), for all s ≥ 0, to be the<br />

solution <strong>of</strong> the linear problem<br />

�Lsys+1(t) ≡ ε dys+1(t)<br />

dt − fy(t, ys(t), ys(t − 1))ys+1(t)<br />

−fz(t, ys(t), ys(t − 1))ys+1(t − 1)<br />

= f(t, ys(t), ys(t − 1)) − fy(t, ys(t), ys(t − 1))ys(t)<br />

−fz(t, ys(t), ys(t − 1))ys(t − 1), t > 0,<br />

ys+1(t) = φ(t), −1 ≤ t ≤ 0.<br />

We may show that not only the convergence <strong>of</strong> this sequence is quadratic, but also its proportionality<br />

constant is independent <strong>of</strong> s and ε. If the initial guess y0(t) is sufficiently close to y(t),<br />

converges to y(t).<br />

then the Newton sequence {ys(t)} ∞<br />

s=0<br />

3 Numerical experiments<br />

Consider<br />

We take initial guess as<br />

y0(t) =<br />

�<br />

εy ′ (t) = −y(t) + y 2 (t − 1), t ≥ 0,<br />

y(t) = 2, t ∈ [−1, 0].<br />

t<br />

− 4 − 2e ε , t ∈ [0, 1),<br />

16 − (8 + 16 t−1<br />

t−1<br />

t−1<br />

−2<br />

ε )e− ε − 4e ε , t ∈ [1, 2).<br />

The true solution and the numerical solution using the optimal scheme after two iterations are<br />

plotted in Figure 1. This figure indicates that the uniformly convergent scheme works well also<br />

for nonlinear problem.<br />

References<br />

y<br />

18<br />

16<br />

14<br />

12<br />

10<br />

8<br />

6<br />

4<br />

Numerical and analytic solutions:ε y’(t)=−y(t)+y 2 (t−1),ε=10 −2<br />

Numerical solution<br />

True solution<br />

2<br />

0 0.2 0.4 0.6 0.8 1<br />

t<br />

1.2 1.4 1.6 1.8 2<br />

Figure 1: Comparison between numerical and analytical solutions.<br />

[1] M. W. Derstine, H. M. Gibbs, F. A. Hopf, D. L. Kaplan, Bifurcation gap in a hybrid optical<br />

system, Phys. Rev., A, 26(1982)3720–3722.<br />

[2] M. C. Mackey, L. Glass, Oscillation and chaos in physiological control systems, Science,<br />

197(1977)287–289.<br />

Speaker: TIAN, H. 148 <strong>BAIL</strong> <strong>2006</strong><br />

2<br />

(6)<br />

✩<br />

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!