Rw. Lewis et al., AUTOMATIC TIMESTEP SELECTION FOR THE SUPER-TIME-STEPPING ACCELERATIONON UNSTRUCTURED GRIDS USING OBJECT-ORIENTED PROGRAMMING, Communications in numerical methods in engineering, 13(4), 1997, pp. 249-260
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 drawba
cks of the method is that the improvements are dependent on a set of p
arameters which are generally unknown. An investigation is performed t
o find the effect of these parameters and a method is described that e
stimates them. The technique is applied to a real problem and the resu
lts show a considerable improvement over a standard explicit timestepp
ing scheme. The technique is implemented in an object-oriented manner,
and details are given in an Appendix. (C) 1997 by John Wiley & Sons,
Ltd.