Difference between revisions of "Resequence Command"
Jump to navigation
Jump to search
(Created page with "<p>The <code>Resequence</code> command is used to renumber the numbers in an attempt to minimize the bandwidth of the problem. The smaller the bandwidth, the faster will be th...") |
|||
Line 1: | Line 1: | ||
The <tt>Resequence</tt> command is used to renumber the numbers in an attempt to minimize the bandwidth of the problem. The smaller the bandwidth, the faster will be the FEA calculations. | |||
== Scripted Input Files == | |||
The two options in scripted input files are | |||
Resequence (x),(y) | |||
or | |||
Resequence (id) | |||
where | |||
< | * (<tt>x</tt>, <tt>y</tt>) define the coordinates (in mm) for a point (or <rr>(R, Z)</rr> coordinates if axisymmetric). The resequencing will start at the one node nearest to that point. | ||
* <tt>(id)</tt> is a previously defined [[Keypoint Command|keypoint]]. The resequencing will start at the node at that keypoint. | |||
== XML Input Files == | |||
< | In <tt>XML<tt> files, the two options, which must be within the <tt><GridBCs</tt> element, are: | ||
</ | <Resequence x='(x)' y='(y)'/> | ||
or | |||
< | <Resequence keypt='(id)'/> | ||
< | where <tt>(x)</tt>, <tt>(x)</tt>, and <tt>(id)</tt> are the same as define [[#Scripted Input Files|above]]. | ||
== Notes == | |||
</ | # It is best to start the resequencing at a node on the boundary of the object and probably on a corner. The final bandwidth may depend on the node selected for resequencing. The bandwidth is reported in FEA output results. You can vary the resequencing node to find the minimum value. | ||
# Another use of this command is to verify mesh connectivity. Since disconnected sections of a static FEA mesh will cause a singular stiffness matrix, the calculations will fail. This command will find such connectivity problems before the calculations start. | |||
# The algorithm used to resequence the nodes in described in a paper by Gibbs, Poole, and Stockmeyer.<ref name='RS'>N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer, "An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix," <i>SIAM Journal of Numerical Analysis</i>, <b>13</b>, 236-250 (1976).</ref> | |||
# In scripted files, The <tt>Resequencing</t> command should come after the other <a href="definemesh.html">meshing commands</a> are done</li> |
Revision as of 21:34, 10 September 2013
The Resequence command is used to renumber the numbers in an attempt to minimize the bandwidth of the problem. The smaller the bandwidth, the faster will be the FEA calculations.
Scripted Input Files
The two options in scripted input files are
Resequence (x),(y)
or
Resequence (id)
where
- (x, y) define the coordinates (in mm) for a point (or <rr>(R, Z)</rr> coordinates if axisymmetric). The resequencing will start at the one node nearest to that point.
- (id) is a previously defined keypoint. The resequencing will start at the node at that keypoint.
XML Input Files
In XML files, the two options, which must be within the <GridBCs element, are:
<Resequence x='(x)' y='(y)'/>
or
<Resequence keypt='(id)'/>
where (x), (x), and (id) are the same as define above.
Notes
- It is best to start the resequencing at a node on the boundary of the object and probably on a corner. The final bandwidth may depend on the node selected for resequencing. The bandwidth is reported in FEA output results. You can vary the resequencing node to find the minimum value.
- Another use of this command is to verify mesh connectivity. Since disconnected sections of a static FEA mesh will cause a singular stiffness matrix, the calculations will fail. This command will find such connectivity problems before the calculations start.
- The algorithm used to resequence the nodes in described in a paper by Gibbs, Poole, and Stockmeyer.[1]
- In scripted files, The Resequencing</t> command should come after the other <a href="definemesh.html">meshing commands</a> are done
- ↑ N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer, "An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix," SIAM Journal of Numerical Analysis, 13, 236-250 (1976).