
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
Homework problems related to singular value decomposition (svd) and qr factorization in linear algebra. The problems involve finding svds by hand, showing properties of orthogonally similar matrices, and computing reduced svds and qr factorizations using matlab. Students are required to turn in printouts of their m-files and numerical results for problems involving matlab.
Typology: Slides
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Math 782, HW 2, Due Wednesday, Feb. 21
For problems involving MATLAB, turn in printouts of your m-files and obtained numerical
results.
Problem 1. Find, by hand, a SVD of A =
[
]
Problem 2. Two matrices A, B ∈ R
m×m
are said to be orthogonally similar if A = QBQ
T
for some orthogonal Q ∈ R
m×m .
(a) Show that if A, B ∈ R
m×m
are orthogonally similar, then they have the same singular
values.
(b) Show by an example that the converse of (a) is not true. Hint: Use A, B ∈ R
1 × 1 .
Problem 3. Assume that A ∈ R
m×m is nonsingular. Show that all singular values σ j
of A
are positive and that ‖A
− 1 ‖ 2
= 1/σ m
Problem 4. Use an appropriate built-in function of MATLAB to compute a reduced (econ-
omy size) SVD of
Using this SVD determine: Rank of A, ‖A‖ 2
, orthonormal bases for Range of A and Null of
Problem 5. Assume A ∈ R
m×n
, m ≥ n, and let A =
R be a reduced QR factorization of
A. Show that Rank of A = n if and only if all the diagonal entries of
R are nonzero.
Problem 6. Assume A ∈ R
m×n
, m ≥ n, Rank of A = n, and let A =
R be a reduced QR
factorization of A. Show that the columns of
Q form an orthonormal basis for the Range of
Problem 7. Write two MATLAB functions [Q, R] =clgs(A) and [Q, R] =mgs(A) that, for a
given A ∈ R
m×n with m ≥ n and Rank A = n, compute reduced QR factorizations A =
using classical and modified Gram-Schmidt processes, respectively (cf. Algorithms 7.1 and
8.1 in the text). Test your functions on the matrix
− 4
, 10
− 6
, 10
− 8
,
by comparing
R to A. Assess “orthonormality” of the columns of
Q by computing
Draw conclusions about which of the two Gram-Schmidt processes is numerically better.
(Use the long format of MATLAB to display your results.)