This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Homework 4 Foundations of Computational Math 1 Fall 2011 The solutions will be posted on Friday, 10/7/11 Problem 4.1 Recall that an elementary reflector has the form Q = I + xx T R n n with bardbl x bardbl 2 negationslash = 0. 4.1.a . Show that Q is orthogonal if and only if = 2 x T x or = 0 4.1.b . Given v R n , let = bardbl v bardbl and x = v + e 1 . Assuming that x negationslash = v show that x T x x T v = 2 4.1.c . Using the definitions and results above show that Qv = e 1 Problem 4.2 4.2.a This part of the problem concerns the computational complexity question of operation count. For both LU factorization and Householder reflectorbased orthogonal factorization, we have used elementary transformations, T i , that can be characterized as rank1 updates to the identity matrix, i.e., T i = I + x i y T i , x i R n and y i R n Gauss transforms and Householder reflectors differ in the definitions of the vectors x i and y i . Maintaining computational efficiency in terms of a reasonable operation count usually....
View Full
Document
 Fall '09
 gallivan

Click to edit the document details