A.10 Convolution 351
matrix, the recipe for inversion is:
if A =
ab
cd
then A
−1
=
1
det(A)
d −b
−ca
,
where det(A) is the determinant of the matrix A.
Inversion of an order three matrix is achieved by the following recipe:
if A =
⎛
⎝
a
11
a
12
a
13
a
21
a
22
a
23
a
31
a
32
a
33
⎞
⎠
, then form C =
⎛
⎝
c
11
c
12
c
13
c
21
c
22
c
23
c
31
c
32
c
33
⎞
⎠
, where c
ij
is the
determinant obtained from A by removing the ith row and jth column
and multiplying by (−1)
i+j
. We then have:
A
−1
=
1
det(A)
C
T
.
This recipe will work for any order of matrix, but it is extremely inef-
ficient for orders higher than three. Larger matrices are best inverted
using Gauss elimination, as mentioned earlier. It is a commonly believed
fallacy that matrix inversion is necessary for solving systems of linear
simultaneous equations. Since it is quicker to solve equations than to
calculate an inverse matrix, the inverse should be calculated only if it is
specifically required, for example, to estimate standard uncertainties of
parameters determined by the equations.
A.10 Convolution
Convolution is an operationthat affectsthe lives of allscientists. Since no
measuring or recording instrument is perfect, it will affect the quantity
that is detected before the recording takes place. For example, loud-
speakers change the signal that is fed to them from an amplifier, thus
altering (hopefully slightly) the sound that you hear. The mathematical
description of this is called convolution. It also appears in the mathemat-
ics of crystallography, although many people function quite adequately
as crystallographers without knowing much about it.
The simplest example of convolution is in the description of a crystal.
The convolution of a lattice point with anything at all, e.g. a single unit
cell, leaves that object unchanged. However, the convolution of two
lattice points with a unit cell gives two unit cells, one at the position
of each lattice point. A complete crystal, therefore, can be described as
the convolution of a single unit cell with the whole crystal lattice. This
would seem to be an unnecessary complication except for the intimate
association of convolution with Fourier transforms.
The convolution theorem in mathematics states that: “the Fourier
transform of a product of two functions is given by the convolution
of their respective Fourier transforms.” That is, if c(x), f(x) and g(x) are
Fourier transforms of C(S), F(S) and G(S), respectively, the theorem may