This project is about comparing matrix factorization techniques and other related issues with Matlab: You are not allowed to use precoded functions in Matlab. You must code your answers (to a reasonable extent). 1/LU factorization Consider [epsilon 0 ; 0 1] with epsilon small Show that the LU method will yield errors and problems when At*A is computed. 2/Cholesky see item 4/ 3/QR factorization Let A be a (m*n) matrix with m>=n Exhibit Q and Qt*Q Exhibit R , show it is triangular and of rank n Show that if R is full rank, inv(R) exists 4/Linear Least Squares solving of Ax=b Let A be a (m*n) matrix with m>=n Using the QR method and then the Cholesky method: Show that when A is full rank, a solution to Ax=b exists Show that the solution of Ax=b is also that of Rx=Qt*B compare the results of the two methods write a concise report with your code and finding **********
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).