principles and applications of microearthquake networks
principles and applications of microearthquake networks
principles and applications of microearthquake networks
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
5.1. Mathematical Treatment <strong>of</strong> Linear Systems 113<br />
sidual vector r = Ax - b equal to zero. In the least squares method we<br />
seek a solution in which llr11* is minimized, where llrll denotes the Euclidean<br />
length <strong>of</strong> r. In matrix notation, we write llr1p as (see Draper <strong>and</strong><br />
Smith, 1966, p. 58)<br />
(5.33) llr112 = (Ax - b)T(Ax - b) = xTATAx - 2xTATb + bTb<br />
To minimize ~ ~r~~*, partial differentiate Eq. (5.33) with respect to each component<br />
<strong>of</strong> x <strong>and</strong> equate each result to zero. The resulting set <strong>of</strong> n equations<br />
may be rearranged into matrix form as<br />
(5.34) 2ATAx - 2ATb = 0<br />
or<br />
(5.35) ATAx = ATb<br />
Equation (5.35) is called the system <strong>of</strong> normal equations <strong>and</strong> is an evendetermined<br />
system. Furthermore, the matrix ATA is always symmetric,<br />
<strong>and</strong> its eigenvalues are not only real but nonnegative. By applying the<br />
least squares method, we not only get rid <strong>of</strong> the incompatibility <strong>of</strong> the<br />
original equations, but also have a much nicer <strong>and</strong> smaller set <strong>of</strong> equations<br />
to solve. For these reasons, scientists tend to use exclusively the least<br />
squares approach for their problems. Unfortunately, there are two serious<br />
drawbacks. In solving the normal equations by a computer, one needs<br />
twice the computational precision <strong>of</strong> the original equations. By forming<br />
ATA <strong>and</strong> ATb, one also destroys certain information in the original system.<br />
We shall discuss these drawbacks later.<br />
5.1.4.<br />
Analysis <strong>of</strong> an Arbitrary System<br />
Since the determinant is defined only for a square matrix, we cannot<br />
carry out an eigenvalue analysis for a general nonsquare matrix. However,<br />
Lanczos (1961) has shown an interesting approach to analyze an<br />
arbitrary system. The fundamental problem to solve is<br />
(5.36) Ax = b<br />
where the matrix A is m X n, i.e., A has rn rows <strong>and</strong> n columns. Equation<br />
(5.36) says that A transforms a vector x <strong>of</strong>n components into a vector b <strong>of</strong><br />
rn components. Therefore matrix A is associated with two spaces: one <strong>of</strong><br />
rn dimensions <strong>and</strong> the other <strong>of</strong> n dimensions. Let us enlarge Eq. (5.36) by<br />
considering also the adjoint system<br />
(5.37) ATy = c<br />
where the matrix AT is n X m, y is an rn-dimensional vector, <strong>and</strong> c is an