Direct linear transformation: Difference between revisions

Content deleted Content added
m Minor fix in the lead
Ollydbg (talk | contribs)
m emphasize the words DLT
Line 19:
Solutions can also be described in the case that the equations are over or under determined.
 
What makes the direct linear transformation problem distinct from the above standard case is the fact that the left and right sides of the defining equation can differ by an unknown multiplicative factor which is dependent on ''k''. As a consequence, <math> \mathbf{A} </math> cannot be computed as in the standard case. Instead, the similarity relations are rewritten as proper linear homogeneous equations which then can be solved by a standard method. The combination of rewriting the similarity equations as homogeneous linear equations and solving them by standard methods is referred to as a '''direct linear transformation algorithm''' or '''DLT algorithm'''.
 
== Example ==