Transcription of 4.3 Least Squares Approximations
{{id}} {{{paragraph}}}
218 Chapter 4. Least Squares ApproximationsIt often happens thatAxDbhas no solution. The usual reason is:too many matrix has more rows than columns. There are more equations than unknowns(mis greater thann). Thencolumns span a small part ofm-dimensional space. Unless allmeasurements are perfect ,bis outside that column space. Elimination reaches animpossible equation and stops. But we can t stop just because measurements include repeat: We cannot always get the erroreDb Axdown to zero. Wheneis zero,xis an exact solution the length ofeis as small as possible,bxis aleast Squares goal in this section is to computebxand use it. These are realproblems and they need an previous section emphasizedp(the projection). This section emphasizesbx(theleast Squares solution). They are connected bypDAbx. The fundamental equation is stillATAbxDATb. Here is a short unofficial way to reach this equation:WhenAxDbhas no solution, multiply byATand solveATAbxDATb:Example 1A crucial application of Least Squares is fitting a straight line with three points:Find the closest line to the ; 6/.
4.3 Least Squares Approximations It often happens that Ax Db has no solution. The usual reason is: too many equations. The matrix has more rows than columns. There are more equations than unknowns (m is greater than n). The n columns span a small part of m-dimensional space. Unless all measurements are perfect, b is outside that column space.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}