10 The standard discrete system and origins of the finite element method

loads are found in the form of Eq. (1.3). Each element shown in Fig. 1.3(a) has its own
identifying number and specified nodal connection. For example:
element 1 connection 1 3 4
2 1 4 2
3 2 5
4 3 6 7 4
5 4 7 8 5
Assuming that properties are found in global coordinates we can enter each stiffness
or force component in its position of the global matrix as shown in Fig. 1.3(b). Each
shaded square represents a single coefficient or a submatrix of type Kab if more than one
quantity is being considered at the nodes. Here the separate contribution of each element
is shown and the reader can verify the position of the coefficients. Note that the various
types of elements considered here present no difficulty in specification. (All forces,
including nodal ones, are here associated with elements for simplicity.)
The second step is the assembly of the final equations of the type given by Eq. (1.9). This
is accomplished according to the rule of Eq. (1.10) by simple addition of all numbers in
the appropriate space of the global matrix. The result is shown in Fig. 1.3(c) where the
non-zero coefficients are indicated by shading.
If the matrices are symmetric only the half above the diagonal shown needs, in fact,
to be found.
All the non-zero coefficients are confined within a band or profile which can be calculated
a priori for the nodal connections. Thus in computer programs only the storage of
the elements within the profile (or sparse structure) is necessary, as shown in Fig. 1.3(c).
Indeed, if K is symmetric only the upper (or lower) half need be stored.
The third step is the insertion of prescribed boundary conditions into the final assembled
matrix, as discussed in Sec. 1.3. This is followed by the final step.
The final step solves the resulting equation system. Here many different methods can
be employed, some of which are summarized in Appendix C. The general subject of
equation solving, though extremely important, is in general beyond the scope of this
book.
The final step discussed above can be followed by substitution to obtain stresses, currents,
or other desired output quantities. All operations involved in structural or other network
analysis are thus of an extremely simple and repetitive kind. We can nowdefine the standard
discrete system as one in which such conditions prevail.
1.7 The standard discrete system
In the standard discrete system, whether it is structural or of any other kind, we find that:
1. A set of discrete parameters, say ua, can be identified which describes simultaneously
the behaviour of each element, e, and of the whole system. We shall call these the system
parameters.