scientific article; zbMATH DE number 3872839

From MaRDI portal
Publication:3339435





[For the entire collection see Zbl 0521.00025.] This chapter provides a systematic fundamental exposition of algorithms for transient analysis. Emphasis is put on ordinary differential equations for discrete (or discretized) structural systems. The major part of this chapter is devoted to linear systems, followed by a brief presentation of simple nonlinear equations. A list of references enables further study of the topics discussed here. The section on linear systems serves for introducing basic concepts, such as convergence and stability, with emphasis put on the latter. Widely used integration methods are explained, including forward and backward differences, Galerkin, Newmark, and other well known algorithms. Comparisons between performances of various methods are also covered. Several examples, mainly those associated with commonly-used finite-element discretization are included here. The chapter is suitable as a concise tutorial for the novice. But, its systematic presentation, its consistency, and the classification of methods, make it a useful guide for the experienced reader as well.




Cited in
(76)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339435)