On matching the SSpj AND GNpj algorithms

DOI10.1002/CNM.1630020504zbMATH Open0612.65039OpenAlexW2061091075MaRDI QIDQ3753401FDOQ3753401

Author name not available (Why is that?)

Publication date: 1986

Published in: Communications in Applied Numerical Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1630020504

Recommendations

• Further results on the accuracy of the SSpj algorithms
• A unified set of single step algorithms. Part 2: Theory
• SSP algorithm for linear and non-linear dynamic response simulation
• Symplectic two-step algorithms of FE dynamic equations
• A unified set of single step algorithms part 3: The beta-m method, a generalization of the Newmark scheme

zbMATH Keywords

stability polynomialNewmark methodsingle-step method

Mathematics Subject Classification ID

Linear ordinary differential equations and systems (34A30) Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cited In (2)

• SSP algorithm for linear and non-linear dynamic response simulation
• Further results on the accuracy of the SSpj algorithms

This page was built for publication: On matching the SSpj AND GNpj algorithms

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