MATRIX EQUATION ANALYSIS IN THE FINITE ELEMENT

METHOD
By
T. -:'{AGY

Department of G"il Engineering 11echanics. Budapest Technical Lniversity

(Received September 6. 1969)
Presented by Prof. Dr. T. CHOL:'i'OKY

1. Introduction
Since \V orId War the event of digital computers, together with prob-
lems raised bv the ail:plaJlle and rocket industry. stimulated the deyelopment
of appropriate up-to-date structural analysis metho ds suiting actual require-
ments and the available computer technique. Far from applying the methods
already known, making use of the possibilities preEcnted by the speed of
computer metbods to solve eyer greater problems. they follow instead entirely
new ways.
The ne'w methods apply the matrix calculuE in a wide range, not only to
simplify the 'writing and programming of algorithms as the natural language
of computation methods, hut also to present an elegant and concise mathe-
matical treatment.
The most widely extended of them is the finite element method, called
by some authors the matrix displacement method. ad\'antageous by its \'er-
satility. Though initially it had heen applied in structural engineering, just
as will be here, essentially it suits to any boundary yalue problem that can
be described hy partial (or ordinary) differential equations, for arhitrary do-
mains, houndary conditions and loads. It is 'widely applied for yihration, heat
transfer and hydraulic prohlems.
The disadvantage of the finite element method is that rather small
problems require operations 'with quite large matrices, exceeding the capacity
of comparatively up-to-date computers, at an important computer time
demand.
In what follows, the finite element method will he hriefly surveyed and
a method 'will be presented, likely to cut computer time and storage capacity
for some frequent hut special cases.

2. The finite element method

2.1 General
A 'well-known fundamental principle of the analysis of hyperstatic
structures is to consider the structure an entity of memhers connected at a
174 T. SAGY

finite number of nodes. If force-displacement relationships for each member

as well as statical and geometrical boundary conditions are known, the behay-
iour of the whole structure can be cleared up. This is the basis of the analysis
of hyperstatic trusses. frameworks, lattices etc.
For surface structures or continua there is in fact an infinite number
of nodes. The method of finite elements eliminates this difficulty by considering
the surface (for simplicity's sake, continua 'will not he treated below) to be
diyided into elements connected at a finite number of nodes, acted upon by
nodal forces between elements (replacing boundary stresses of elements), and
of course, external forces are also considered as acting only at these nodes.
Relationship between nodal forces acting at the elements and nodal displace-
ments are represented by the stiffness matrix of the element (not to be deter-
mined here because of space shortage). From the stiffness matrices of all the
-elements, that of the entire structure can he determined, delivering the rela-
tionship bct"\,-een forces and displacements of the structure as a whole.
Thereby force-inducc>d displacements and from them the stresses can be
determined.
Diyision of the structure into elements, as well as replacement of the
continuous internal stress system by nodal forces is an approximation of real
conditions. Another usual approximation is related to the establishment of
force-displacement relationships for the element. In spite of these approxima-
tions, the method is a useful one, not only by permitting the analysis of till
now (in closed form) untreatable problems, but by increasing accuracy upon
making divisions finer. The fundamentals of this method are due to Turner,
described in detail by ),RGYRIS [4] and ZIEl'KIE"\'ncz [5], or in Hungarian by
BEREl'YI [7].

2.2 Finite element discs

An in-plane loaded plate (disc) is kno'wn to be m a stress state.

A conventional method of analysis is that bv the stress function, with
the differential equation:

C)
SiF , 8 4 I?
T 0 ( 2.1)
8x 2 8y2 8y 4

,,;here F is the Airy streES function, interpreted as:

8 2F
Gv =--: 'Txy (2.2)
- 8x2 8x8y
 MATRIX EQt"ATJO.\" ~L'YAL YSlS 175

Validity of this method is restricted to edge-loaded discs.

In the finite element method, the disc is usually diyided into triangular
elements (Fig. 1). ='iodal forces and displacements can be diyided into compo-
nents of x and y direction. l\ odai forces and displacements will be expressed
by Yectore p and d, rcspectiycly:

Fig. 1

Pi
Pi::
p f

P
[ P!l Ph: d
pi'.'
p,
Pio:

Displacements and loads are reiated by the ,~tiffness matrix k:

kd = p:
or, in particular

[::~
kfi ki.' k

k'f
k" kif
k j{
ku
= [P'J
;,'
(:2A)

Blocks k are now size::: . ::: and represent the forc.> p at the node with
the first subscript produced by the displacement d of the node with the sec-
ond subscript. In case of isotropy problems according to :}Iaxwell's recip-
rocal theorem the matrix k is always symmetric, hence kif k jf •
A rectangular field is conyeniently treated by rectangular elements.
Then d and p will contain 4·:2 elements, and k 4·4 blocks, 64 elements.
Stiffness matrices of all elements being determined, matrix equation
of the entire structure can be compo~ed" Vectars p and d will include forces

5 Pedodka Polytechnica Civil 1-1 ~2.

176 T . ."'.·IGY

and displacements of all nodes consecutiyely, and the stiffness matrix K of

the whole structure will contain as many .:
rows and columns of blocks.' as many .:
nodes there are in the structure. Each block k lj contains the sum of corre-
sponding blocks of the stiffness matrices of all elements inyolving i and j norIes.
Thus, the equation of the structure is of the form:

Kd p. (2.5)

:\' ote that any block k lj differs from zero only if there exists at least one ele-
ment which invob;es both i and j nodes. Thereby most blocks of matrix K
will he zero blocks. and the stiffness matrix K is inyariablv symmetrical.

2.8 Finite element analysis of bending plates

In the case of bending plates, the nodes have three degrees of freedom
(neglecting other displacement possibilities), thu:" an element in the xy plane
has all nodes acted upon hy displacements H'i, q!X, q>y and force components
Pi, Ji ix , lUiy ' For instance. for a triangular element (Fig. 2):

Fip;. :?

·-
1
U',

q Ix

Pi
P

l:iJ
d = (1 (! J-"'
I
•... and p :.::. (2.6)
? l','
Ji
P
Jli,.:
(I'" JJ
L "
 .iIATRIX EQCATIO.Y [Link] ,"SIS 177

Accordingly" size of the block kif will be 3 . 3. Thereafter the procedure

will be as bdore.

3. Proposed method of treatment for the hypermatrix equation

3.1 The h)permatrix equation

The finite f>lement method was seen to lead to the matrix equation

(3.1)

(3.2)

Stiffn('ss matrix K in thc equation can be composed of stiffness matrices

of the -elements. If both the domain and the elements are rectangular, matrix K
is a of special structure, with hypermatrix l)locks:

K A B -I
B* A B

(3.3)

I B* A B
B* A
L
when~

A a h
b* a b

and 1- (3.4)
 178 T.l"AGY

Blocks a, b, c, 01 and 02 are linear combinations of elementary stiffness rn:atrix

blocks, with sizes equalling the numbers of freedom of the nodes..
1 2 k n
,/// '.c:.'
! I
I 1 ! 1
I !
I I I i i
i
1

I I i
I I I
1 I
\
1
I
1
I
i I ! i !

\ I !
i
'n
I I ! I
I
/
\
,/
\
/
I 1
'/
i
! I
',/,//"</

J X

The stiffnei's matrix of the system was seen to be a

matrix. 'i,-jtll non-zero hlocks
most blocks of this h ypermatrix are zero. In case of a probici:il
(Fig. 3) the matrix of order m . n . S contains m~ . n 2 • 52 among
them at moEt (3m-2) (3n-2)s2 non-zero ones, a minor part of aB
thus it is uneconomical to store and handle the entire matrix both from storage
capacity and running time aspects. Often hut the upper band is
with (m -2) . m . n . s~ elements, but also here the non-zero eiemcrrts are a
minority, at most 4,mns~.
Fig. 4 shows the logarithmic plot of the above values for the range
·s 2 to m = n = 4 "" 22. For m = n = 22 the entire matrix contains nearly
-one million elements. with less than ::: % non-zero ones, there being about
;50,000 elements in the half-band, with a mere 15% non-zero ones.
Because of the high number of elements, the main store of the computer
is insufficient even for rather modest problems, hence external store (magnetic
 .YATRIX EQ!:.4TIO.'V A.'VALYSIS 179

./

/ /
/ /
/
.I /

."- ---

Fig . .•

drum, magnetic tape) has to be applied, inconyenient because for pxternal

store the frequent input exchange much increases running time.
The proposed method demands a mere "-' 5mns, thus it is accp:-sible
to rather small computers .

.3.2 Some matrix relationships

Without entering into details, some less known matrix relationships will
briefly be presented, described with all particulars by e.g. :~VL-\cDuFFEE [3].
Direct product of two matrices is defined by the identities:

and A X· B (3.5)

From definition (3.5) is is easy to verify the following identity:

180 T . .I·.·JG}"

Introducing symbol n of the direct product defined by the identity

11
n Ai - Al . >< A~ .
;=1

the identity

n
1=1
(AiBiCi)- (f1 Ai)
1=1 ,1=1
(n (h Bi) Ci
1~1,
) (3.7)

that will be later of importance, can be proyed by mathematical induction.

Applying direct multiplication, the hypermatrix K, resembling to the
hypermatrix K, and subject to stipulations

a aoo
h = h* a lO

c c* (3.8)

can be written as a direct polynomial:

En:
(3.9)

where Em and arc unit matrices of m and n order, and

denotes the uniform continuant matrix of order In.

,-
0
1
1
l'"
I. (3.10)

I
m 1 0

In yie·w of the fact that the zero-th power of any (square) matrix is the
unit matrix of corresponding order:

1 1
K 2' .::2 aij /, Bin . >< B!,. ([Link])
j=O ;=0
 ·\UTRIX EQL1TIO.Y ASAL YSIS 181

3.3 Quasi-spectral decomposition of a direct polynomial

Let us soh-e the problem for the general case first. Let the spectral
decompositions of matrices Al , A2 ••• Ai ... A" of simple structure and of
71 1,11 2 , •• nf . . . ne order in the form:

(3.12)

Theorem: The so-called quasi-spectral df'composition of thf' direct polynomial

n1:

N 2£' C,ul fl'2 uQ

j
.. , . X (3.13)
l': ;;-~O

of the order

n ni
i~O

is grven by the formula:

) {fIl!l~O
(,

N (F
.1LJ r: u
/
n
1=1
(3.14)

IF
.![Link] n
i=l
vrv-l. (3.15)

In the following the matrices

'1/=

and
1
(3.16)
rn~

.2
l11=0
C 1'1/"2 ••• :vlQ ,s Af 1
'will be called quasi-modal and quasi-spectrum. respectiyely.
Proof: Consider a term TU!!"",uD of the direct polynomial (3.13) belonging
to settled PI' f./2' ••• Pe values and substitute the spectral form of Ai matrice8
as well as the identity

CU"JL",
. ._ . " !.lQ
(3.17)
to yield:

(3.13)
1=1
11)2

From the identity (3.7):

[En • . >~n U i) ('

l=tl
Cf-L1!l" ... f-LQ • X n A1i) (En o .
l=l

Summing up and facto ring out the first and the last term in brackets (occur-
ring in all terms of the sum):

Q.E.D.
Note that the proyed theorem can be considered a generalization of a
theorem by EGERY_~RY [1]. It should be stressed that proof of the theorem had
the only restriction for the coefficient matrices lC",!l, ... UO to he regular and the
blocks were not required to he commutable. -
In the special case of the general theorem above ,,-here the direct poly-
nomial has scalars cl':I',' '!'e as coefficients, the spectral decomposition of the

hypermatrix of n = ni order

(3.20)

is deliyered hy the identity

D

"'2 n
i=l
j i~l Lt) rV-l (3.21)

where modal matrix is the direct product of modal matrice5 and spectrum
r is a diagonal matrix with polynomials of matrices as elements.

3.4 Solution of a matrix equation with a direct polynomial coefficient

Let us consider the equation

Nx (3.22)

where N is a direct polynomial according to (3.13), x and y are vectors of n

order.
 MATRIX EQCATIOS .LVAL YSH 183

Also vectors x and y can be obtained as direct polynomials:

ne n, n, n
x .;z .. .2
"
/'
-"'='
AVI"Z •.. Ye tJ et'i
Ye=l Y~=l ?l=l ;=1
1 (3.23)
y -
ne
~
n,
'>'
Y:t=l
YV 1!-'2 •. . t'e
n
[J e",
i=! I
"y·here and Y"""""'D are vectors of no order:
e.i is the ),;-th uriit vector of ni order;

e" are unit vectors of n/no order.

Let us introduce the following subscript convention:

for
i=1
where

an arbitrary element of A is:

(3.24)

and an arbitrary element of B = C . is:

(3.25 )

subscripts are related by:

r-l 2 fffi
H,:=o
1=0
nk _ 1 )' (ri , t1
1 ')}

I
(3.26)
s I~ .?; Ilg ,-,Jr', In n

where n_ 1 = 1 by definition.
Introducing a similar subscript convention for ,'ectors x and y
(3.27)
where

(3.28)
184 1'. T4GY

Replacing expressions for l'i, x and y into (3.22) 'we obtain

hA't,I.
i~l [

. lE .Tq)

>" n
i~l
C"i' (3.29)

Let us examme first matrix product:

In view of identity (3.7), it i" oIn-ious that:

n() iI
i=1
(if I (En"
!
/", n L;-I)
i ~= 1
-- Eno n
i=1
(lT i

(3.30)

According to thi~ relationship the matrix equation has the solution:

X N-ly.
or, in detail

n"
C,':
:·-d
-1

lE
,no . >' (3.31)

Let us exaIllme the product of the four factors. Let us consider first the
product of factors "3 and I of n order, denoted by g:

c' 1 (3.32)
ne"i[ .
i=1
 .\IATRIX EQCATIO.' A.\·AL YSIS 185

Putting facTor ~. under the sign of summation. and taking relationship (3.7)
into account. we may write:
n
g tI ViI e" (3.33)
i=1

DenQting the 1':-th columll vector of the ilrverse of the i-th modal matrix bv
Le. :
(3.34)

e,

g n n;-:;:n (3.35)
Q= i=1

_-\ term f of the above summation. belonging to fixed )'1' re; .

y". >< n
i=l
(3.36)

A vector hlo'Ck of t"l"O'" "Q IS as follows

(3.37)

After summatIOn. an elementary vector gr of g is:

111 ()

gr ::; Y, 1 ," . . . le tI 11
(3.38)
,,=1 i=1

Con5idering vectors g and y of dimension n as tensor", G and Y of q - 1

order in a Cartesian system, matrices Di l as tensor", of second order
and their direct product as tensors of order 2q, relationship (3.38) can also
be interpreted so that tensor G = [gr] is the transformation of tensor Y [Yr]
with respect to tensors Ui 1 or, by other words, the contraction of 4 tensor",
with tensors Li l , with respect to the second subscript. With tensorial notation :
(-1)
Y"i U i,r,,'; (3.39)
or
G = Y><D-l (3.40)

where is the symbol of contraction.

Returning to Eq. (3.31), let us consider factor '1.:

1'-1 = (3.41)
186 T. NAGY

In this expression all factors of the direct product are diagonal matrices,
thus, the whole term in brackets will be a hyperdiagonal matrix, with blocks
of order n:
m: m1 (l

::E ::E
,ti:=O P-t=O
[Link] .,",: ....!.le n
i=O
}Jt.~,. (3.42)

Since the inverse of a hyperdiagonal matrix is also a hyperdiagonal one and

blocks of the inverse are the inverses of its blocks:

(3.43)

From this expression it is obvious that this procedure is only valid if of the
polynomials with matrix coefficients CU:Ll, .•. lI.~, eigeDvalues of matrices Ai
are regular. The product of hyperdiagonal matri~ 1
r-
by vector g can be illust-
rateo schematically as:

r- 1

Apparently:
\ -1

J ~ gPIP~. ,P2 (3.44)

'A-here and g,-J, are vectors of dimension n" and IS a matnx of order no.

With tensoriai notation . rand Rrp tensors of order Q '1.

o and G are tensors of order (! -'-. 1:

relationship (3.44) is by tensorial notation:

0= r- 1 ~ G (3.45)

where ~ IS symbol of the so-called logical multiplication defined as:

(3.46 )
 187

Nothing but the previously discussed operation of multiplying by a quasi-

modal matrix is left to solve Eq. (3.22). By tensorial notation:

x = U, lI"-l S (U-J Y)}. (3.47)

3.5 Special cases

3.51 Solution of the Poisson differential equation b.Y the method of finite
differences. Both for biharmonical and Poisson equations the method of finite
differences leads to a matrix equation "lvith a direct polynomial coefficient of
scalar coefficient, e.g. to thl:' Poisson equation of the form:

wherl:': GOD = -4
G I0 = a Ol = -1
all = 0

Solution with tensorial notation will be:

{I"-l (3.49)

Innermost contraction:

m n
(3.50)

considering Yectors p and g as matrices G = [gr,r,] and P = [p,.".,], taking

into consideration that since B is a symmetrical matrix, its spl:'ctral form is
B = LT L 'C*

G (3.51)

)fow I"-l IS a diagonal matrix:

1
I"-l =

this again can be considered as a two-dimensional matrix:

188

and now the logical multiplication will consist III multiplying elt"lllellts with
appropriate subscripts by each other:

D r- 1
(U",PU n )· (3.52)

Contracting again yields:

-W'- = UI In
,f r- 1 (3.53)

remlt analogous to the matrix equation method developed hy SZAB6 [2] for
the difference method for the solution of partial differential equations of eyen
order.
This justifies the statement that this method can he considered a general-
ization of the matrix equation method.
3.52. The finite dement method, the disc problem. Analysis (If n'ctallgular
discs with rigidly clamped edges hy the finite element method leac15 to matrix
equation (3.1), 'where the structure of ma~'ix K is found in (3.3) and (3A).
Matrix K differs but slightly from matrix K defined by (3.11), tht'refore no'w
only the hypermatrix equation

f (3.54)

will be discussed. Iteration can be applied to take into account the deYiation
and the deyiatioll excess due to accidental \ariations of the boundary eOIlcli-
tions, to be reconsidered in item 3.6.
Remind that Kis a hyperrnatrix of In 7Z b1uck rows and block c'olumns,
with a structure expressed by the relationship:

is a hlock of second order, while relationship;; and are simph' cou-

tinuous matrices of m and n order, respectiyely.

Vectors w [ lCi.i.d and [f f,J,J

contain displacement and external force components of disc nodes. subscripts

indicating rows, columns of the point and the direction x or y in this order.
Thus, Yectors '\\- and f can he considered three-dimensional matrices (blocks)
(of the type m . n . 2). ~ ow, the procedure is the same as in item 3.51. to
yield:
(3 ..36)
When interpreting Eq. (3.56), remind that:

matrix multiplication of a three-dimemional block from left and

right IS defined by reEpectiYe expreE5ions

m
G L F: gijf: '" uJ;>
~ - (3.57)
!=l

111
G Ft!: f.'I. /1, (3.58)

that is, any layer of matrix F is to he multiplied by "C:

-1
is defined as: (3.59)

. a tWO-(1"1I11enSlUna 1 matnx.
\\' 11ere '(if-1 IS . If al'} matrIces
. are diagonal matri-
Cl'S. then also will he a diagonal matrix.
the logical multiplication D = r- 1
G:
a) if ,(-1 iE 11 matrix

df!,; (3.60 )

b) if is a diagonal matrix. then a150 r -1 can be eon:::idered a three-

dimensional block, and the logical multiplication can be interpreted Cl5 the
product of elements of both blocks \\-ith the 5ame suh:"cripts.

3.6 Solution of the hypermatl'ix equation b... iteration

A5 it was 5een in 3.1 and 3.2 in case of rectangular domain and rigidly
clamped edge, the stiffness matrix of the finite element method is a matrix
K close to the direct polynomial K. If houndary conditions or eyentually the-
5hape of domain yary, the stiffness matrix will differ by more from the direct
polynomial K. Therefore the equation 5Y5tem of the finite element method
lend5 it5elf to iteration. Let U5 see now the conyergencp condition of thc iter-
ation
Kx=y (3.61)

where K differs from the known (quasi) 5pectrd-deeomposed matrix N onh-

by a matrix F, so that:

F. (3.62)
190 T. SAG"-

Substituting and solving for X'

x N-1 (Fx + y), (3.63)

expression readily iterated in form:

.
Xn-i-l -- ;;',-1
l' (F'Xn -;-, y-) (3.64)

Obviously, since two subsequent iterations are related by the constant matrix

H N-JF (3.65)

convergence of the iteration has as condition:

./ N (3.66)

with F norm of matrix F.

Since the proposed method ha::: the advantage of not to establish the
large-size coefficient matrix hut only some factors of the direct polynomial.
and considering that hlocks of the coefficient matrix are combinations of the
blocks of the elementary stiffness matrix, two rather rigorous criteria have
been proved for the convergence, 'which 'we can, however, easily handle in
our case.
Provided blocks of matrices Nand F are known. a sufficient condition
of the convergence i~ the inequality

(3.67)

to b{' valid for each block of identical subscript.

Proyided hypermatrices Nand F are direct polynomial;; of the same struc-
ture. i.e. they only differ the coefficients a,. and a sufficient condition
of the convergence is thf> inequality

.~-: ail (3.68)

to be valid for each pair of coefficient hlocks (where Cind arc coefficients
of direct polynomials and respcctively).

4. Conclusions

Last but not least, one may 'wonder why to apply spectral decomposi-
tion, a complex and tedious procedure, and besides iteration. instead of directly
soh-ing the matrix equation?
 JUTRIX EQC1TIO.Y [Link] YSIS

Stiffness matrices for the finite elements 'were seen in item 3 to be rather
large-size ones. Among their elements and blocks, hO'wever, there is an obvious
majority of zero blocks and zero element;:, a percentage further growing with
increasing sizes (and refined divisions). As a conclusion, storage of the entire
matrix, and conyentional solution of the equation system, is almost impossible
but at least yery lengthy a procedure fCYCn for the most up-to-date computer5.
Let us comider a disc problem of 20 by 20 diyisiom. The coefficient matrix
measures 2 . 20 . 20 = 800, its elements amounting to 640 000. A single solu-
n3
tion of thE' equation system bv Gaussian algorithm requires ~~ - 17· 10'
- .• ~ 3
operations of multiplication and diyisiol1, "without mentioning the external
storage., needed "because of the matrix much increasing the running time.
Current methods requiring to store hut th,' upper nOll-zero hand still
mean in our case to store 800 . (2 -;- 20) . 2 = 35 200 elements, and according
to BERENYI [8], there will be 167 000 operatiom for the first, and 67 000 for
any subsequent solution.
The method proposed here has t·wo advantages:
1. Reduction of occupied storage capacity, storage involving:

matrices occupied storage place:

diagonal matrices Ai: ni

vectors d and p: 2s n nE

coefficient matrices aij (or C"'!""""!'n)'

For the presented case this amounts to 800 .to - 1600 +
16 = 2456.
A few vector places are still needed for iteration, so not more than 5000 words
are needed, available even in the main store of a small computer of lVIINSK-22
or GIER type.
2. Reduced running time. One step of iteration requiring in fact 4s
multiplications bet"ween m by n matrices: this means in our case 8 . 20 3 ~~
~- 64000 simple operations. For a rapid convergence, the process is equivalent
or but slightly slower than the band matrix system.
One may ask why the time for the spectral decomposition is not account-
ed with the running time? It is because there exist simple trigonometric
formulae for the spectral decomposition of the uniformly continuant matrix
B, appropriate to establish both modal and spectrum elements in some seconds
(or fraetions thereof). And here another significant advantage appears: modal
matrix U of matrix B needs not be stored in fulL since in knowledge of the
first vector, the others can be obtained by simply changing the sign and the
element.
If, however, the spectral decomposition of the factors of the direct
polynomial is not available in closed form, the economy of the method needs

6 Periodic. Polytechnica Ciyj] BI~.

192 T. SAGY

a preyious analysis. Anyhow, the method seems to be economical in cases

where similar structures are to he designed for different loads, since then the
work of speetral decomposition emerges only once.

Summary
After a short presentation of the finite element method. its use for dii'cS and bending
plates will be dcscribed. The stiffness matrix can often be written as a direct polynomial or
in a rather similar form. So-called quasi-spectral decomposition of the direct polynomial is
:,uggested for the matrix equation. correcting the deviation from the direct polynomial by
iteration. The method is advantageous in that it suffices to produce and store a mere of 4-5
vectors rather than to produce the entire stiffness matrix so that it lends itself to the use of
a computer of mcdium size.

References

1. EGER"\":~R):. J.: H ypermatrices of blocks interchangeable in pairs and their use in [Link] grid
dynamics. (In Hungarian) }lTA Alk. }lat. Int. Kozl. Ill, (196·1).
~. [Link], J.: Ein }Iatrizenverfahren zur Berechnung von orthotropen stiihlernen F ahrbalm-
platten. 'Wisscnschaftliche Zeit:;chrift der Technischen Hochschule, Dresden, 9 Heft 3.
(1959,60)
:1. }IAcDcFFEE, C. c.: The theory of matrices. J. Springer. Berlin 193.3 .
.1. c\.nGYRIs, J. H.: Recent adva;lces in matrix methods of s1rllctural analysis. Pergamon
Press. Oxford. 1964 .
.;. ZIE::\"KIEVVICZ, O. c.- CHEl:::\"G. Y. I\:..: The finite element method in structural and conti-
nuum mechanics. ::\IcGraw-Hill. London. 1967.
() [Link], c.: J. :'IIath. pnres app!. Y. Y. 6, 73-120 (1900).
- BERE::\"YL}I.: Analysi5 of fk:mral plates by the "finite elemelit" method. (In Hungarian)
lYIHyepitestudomanyi Szemle XIX, ~83- 286 (1969).
8. BERE::\"YL ;\1.: Solution of linear equations in hyperstatic prohlems. (In Hungarian), ::\lanu-
script.

First Assistant T alll~\~ ~\AGY. Budapest :\luegyetem :3 Hungar y