|
forums.silverfrost.com Welcome to the Silverfrost forums
|
View previous topic :: View next topic |
Author |
Message |
Kenneth_Smith
Joined: 18 May 2012 Posts: 697 Location: Hamilton, Lanarkshire, Scotland.
|
Posted: Tue Jul 07, 2020 3:53 pm Post subject: |
|
|
W. F. TINNEY, C. M. McINTYRE, A Digital Method for Obtaining a Loop Connection Matrix, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems, October 1960. |
|
Back to top |
|
|
JohnCampbell
Joined: 16 Feb 2006 Posts: 2555 Location: Sydney
|
Posted: Wed Jul 15, 2020 11:25 am Post subject: |
|
|
In structural analysis, calculation of the torsional properties for a closed cross-section requires the identification of internal loops. I have a "subroutine loops" which achieves this for a 2-D set of connected points. It basically does this by testing if any connected points are inside the loop. There may be other documented approaches for calculation of torsional properties of closed cross-sections. This works well and has been tested for small "circuits" (say 100 nodes)
I have not considered how this would work for a 3-D data set.
I also have equation re-ordering algorithms for large sets of equations for FEA analysis (say up to million nodes). I have RCM, Sloan and Hoit algorithms coded, which are based on tree connectivity approaches. I also have another re-ordering algorithm that on average works better, which simply uses an ax+by+cz directed sort that typically works on meshes with local refinement. (Various a,b,c are tested)
Not sure if either of these approaches are relevant. |
|
Back to top |
|
|
|
|
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum
|
Powered by phpBB © 2001, 2005 phpBB Group
|