A george 1971 computer implementation of the finite

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: r \wave front" techniques: { Select unknowns xi that only depend on themselves They form the initial level set If none, select an unknown on the periphery of the graph { All unknowns that only involve those in Level Set 1 form Level Set 2 { All unknowns that only involve those in Level Sets 1 and 2 form Level Set 3, etc. For nite element problems, this can be regarded as element annihilation { cf. J.A. George and J.W. Liu (1981) Example 13. Consider the problem of Example 12 { Select an element and number the unknowns that are not connected to unknowns on other elements { Remove the element { Proceed to an adjacent element and repeat the process 33 11 00 11 00 Wave-Front Ordering 11 00 1 2 11 11 00 00 11 00 11 00 4 3 11 11 11 00 00 00 11 11 00 00 11 00 11 00 11 00 5 11 00 7 11 11 00 00 11 00 11 00 11 00 8 9 11 00 11 00 11 11 00 00 11 00 11 00 11 00 10 34 6 11 11 11 00 00 11 11 11 00 00 00 12 14 15 13 16 Wave-Front Ordering Wave-Front bandwidth and pro le: p = 13, P = 68 5 6 8 111 000 111 000 7 1 9 1 1111 0 0000 1 1111 0 0000 2 1 0 1 0 4 111 0 011 010 111 000 13 1 1111 3 0 0000 1 1111 0 0000 12 111 000 111 000 15 14 12 34 5 6 7 8 16 9 10 11 12 13 14 15 16 1X 2X X 3X X X 4X X X X 5X X X XX 6 XX 7 XXXX 8 X 9 XXXXX XXX XXX 10 11 XXXXXXXX 12 XX XX 13 14 X X X X X XX X XXXX X XXXXX 15 16 XXXX XXXXXXXXX 35...
View Full Document

Ask a homework question - tutors are online