The Falling U-Shaped Chain model simulates the dynamics of a discrete falling chain with total length L and n links. Each link is acted on by the force of gravity mg and by the link-link interaction. A freely falling object is released near the last link for comparison. The surprise is that the acceleration of the last link can be larger than g.
Links in the model are assumed to be uniform rigid rods with mass m and length L/n connected by ideal joints. The first link is attached to a fixed point and the last link is releases a distance D from the fixed point. A small damping coefficient b is included to allow the chain to equilibrate to its hanging position below the fixed point.
The Falling U-Shaped Chain model is a supplemental simulation for the article "A chain that speeds up, rather than slows, due to collisions: How compression can cause tension " by Anoop Grewal, Phillip Johnson, and Andy Ruina in the American Journal of Physics 79(7), 723-729 (2011) and has been approved by the authors and the American Journal of Physics (AJP) editor. The simulation was developed using the Easy Java Simulations (EJS) modeling tool. It is distributed as a ready-to-run (compiled) Java archive. Double click the ejs_mech_lagrangian_FallingUShapedChain.jar file to run the program if Java is installed.
Please note that this resource requires
at least version 1.5 of
Falling U-Shaped Chain Source Code
The source code zip archive contains an XML representation of the Falling U-Shaped Chain model. Unzip this archive in your EJS workspace to compile and run… more... download 19kb .zip
Last Modified: November 6, 2012
%0 Computer Program %A Christian, Wolfgang %D March 25, 2011 %T Falling U-shaped Chain Model %7 1.0 %8 March 25, 2011 %U http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11056&DocID=2217
Disclaimer: ComPADRE offers citation styles as a guide only. We cannot offer interpretations about citations as this is an automated procedure. Please refer to the style manuals in the Citation Source Information area for clarifications.