Solve the problems for your appropriate course track. Problems probe understanding of the definitions and results from the module on floating point arithmetic and linear algebra. Formulate your answers clearly, cogently, and include a concise description of your approach. Each question is meant to be completely answere within five minutes. Allowed test time is 50 minutes.
Prove that the inverse of a rank-1 perturbation of is itself a rank-1 perturbation of , namely
Determine the scalar .
Solution. Self-evident for or . Carry out multiplication
Note that , . Impose condition
Determine the rank of .
Solution. Denote to obtain , and , .
Write the inverse as a rank-1 perturbation of .
Solution. Apply above to obtain
Consider . Write as a rank-1 perturbation of .
Solution. Apply above to obtain
A procedure is available to compute in operations, . Write an efficient algorithm to compute .
Solution. In the following solveA(x) computes in operations. Write as
Algorithm with operation count for each step
Algorithm
Input:
|
|
|
|
|
|
|
|
|
|
Determine the operation count for the above algorithm.
Solution. From above total operation count is , i.e., rank-1 perturbation of a known coordinate transformation costs FLOPS.
Let . Determine the relationship between the singular values of and the eigenvalues of
Solution. SVD of . Since is symmetric, it is unitarily diagonalizable, orthogonal such that
Consider simplest case when , with SVD
Compute eigendecomposition
The above suggests for
Verify orthogonality of
since (orthogonal matrices in SVD). Verify eigenvalue relationship
It results that eigenvalues of are , with the singular values of
Determine the relationship between the singular vectors of and the eigenvectors of .
Solution. From above, eigenvectors are