AUTOMATIC TIMESTEP SELECTION FOR THE SUPER-TIME-STEPPING ACCELERATION ON UNSTRUCTURED GRIDS USING OBJECT-ORIENTED PROGRAMMING
✍ Scribed by LEWIS, R. W. ;MASTERS, I. ;CROSS, J. T.
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 362 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1069-8299
No coin nor oath required. For personal study only.
✦ Synopsis
The super-time-stepping algorithm is an improved timestepping scheme. It can signi®cantly increase the performance of explicit methods, by reducing the restrictive timestep limits that exist. One of the drawbacks of the method is that the improvements are dependent on a set of parameters which are generally unknown. An investigation is performed to ®nd the eect of these parameters and a method is described that estimates them. The technique is applied to a real problem and the results show a considerable improvement over a standard explicit timestepping scheme. The technique is implemented in an object-oriented manner, and details are given in an Appendix.