A unified set of single step algorithms. Part 1: General formulation and applications

Abstract

Abstract A general algorithm for a single step time marching scheme for use in dynamic or diffusion equations is presented. This algorithm is easily programmed in its universal form for all orders of approximation and covers most of the currently used schemes as well as presenting many new possibilities. In many cases it presents a computationally advantageous form over conventional procedures—this is particularly so when compared with the Newmark algorighm and its variants.