
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Numerical Linear Algebra; Subject: Mathematics; University: Illinois Institute of Technology; Term: Fall 2006;
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

r x
b 0
where I is the m × m identity matrix. Show that this system has a unique solution [r, x]T^ , and that the vectors r and x are the residual and the solution of the least squares problem: Given A ∈ Cm×n^ of full rank, m ≥ n, b ∈ Cm, find x ∈ Cn^ such that ‖b − Ax‖ is minimized.
[U,S,V] = svd(A); S = diag(S); tol = max(size(A))S(1)eps; r = sum(S > tol); S = diag(ones(r,1)./S(1:r)); X = V(:,1:r)SU(:,1:r)’;
Explain line-by-line what this code does. What is X?
, where A 11 is n × n and A 22 is (m − n) × (m − n). Assume that A is such that its LU factorization exists. Verify the formula (^) [ I O −A 21 A− 111 I
for “elimination” of the block A 21. The matrix A 22 − A 21 A− 111 A 12 is known as the Schur comple- ment of A 11 in A.
(a) Compute the LU factorization of A with and without partial pivoting. (b) Determine det(A) from the 2 LU factorizations of A obtained in (a). (c) Describe how Gaussian elimination with partial pivoting can be used to find the determinant of a general square matrix.