Explicit Pseudodynamic Algorithm with Unconditional Stability

Abstract

Listen

Translate article

An unconditionally stable explicit pseudodynamic algorithm is proposed herein. This pseudodynamic algorithm can be implemented as simply as the very commonly used explicit pseudodynamic algorithms, such as the central difference method and the Newmark explicit method as reported in 1959. Thus, it can be used to perform pseudodynamic tests without using any iterative scheme or extra hardware that is generally needed by the currently available implicit pseudodynamic algorithms. This integration method is second-order accurate and the most promising property of this explicit pseudodynamic algorithm is its unconditional stability. In addition, it possesses much better error propagation properties when compared to the Newmark explicit method and the central difference method.