Partitioning of an Element: Difference between revisions

From Dialogic Design Science
Jump to navigation Jump to search
(Created page with " Partitioning on an element is used in a cyclical way to order the indexing of the matrix under development. In the process of partitioning, data are supplied that partially f...")
 
No edit summary
Line 1: Line 1:
'''Partitioning on an Element'' is used in a cyclical way to order the indexing of the matrix under development.


Partitioning on an element is used in a cyclical way to
In the process of [[Partitioning|partitioning]], data are supplied that partially fill the matrix. Each cycle may involve several parts, and each part involves the ''same four steps'':
order the indexing of the matrix under development. In
 
the process of partitioning, data are supplied that partially
* First cycle has only one part, and four steps  
fill the matrix. Each cycle may involve several parts, and
* Second cycle may have as many as three parts, depending on the results of the first
each part involves the same four steps. The firstc ycleh as
cycle.  
only one part, and the four steps will be described shortly
* Third cycle may have as many as nine parts
in describing the first cycle. The second i;yde may have as
* The nth cycle may have as many as 3<sup>n-1</sup> parts.
many as three parts, depending on the results of the first
 
cycle. The thirdc yclem ay have as many as nine parts, and
Experience suggests that only a few cycles will normally be needed to develop a [[Reachability Matrix]], and the number of parts will seldom be as high as the stated maxima.
in general the nth cycle may have as many as 3•- 1 parts.
Experience suggests that only a few cycles will normally be
needed to develop a reachability matrix, and the number of
parts will seldom be as high as the stated maxima.






[[Category: ISM Terminology]]
[[Category: ISM Terminology]]

Revision as of 11:33, 10 January 2022

'Partitioning on an Element is used in a cyclical way to order the indexing of the matrix under development.

In the process of partitioning, data are supplied that partially fill the matrix. Each cycle may involve several parts, and each part involves the same four steps:

  • First cycle has only one part, and four steps
  • Second cycle may have as many as three parts, depending on the results of the first

cycle.

  • Third cycle may have as many as nine parts
  • The nth cycle may have as many as 3n-1 parts.

Experience suggests that only a few cycles will normally be needed to develop a Reachability Matrix, and the number of parts will seldom be as high as the stated maxima.