Caiwei at 22:27, 18 December 2007

2007-12-18T22:27:25Z

← Older revision		Revision as of 22:27, 18 December 2007
Line 1:		Line 1:
	DDLab has a function <tt>consistencycheck.m</tt> that checks the self-consistency of the input dislocation structure before starting the DD simulation. The function <tt>consistencycheck.m</tt> is called near the very beginning of <tt>dd3d.m</tt>		DDLab has a function <tt>consistencycheck.m</tt> that checks the self-consistency of the input dislocation structure before starting the DD simulation. The function <tt>consistencycheck.m</tt> is called near the very beginning of <tt>dd3d.m</tt>

			This function checks not only the input structures <tt>rn</tt> and <tt>links</tt> but also the auxiliary data structures <tt>connectivity</tt> and <tt>linksinconnect</tt>, which are created by function <tt>genconnectivity.m</tt>.

	In the version <tt>ddlab-2007-12-18.tar.gz</tt> or newer, the <tt>consistencycheck.m</tt> does the following checks. Items 3, 4, 5 are general checks that are in principle necessary for any DD simulation program. Other items are specific to the DDLab data structure and algorithm implementation.		In the version <tt>ddlab-2007-12-18.tar.gz</tt> or newer, the <tt>consistencycheck.m</tt> does the following checks. Items 3, 4, 5 are general checks that are in principle necessary for any DD simulation program. Other items are specific to the DDLab data structure and algorithm implementation.

Caiwei: added content

2007-12-18T21:59:34Z

added content

New page

DDLab has a function <tt>consistencycheck.m</tt> that checks the self-consistency of the input dislocation structure before starting the DD simulation. The function <tt>consistencycheck.m</tt> is called near the very beginning of <tt>dd3d.m</tt>

In the version <tt>ddlab-2007-12-18.tar.gz</tt> or newer, the <tt>consistencycheck.m</tt> does the following checks. Items 3, 4, 5 are general checks that are in principle necessary for any DD simulation program. Other items are specific to the DDLab data structure and algorithm implementation.

1. the length of the connectivity matrix should be the same as that of links

2. connectivity matrix: each row correspond to a node,
only the first 2*numNbrs+1 entries in each row can be non-zero
where numNbrs is the number of neighbors for this node

3. Burgers vector conservation at every node (if flag != 7)

4. a node cannot be connected to another node twice

5. a link cannot have zero Burgers vector

6. a node cannot be connected to the same link twice in the connectivity matrix

7. consistency between "connectivity" matrix and "links" matrix
if node i has a link j, then link j must have node i as one of its end nodes

8. check the consistency between the "connectivity" matrix and the "linkinconnect" matrix

DDLab Input Consistency Check - Revision history

Caiwei at 22:27, 18 December 2007

Caiwei: added content