Please use this identifier to cite or link to this item:
- Least Squares
- Maes, Chris
- When a matrix A is square with full rank, there is a vector x that satisfies the equation Ax=b for any b. However, when A is not square or does not have full rank, such an x may not exist, because b does not lie in the range of A. In this case, called the least squares problem, we seek the vector x that minimizes the length (or norm) of the residual vector r=Ax-b. The four vectors Ax, b, r, and rmin are color coded and the plane is the range of the matrix A. The plane shown is the set of all possible vectors Ax
- Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
- Approximation Methods
- Educação Superior::Ciências Exatas e da Terra::Matemática::Análise Complexa
- This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
- Demonstration freeware using Mathematica Player
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.