2020
DOI: 10.1002/nme.6543
|View full text |Cite
|
Sign up to set email alerts
|

A high‐order accurate explicit time integration method based on cubic b‐spline interpolation and weighted residual technique for structural dynamics

Abstract: A novel explicit time integration method is proposed on the basis of cubic b-spline interpolation and weighted residual method. Its calculation formulation and procedure are presented. Accuracy, algorithmic damping, and period elongation are theoretically and numerically solved. The influence of two algorithmic parameters on basic properties of the proposed method is studied to obtain optimal parameters values for dynamic problems. Various linear and nonlinear dynamic problems are tested to demonstrate high ef… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 24 publications
(8 citation statements)
references
References 25 publications
0
8
0
Order By: Relevance
“…With the identical strategy proposed by Wen et al, 17 the analytical truncation errors of the new method are, respectively, obtained as follows: eut+tgoodbreak=a1utfalse(3false)false(tfalse)3goodbreak+O()(t)4,21.2em$$ {e}_{u_{t+\Delta t}}={a}_1\cdot {u}_t^{(3)}\cdot {\left(\Delta t\right)}^3+O\left({\left(\Delta t\right)}^4\right),\kern21.2em $$ etrueu˙t+tgoodbreak=b1utfalse(3false)false(tfalse)2goodbreak+()b2utfalse(4false)goodbreak+b3ξωutfalse(3false)false(tfalse)3goodbreak+O()(t)4,8.5em$$ {e}_{{\dot{u}}_{t+\Delta t}}={b}_1{u}_t^{(3)}\cdot {\left(\Delta t\right)}^2+\left({b}_2\cdot {u}_t^{(4)}+{b}_3\cdot \xi \omega {u}_t^{(3)}\right)\cdot {\left(\Delta t\right)}^3+O\left({\left(\Delta t\right)}^4\right),\kern8.5em $$ etrueu¨t+tgoodbreak=c1ξωutfalse(3false)false(tfalse)2goodbreak+()c2ω2utfalse(3false)goodbreak+c3ξωutfalse(4false)goodbreak+c4false(ξωfalse)2utfalse(3false)fals...…”
Section: Theoretical Analysis For Basic Algorithm Propertiesmentioning
confidence: 99%
See 1 more Smart Citation
“…With the identical strategy proposed by Wen et al, 17 the analytical truncation errors of the new method are, respectively, obtained as follows: eut+tgoodbreak=a1utfalse(3false)false(tfalse)3goodbreak+O()(t)4,21.2em$$ {e}_{u_{t+\Delta t}}={a}_1\cdot {u}_t^{(3)}\cdot {\left(\Delta t\right)}^3+O\left({\left(\Delta t\right)}^4\right),\kern21.2em $$ etrueu˙t+tgoodbreak=b1utfalse(3false)false(tfalse)2goodbreak+()b2utfalse(4false)goodbreak+b3ξωutfalse(3false)false(tfalse)3goodbreak+O()(t)4,8.5em$$ {e}_{{\dot{u}}_{t+\Delta t}}={b}_1{u}_t^{(3)}\cdot {\left(\Delta t\right)}^2+\left({b}_2\cdot {u}_t^{(4)}+{b}_3\cdot \xi \omega {u}_t^{(3)}\right)\cdot {\left(\Delta t\right)}^3+O\left({\left(\Delta t\right)}^4\right),\kern8.5em $$ etrueu¨t+tgoodbreak=c1ξωutfalse(3false)false(tfalse)2goodbreak+()c2ω2utfalse(3false)goodbreak+c3ξωutfalse(4false)goodbreak+c4false(ξωfalse)2utfalse(3false)fals...…”
Section: Theoretical Analysis For Basic Algorithm Propertiesmentioning
confidence: 99%
“…A standard Van der Pol's equation described by ()1+u2ufalse(2false)+()d+u2ufalse(1false)+u=0$$ \left(1+{u}^2\right){u}^{(2)}+\left(d+{u}^2\right){u}^{(1)}+u=0 $$ is considered, 17 where d is the damping coefficient, and negative for this problem. We select c=2.0$$ c=-2.0 $$ and the initial conditions, u(0)=0.02$$ u(0)=-0.02 $$ and ufalse(1false)(0)=0$$ {u}^{(1)}(0)=0 $$.…”
Section: Numerical Examplesmentioning
confidence: 99%
“…The PSO simulates the foraging behavior of a flock of birds and performs stochastic optimization through the behavior of an intelligent population. 30 The advantages of the particle swarm algorithm are its strong global search capability, fast computational speed, and adaptation to global optimal solution search under multiple constraints. The idea of intelligent PSO is that individuals within the swarm adjust information parameters such as step size and speed by recording their own position and the position of the swarm during the search process, constantly updating their position state and eventually reaching the optimal solution or maximum number of iterations.…”
Section: Space Trajectory Planning and Optimal Time Control Of Indust...mentioning
confidence: 99%
“…After determining the expression of the handling robot's trajectory in relation to time, the study investigates time‐optimal optimization control of trajectory planning by means of a PSO. The PSO simulates the foraging behavior of a flock of birds and performs stochastic optimization through the behavior of an intelligent population 30 . The advantages of the particle swarm algorithm are its strong global search capability, fast computational speed, and adaptation to global optimal solution search under multiple constraints.…”
Section: Dynamics Modeling and Shortest Time Trajectory Optimization ...mentioning
confidence: 99%
“…28, the NB method exhibits very good performance in the analysis of wave propagation problems. Besides, worth of mention are some efforts devoted to developing higher-order explicit methods [19,33,35] using two and more sub-steps. The improvement of the accuracy order, however, often leads to a reduction of the stability region.…”
Section: Introductionmentioning
confidence: 99%