Exercise Sheet 1
In view of the explicit formulas derived in subproblem (1.1a), compute the norm kAkp for p =
{1, 2, ∞}.
function np = MatrixpNorm(A)
which takes as input a matrix A and returns a 3 × 1-vector np containing the p-norm of A for
p = 1, 2, ∞. Compare the numerical results with the ones obtained in subproblem (1.1b) for A
as in (1.1.4).
H INT: Use the M ATLAB built-in routines.
(1.2c) Show that the Frobenius norm k·kF on Cm×n is compatible with the vector norm k·k2 .
(1.4b) Use the Gram-Schmidt algorithm of the lecture notes to generate (by hand) an orthogonal
basis of R3 from the linearly independent vectors x1 , x2 , x3 given in (1.4.1).
(1.5b) Test your implementation from subproblem (1.5a) using the vectors of Exercise 1.4.
(1.5c) Using the M ATLAB command rand, construct three vectors (i.e. k = 3 in Exercise
(1.5a)) with uniformly distributed entries in the interval [1, 10] of dimensions d = 102 , 103 , 104 , 105 ,
106 , 107 . Plot the total CPU time needed to construct the orthonormal basis using the M AT-
LAB function gram schmidt algo from subproblem (1.3a) (use the M ATLAB commands tic
toc to do so) in loglog scale. How does the CPU time behave with the dimension d of the vectors
taken into consideration?
(1.6a) Find orthogonal matrices U and V in R2×2 and a diagonal Matrix Σ such that A =
UΣV> .
(1.6b) Compute the operator 2-norm, the Frobenius norm and the spectral radius of both A and
A−1 . For this, refer to [NMI, Prop 0.51] from the lecture notes.
Literatur
[NMI] Lecture Notes for the course “Numerische Mathematik I”.