Math 477 Homework Assignment 3: QR Factorization and Gram-Schmidt Process, Assignments of Linear Algebra

Math 477 homework assignment 3, due on october 12, 2006. The assignment involves determining qr factorizations for two given matrices a and b using various methods, applying the gram-schmidt process to three vectors, and calculating the number of floating point operations required for the classical and modified gram-schmidt algorithms. This assignment is suitable for university students specializing in linear algebra or advanced mathematics.

Typology: Assignments

Pre 2010

Uploaded on 08/18/2009

koofers-user-2hm-2
koofers-user-2hm-2 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 477 Homework Assignment 3, due Oct.12, 2006
1. Consider the matrices
A=
1 0
0 1
1 0
, B =
1 2
0 1
1 0
used on the previous homework.
(a) Using any method you like, determine (on paper) a reduced QR factorization A=ˆ
Qˆ
Rand
a full QR factorization A=QR.
(b) Again using any method you like, determine reduced and full QR factorizations B=ˆ
Qˆ
R
and B=QR.
2. Apply the Gram-Schmidt process (on paper) to the three vectors [3,4,0]T, [1,1,1]T, and [1,2,0]T.
3. Let Abe an m×nmatrix. Determine the exact number of floating point additions, subtractions,
multiplications and divisions involved in performing the classical and modified Gram-Schmidt
algorithms as listed in the classnotes.

Partial preview of the text

Download Math 477 Homework Assignment 3: QR Factorization and Gram-Schmidt Process and more Assignments Linear Algebra in PDF only on Docsity!

Math 477 — Homework Assignment 3, due Oct.12, 2006

  1. Consider the matrices

A =

, B =

used on the previous homework.

(a) Using any method you like, determine (on paper) a reduced QR factorization A =

Q

R and

a full QR factorization A = QR.

(b) Again using any method you like, determine reduced and full QR factorizations B =

Q

R

and B = QR.

  1. Apply the Gram-Schmidt process (on paper) to the three vectors [3, 4 , 0]

T , [1, 1 , 1]

T , and [1, 2 , 0]

T .

  1. Let A be an m×n matrix. Determine the exact number of floating point additions, subtractions,

multiplications and divisions involved in performing the classical and modified Gram-Schmidt

algorithms as listed in the classnotes.