Abstract
An approach to mathematical position analysis of planar Assur's groups is shown. The non-linear position equations are repetitively solved by suppressing one or more links and by applying dyad analysis algorithms to a reduced linkage. The effect of the choice of the suppressed links are investigated and the solutions convergence problems examinated. Several practical examples are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
