Higher derivative explicit one step methods for non‐linear dynamic problems. Part I: Design and theory
From MaRDI portal
Publication:5202386
DOI10.1002/nme.1620290205zbMath0724.73271OpenAlexW1997940224MaRDI QIDQ5202386
No author found.
Publication date: 1990
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.1620290205
stabilityaccuracycentral difference methodmultistep algorithmsweighted residual approachsingle step algorithmsstep-by-step integration algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Improving stability domains of the implicit higher order accuracy method ⋮ A Simple Explicit–Implicit Time-Marching Technique for Wave Propagation Analysis ⋮ PARALLEL ALGORITHMS FOR FOURTH-ORDER PARABOLIC EQUATIONS ⋮ A simple and effective new family of time marching procedures for dynamics ⋮ A theory of development and design of generalized integration operators for computational structural dynamics ⋮ Explicit time-domain approaches based on numerical Green's functions computed by finite differences the ExGa family ⋮ Numerical time integration for dynamic analysis using a new higher order predictor‐corrector method ⋮ The time dimension: A theory towards the evolution, classification, characterization and design of computational algorithms for transient/dynamic applications ⋮ Modified differential transformation method for solving nonlinear dynamic problems ⋮ A novel family of explicit time marching techniques for structural dynamics and wave propagation models ⋮ An unusual amplitude growth property and its remedy for structure-dependent integration methods ⋮ On second-order \(s\)-sub-step explicit algorithms with controllable dissipation and adjustable bifurcation point for second-order hyperbolic problems ⋮ Time discretized operators. I: Towards the theoretical design of a new generation of a generalized family of unconditionally stable implicit and explicit representations of arbitrary order for computational dynamics. ⋮ Time discretized operators. II: Towards the theoretical design of a new generation of a generalized family of unconditionally stable implicit and explicit representations of arbitrary order for computational dynamics.
Cites Work
This page was built for publication: Higher derivative explicit one step methods for non‐linear dynamic problems. Part I: Design and theory