This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 Startup of the Calculation Process Hence the value D n +1 at instant n +1 is calculated from the known values D n and D n 1 at instants n and n 1, respectively. Initial displacement and velocity, are known (given). and D D D 1 as well as D must be known to calculate D 1 . D 1 is not a real quantity but algorithm demands it. So, we assume that D is a smooth function of time around the origin and extrapolate it to instant t = t . We do this by expanding D in a Taylor series about t=0 and evaluate it at t = t . 2 Direct Integration Algorithms Now the acceleration at t =0 is needed, which is calculated from the discretized equation of motion at instant n =0: from which R KD D C D M = + + [ ] r nonsingula 1 M KD D C R M D = Using this, D 1 is determined from which D 1 is calculated. 3 Numerical Stability of the Central Difference Method The method is conditionally stable : Accuracy decreases as t gets large and the method diverges if t is too large . To guarantee numerical stability, t must be chosen such that where max is the largest undamped natural frequency of the system and, therefore, T min is the smallest natural period . . Note that t indicates how often we sample the motion . On the other hand, T min indicates how fast the motion changes ....
View
Full
Document
This note was uploaded on 06/06/2011 for the course EAS 4240 taught by Professor Peterifju during the Spring '08 term at University of Florida.
 Spring '08
 PETERIFJU

Click to edit the document details