1. Offenbach 11.3.2003 Semi-Implicit Time Integration (NH Schemes of the Next Generation) J. Steppeler, DWD

2. Offenbach 11.3.2003 Accuracy/high (Spatial) Approximation order Z-Coordinate Efficiency: High Order of Time Integration; Two Time Levels; Serendipidity Grids; “Large” Time Steps; Implicit Time Integration Some Desirable features of Next Generation NH Models

3. Offenbach 11.3.2003 Z-Coordinate/3rd Order Spatial Approximation/Serendipidity Grids Different NH Approaches Solution of non-Periodic Problems by Generalised Fourier Transform Efficiency Considerations Computational Example of a non-Periodic Problem Plan of Lecture

4. Offenbach 11.3.2003

5. Ilder Heinz-Werner 3-D Cloud-Picture 18 January1998 The mountain related bias of convectional clouds and precipitation is supposed to disappear with the Z-coordinate

6. Offenbach 11.3.2003

7. The geometry of 1 st, 2 nd and 3 rd order representation of the  (x) field 

8. Offenbach 11.3.2003 Third Order finite element representation (Continuous cubic spline) Basis functions: 1 - d: Auxiliary grid point Main grid point Field represention: Field operators: All classical grid operations Operations using the polynomial derivatives (inhomogeneous grid operations) Galerkin operations

9. Offenbach 11.3.2003 Order consistent field representations in one and three space dimensions Order consistent interpolation requires the field only in the solid lines

10. Offenbach 11.3.2003

11. The continuous splines in the presence of Orography:  (x) must be a „ smooth“ function (not a step function) =points to pose boundary conditions. The dashed parts of the grid lines are used to pose boundary values.

12. Offenbach 11.3.2003 Implicit Approaches

13. Offenbach 11.3.2003 The LH - is the Most Common SI Method The Equations of Motion are homogeneously linearised at each Grid Point At Each Grid-Point a Problem of Constant Coefficients is Defined For Each Grid-Point The Associated Linear Problem Can be Solved Using an FT and a Linear Problem Specific to Each Grid-Point The GFT (Generalised FT) Computes the Results of the Different FTs Using One Transform The numerical cost of GFT is Simlar to that of an FT A Fast GFT exists similar to Fast FT Direct Methods for Locally Homogenized SI

14. Offenbach 11.3.2003 Split Representation of Derivatives

15. Offenbach 11.3.2003 The Fourier Coefficients are the same for the grid Points of a Subregion The Linearised Eqs. are different for each Gridpoint In Case of only One Subregion the Support Points of the derivative are the Boundary Values does not create time-Step Limitations GFT Returns the Grid-Point-Values after doing a Different Eigenvalue Calculation at Each Point Organisation of the Implicit Time-Step

16. Offenbach 11.3.2003 The SI Timestep Subtract Large Scale Part of each function Compute Fourier Coefficients Choose Gridpoint Compute next time level in Fourier Space Transform Back Use Result Only for Chosen Grid-Point Do the Above for all Other Grid Points Set Boundary Values as in Finite Difference Methods

17. Offenbach 11.3.2003 Example:1-d Schallow Water Eq Definitions: SI Scheme: Periodicity Terms (=0in the following)

18. Offenbach 11.3.2003 Boundary- and Exterior Points Point to pose (Artificial) Boundary Values Redundant Points Redundant points can be included in the FT The result of the time-step does not depend on the continuation of the field to redundant points

19. Offenbach 11.3.2003 Operation in Fourier Space Definition: SI Scheme: Linear Equations at the chosen gridpoint:

20. Offenbach 11.3.2003 Computational Example: 1-d Schock Wave The time Step could be increased up to the CFL of advection (10 m/sec)

21. Offenbach 11.3.2003 A direct si- method was proposed The method is based on a generalised Fourier Transform The generalised FT is potentially as efficient as the FT (fast FT) The method is efficient for increased spatial order 1-d tests have been performed Conclusions