AUTOMATIC TIMESTEP SELECTION FOR THE SUPER‐TIME‐STEPPING ACCELERATION ON UNSTRUCTURED GRIDS USING OBJECT‐ORIENTED PROGRAMMING
ROY LEWIS, Ian Masters, Jim Cross · Communications in Numerical Methods in Engineering · 1997
The super-time-stepping algorithm is an improved timestepping scheme. It can significantly 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 find the effect 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. © 1997 by John Wiley & Sons, Ltd.