26.10.2014 Views

JAEA-Data/Code 2007-004 - Welcome to Research Group for ...

JAEA-Data/Code 2007-004 - Welcome to Research Group for ...

JAEA-Data/Code 2007-004 - Welcome to Research Group for ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

The next step is <strong>to</strong> scan whether the line intersects or not with any rod. This scanning is done,<br />

first, on the outermost radius of a rod. If judged <strong>to</strong> intersect, the in<strong>for</strong>mation <strong>for</strong> the two crossing<br />

points with the circle is inserted in<strong>to</strong> the table by a routine ”INSERT” which finds the positions in the<br />

table <strong>for</strong> the new two points rearranges the arrays T, IR and IL so that the elements may be in the<br />

geometrical order.<br />

After the insertion, then, the scanning on the inner radius of the same pin rod is continued until<br />

the innermost radius if judged <strong>to</strong> intersect, otherwise the scanning is transferred <strong>to</strong> the next pin rod.<br />

After scanning all pin rods, the preliminary trace table is organized <strong>for</strong> the neutron line illustrated in<br />

Fig.8.1-6a as follows:<br />

Table 7.1-2 Preliminary trace table after scanning all pin rods<br />

k 1 2 3 4 5 6 7 8 9 10 11 12<br />

T l AM lBM<br />

l CM l DM lEM<br />

lFM<br />

lMG<br />

lMH<br />

lMI<br />

l MJ l MK lML<br />

IR 26 16 15 14 13 25 5 6 7 8 26 -<br />

IL - 26 16 15 14 13 25 5 6 7 8 26<br />

The final table is further rearranged as;<br />

• Compose a new array II which keeps the T-Region numbers reduced from the array IR which<br />

keeps S-Region numbers using the correspondence specified in the input. Because of the 60°<br />

rotational symmetry, the common T-Region numbers are assigned <strong>to</strong> each pin rod region.<br />

• Replace the element of T <strong>for</strong> the distance between the intersecting point and the point M by the<br />

distance between the two adjacent intersecting points.<br />

Table 7.1-3 Final trace table at return step of geometry routine<br />

k 1 2 3 4 5 6 7 8 9 10 11<br />

T l AB l BC l CD lDE<br />

lEF<br />

lFG<br />

lGH<br />

lHI<br />

l IJ l JK l KL<br />

II 6 4 3 2 1 5 1 2 3 4 6<br />

The in<strong>for</strong>mation obtained by the geometry routine is the common length of arrays, L0, the arrays T<br />

and II and the modified ρ value; ρ’ measured from the center of the adjacent cell which will be traced<br />

next if the perfect reflective boundary (mirror) condition is selected.<br />

For the case of the mirror condition, the root routine calls repeatedly the same geometry routine<br />

with the adjusted arguments (ρ and ϕ) until the specified number of cells are traced, and concatenates<br />

242

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!