Suppose QR factorization is used to compute the solution of a square linear system, Ax =...

 

Transcribed Image Text:

Suppose QR factorization is used to compute the solution of a square linear system, Ax = b; i.e., let m = n. (a) Find an asymptotic flop count for this procedure, and compare to the LU factorization algorithm. (b) Show that A(A)=(R). Suppose QR factorization is used to compute the solution of a square linear system, Ax = b; i.e., let m = n. (a) Find an asymptotic flop count for this procedure, and compare to the LU factorization algorithm. (b) Show that A(A)=(R).

Answer rating: 100% (QA)

a To compute the QR factorization of a square matrix A of size n n the asymptotic flop count can be estimated as follows 1 Computing the Householder r... View the full answer