
38
CHAPTER2/AUGER ELECTRON SPECTROSCOPY
is extremely sensitive to small experimental errors in measuring inten-
sity ratios, often leading to unphysical results. One solution is to use
a fitting routine known as simplex optimization. The basic procedure
is described next.
Consider a system of linear equations:
a
11
x
1
⫹ a
12
x
2
⫹ ...⫹ a
ln
x
n
⫽ b
1
...
(2.12)
...
a
m1
x
1
⫹ a
m2
x
2
⫹ ...⫹ a
mn
x
n
⫽ b
m
.
Here, we need to solve for x⬘
i
s for i ⫽ 1ton, and m is greater than
or equal to n. For a given set of guesses (let us call it x⬘
i
, i ⫽ 1ton),
one can evaluate the sum of square of residuals (SSR), as follows:
SSR ⫽
兺[ f (x ⬘s) ⫺ b
i
]
2
(2.13)
where the summation is from i ⫽ 1tom, and f is a shorthand notation
for the left-hand side of Eq. (2.12). The objective of the simplex
optimization procedure is to obtain a set of x ⬘
i
that minimizes the SSR
and that satisfies a series of constraints imposed on the solution. For
the profile problem we discussed earlier, x
i
is the atomic fraction.
Therefore, it should be between 0 and 1. Also, one can impose a
constraint that the x
i
must follow a certain trend.
For the current problem, the first step is to make (n⫹1) sets of
guesses (x⬘
i
for i ⫽1ton) and to evaluate the corresponding SSRs.
One then follows a prescribed procedure
1
to improve on the guesses
until one arrives at a final set of (n⫹1) guesses that gives an average
SSR below a certain specified value. An average of the (n⫹1) guesses
is then the final solution.
The simplex optimization procedure has the advantage of being
able to introduce physical constraints into the solution and does not
require taking derivatives. The latter feature minimizes the possibility
of divergence errors and allows one to fit a set of data to any function.
In addition, one can introduce algorithms to avoid being trapped in
local minima.
1
Four operations are used to approach the point of minimum SSR: reflection,
expansion, contraction and shrinkage. Please refer to the article ‘‘Fitting curves to
data’’ by Caceci and Cacheris, Byte, p. 240, May 1984.