FEM for bar structures (statics)
Pełen tekst
Powiązane dokumenty
● during instantiation of a template with a specific type, the compiler replaces each instance of a parametric type with the specified type and compiles the data structure
(1) set the pred pointer on the node preceding the deleted node, and succ on the node to be removed (if there is no node we are looking for, throw an exception or abort the
(1) create two auxiliary pointers: set pred to an empty address, and succ on to the address of the first node (head) and pass the auxiliary pointers towards the end of the list
(1) by comparing values, go from root to children and set the pred pointer on the parent node to be removed, and succ on the node to be removed (if there is no node we are looking
(1) invoke two auxiliary pointers set on the adjacent nodes pred and succ (assume that the pointers next in the preceding nodes pointed to by succ are already inverted, succ is
● sequence container – double-ended queue, dynamic array using non- contiguous storage, a list of arrays. ● fast addition/removal at the beginning and at the end of
This lecture was prepared within project ”The development of the didactic potential of Cracow University of Technology in the range of modern construction”, co-financed by the
Pore pressure at the lower part of the porous column: FEM results for different numbers of time steps for a fine spatial discretization, the dotted line represents very few elements