VOL. 15 NO. (1992) 41-46
A NOVEL INTERPRETATION OF LEAST SQUARES SOLUTION
JACK-KANG CHANNorden
Systems 75 Maxess
Road Melville,New
York11747
(Received March 5, 1991 and in revised form August 21, 1991)
Abstract.
We
show that the well-known leastsquares (LS)
solution ofan overdeterminedsystemof linear equationsisa convex combination of all the non-trivial solutionsweighed bythesquares
ofthe corre- spondingdenominator determinants of theCramer’s
rule. ThisLeast Squares
Decomposition(LSD) gives
an alternate statistical interpretation of leastsquares,
as well as another geometric meaning.Furthermore,
when thesingularvaluesofthe matrix of the overdeterminedsystemare notsmall,theLSD may
be abletoprovideflexible solutions.As
anillustration,weapply
theLSD
tointerpretthe LS-solution in theproblemof source localization.Key
Words and Phrases: leastsquares decomposition, leastsquares
solution,overdeterminedsystem, source localization.1980
MathematicsSubjectClassification:15A09, 15A15, 65F20,
56F40 1.INTRODUCHON.
Given an overdeterminedsystemof linearequationsAx
-b(1)
where
A [aij]
is anmxn matrix with m n andrank(A)
n, andb[bj]
is anm-columnvector,and x[x]
istheunknown n-column vector.For
simplicity,we consideronly
real numbers. Thereareat mostdet[A ix...i.;
b:j]
j 1, ...,nx[ix...i,] (2)
det[A" ix...in]
1< < < mwhere
det[A: ix...in],
assumednon-zero,
is thenxnminorformed fromA by
takingtherowsix,..., i,,
anddet[A:ix...in;
b:j]
isthepreviousdeterminant with itsjthcolumnreplaced by
thecorrespondingbi,
fromthe vectorb.
Theleast
squares (LS)
solution is[3]:
Xts (a ’A )-Xa
’b(3)
where
(A’A)-XA’
isthegeneralizedinverseofA. Using
ournotations, the LS-solutioncan be rewritten assolutionsby takingthe sum over thoselarge singularvaluesonly.
LEAST SQUARES DECOMPOSITION.
THEOREM.
det[A ’A A
’b:j] det[A i...i.]’ det[A i...i.;
b:j]
det[A’A , t[A i...i.]l
0For
j- 1 ,n,(4) (5)
det[A: ix...i.]l
2"xi[h..]E (6)
Xj[LS]
.’,
""" E det[A" kx...k.]l
PROOF. We
haveassumed thatA’A
isnon-singular(since rank(A)- n). Note
thatEq. (5)
isa specialcaseofEq. (4),
andEq. (6)
istheconsequences
ofEqs. (2), (3), (4)
and(5).
Thecase whenm nisobvious,because in thiscase,there is
only
one term in the summations. Thecase when n 2 canbe verifiedeasilybydirect evaluation. Theproof
for thegeneral
case isnotationallylengthy. In
orderto illustratethespirit,
wewillprove Eq. (4)
for m 4and n 3in thefollowing. Note
that ifA
iscomplex,
wesimplyreplace
all thetransposesby
theconjugate transposes.SupposeA [ai]4s
and b[bi]4,,r
Thenand
lla
lailai2 auas"
aea, a aea
uAb
LetDz; .det[A: 123]’ .det[A:
123;b:1].
Therefore, a21 a31la
a231,2,3
. ab ab
1,2,3
1,3
aila1.3 a
1,3
aai2bl
a12 a13b2
a22b
a32 a31.2,3ala
1,2,3aa
det[A
’A;A’b:1]-
a42
1
aila2 a41a4.3ab, a.2a
a4.2a4.l a,b, l
atjai2 a43abi ,
aaiz a43l ailb
a41,
ailat1,2,3
1 ai2bi
a42 1,2,32
ai2a3t ai3bi
a4.31,3 aa2
1,2,3 1,2,3
l.zs’aaaz 1.3 a2
For
the thirddeterminant,multiply Column 2 bya4. and add it toColumn 3.For
the fourth determinant, multiply Column 1by
a4.2 and add it toColumn2,thenmultiply Column 1by
a4.3 and add it toColumn 3.We
thenhave,D12 det[A ’A ;A
’b"I]-
ab
a3a2, a,b, asa a
Similarly,
weobtainDI24,DI:;4
andDz. Adding up
alltheseexpressions,we note that the sumofthe second determinantsinthe aboveexpressiongives-det[A ’A;A ’b: 1],
andsimilarlyfor the third andthe fourthdeterminants.Therefore,
D12 +D12 +DI3 +Dz-4.det[A’A;A’b" 1]-det[A’A;A’b: 1]
det[A ’A A
’b1] det[A ’A A
’b1]
de
[A ’A A
b1]
whichistherequired
LSD (Eq. (4)).
Ifallthe singularvalues of
A
arenotsmall,we cannotreducethe summation in theSVD. However,
the
Least Square
Decomposition(LSD) (Eq. (6))
suggeststhat wemay
stillgeta better answerby
summing those NT-solutions whoseCramer
denominator determinants arelarge
inmagnitude.We
willverifytheLSD
formulasand theabove idea via anexample
in thenextSection.In
fact,theLSD
has the same form as awell-known result in statistics: If1 ,,
are unbiased estimators oft9with variancesrespectively,then the linear unbiased minimum variance estimatorof 19iswell known to be
[2]:
-
j-12 (7)
Eq. (7)
isalso the result ofminimizingwhere
E E (e,- e)/ ()
bythemethodofleast
squares [2]. Thus,
if weinterpretthesquares
oftheCramer
denominator determinants astheo "-’s,
the N-T-solutions are the estimatesofthe"true"
solutions,thenEq. (6)
andEq. (7)
are identical.Therefore,the
LSD
has a secondmeaningof"leastsquares" (Eq. (8))!
Eq. (6)
givesasimple geometric interpretation, namely,the LS-solution is the"center
ofmass"
among the NT-solutions. TheLS-solution istherefore lyingnear those NT-solutions whose denominator deter- minants arelargeinmagnitude(or,
smallvariances).
3. AN EXAMPLE.
ConsiderAs
shown in Table 1,there are 4 NT-solutions(see
Columns 1to4inTablel(a)).
The LS-solution is computedfrom(A ’A )x (A ’b),
asshown inColumn 5.
We
have,from Tablel(a),
(44)2(208/44)
+(1)2(57/1)
+(-5)2(-55/- 5)
+(23)2(161/23)
13187(44) (114/44)
+(1)2 (-34/1)
+(-5) (-60/- 5)
+(23) (138/23)
8456(44) (-96/44)
+(1)2 (-44/1)
+(-5) (-10/- 5)
+(23) (-92/23)
-6334and
(44)2+(1) +(-5)2+(23)
2491.Hence
all theLSD
formulas have been verified. Furthermore,the ratioof themagnitude squared(or,
just themagnitude)
of the determinants indecendingorderprovidesinformationabout thesignificantnumber oftermsin theLSD
sum.In
ourcase,wehave(44) (23) (-5) (1)
1 0.27324 0.01291 0.00052Thus,wemaydefinea"conditionnumber"asthe ratio of thelargestdeterminantsquaredtothesmallest.
The singular values can be computed
[1]:
st-7.501111, s2-2.926371, s3-2.273693. Note
thatsls2s3 2491.
None
of thesesingularvalues aresmall,because the rankof the matrix is3.In
thiscase, theSVD
givesnofurtherimprovement,buttheLSD
is still flexibleas illustrated in Tablel(b),
where theLSD
issumming upthe N-T-solutions withlargedenominator determinants indecendingorder ofmagnitude.Thus,we
may
firstfindtheSVD
of thesystemtosee howmany singularvalues are smalltodo thenecessary
rankreduction,then weapply
theLSD
for an ultimateimprovement.(a)
NT-SolutionsandLS-SolutionsX
Cramer’s
rule: NT-SolutionsRows
1,2,3 det=44 208/44 4.72727 114/44 2.59091 -96/44 -2.18182
Rows
1,2,4 det=l 57/1=57 -34/1 -34
Rows
1,3,4 det=-5-55/-5
=11 -60/-5
12 -44/1
-44
-10/-5
=2
Rows
2,3,4 det=23 161/23=7 138/23
=6
LS (SVD)-Solution
det=2491 13187/2491
5.29386 8456/2491 3.39462 -6334/2491
-2.54275
(b) I.SD
SolutionsLSD
Solutions 1det44 208/44
4.72727 114/44 2.59091 -96/44 -2.18182
2dets
44,
23 12855/24655.21501 8190/2465 3.32251
3dets"
44,23, -5 13130/2490
5.27309 8490/2490 3.40964 -6340/2465
-2.57201
-6290/2490 -2.52610
4dets- 44,23,
-5,
113187/2491 5.29386 8456/2491 3.39462 -6334/2491
-2.54275 Table1. Exampleof
Least Squares
Decompositions.sensorsdetermine ahyperbola.
Suppose
there aren sensors(n 3),
thenthe intersection fo all thehyperbolas
willgivethe source location. This is the well knowntechnique
ofhyperbolic fixing.How-
ever, due tonoisytimedelay
measurements, thesehyperbolas
do notintersectataunique point.Usu- ally,
the source isfaraway
fromthesensors and thehyperbolas may
beapproximated by
theirasymptotes.
Theproblem
isnowreduced to asystem ofpairs of 2x2linearequations.A least-squares
solutiongivesthe source location. With theLSD
theorem,weinterprettheLS-solutionas theweighted sum of allpossiblesource locationsaccordingtotheir denominator determinants. Eachdenominator is proportionaltothetangentof theanglebetween thetwohyperbolas.Thus,
ifthehyperbolasintersect at almost arightangle,the source location is more accurate than those intersections at smallangles.
Thisangle
interpretationissimpleandintuitive,and it isjustifiedby
theLSD
theorem. Furthermore,wecanjust
selectthosesolutions withlargedenominatorsonly. Note
that theSVD
methodhas noimprove-ment because the rank isalways 2. Theoptimallocation is the
"center
ofmass"
ofthepossibleloca- tions.Moreover,
insteadof usinghyperbolas,
Schmidt[4]
has shownthatthe source location is thefocus ofaconicpassing throughthe3 sensors,hence the source is on thefocalline. With more than3 sensors, wehavemore than one focal lines. The intersections of these focal linesgivethe sourcelocation(s).
Thus, weactually solvinglinearequations,notjustanapproximation using asymptotesasin thehyperbolic fixing technique.We
can usetheLSD
tointerprettheanglesbetween the focal lines as ameasureof theaccuracy
of the solutions. Formulations of the localization in 3-dimensions usingSchmidt’s method and other equivalentmethods togetLS-solutionshave been done[5], [6]. We
caninterpretall theseLS-solutions usingtheLSD
similar tothe 2-dimensional case.ACKNOWLEDGEMENT
The author wouldlike tothankProfessor
George
Bachman ofPolytechnic Universityfor hisproof reading of the manuscriptand valuablesuggestions,and to the Refereeforhis/hervaluable comments.[ll [21 [3]
[4]
[51 [61
REFERENCES
J.J. Dongarra, C.B.
Moler,J.R.
Bunch, andG.W. Stewart, LINPACK User’s
Guide,Chap.
11,SIAM,
Philadelphia,PA,
1979.A.
Hald,StatisticalTheory
withEngineeringApplications, pp.
243-245, Wiley,New
York,NY,
1952.C.L. Lawson
andR.J. Hanson, Solving Least Squares Problems,
Prentic-Hall,Englewood
Cliffs,NJ,
1974.R.O.
Schmidt,A
newapproach
togeometryof range difference
location,IEEE Trans. Aerosp.
Electron.,
Vol.AF.-8, Nov. 1972,
821-835.H.C. Schau, A.Z.
Robinson,Passivesource localizationemploying intersecting sphericalsurfaces from time-of-arrival differences, IEEE Trans. Acouts., Speech,
SignalProcess.,
Voi.ASSP-35, Aug.
1987,pp.
1223-1225.J.O.
Smith,J.S.
Abel,Closed-form least-squares
source location estimationfrom
range-difference measurements,IEEE Trans. Acoust., Speech, Signal Process.,
Vol.ASSP-35, Dec. 1987, pp.
1661-1669.