Algorithm for QR Decomposition

Aim:

To implement QR decomposition algorithm using the Gram-Schmidt method.

Equipment’s required:

1. Hardware – PCs
2. Anaconda – Python 3.7 Installation / Moodle-Code Runner

Algorithm:

1. Intialize the matrix Q and u

2. The vector u and e is given by

   

   

   

3. Obtain the Q matrix
   

4. Construct the upper triangular matrix R

Program:

Gram-Schmidt Method

Output

Result

Thus the QR decomposition algorithm using the Gram-Schmidt process is written and verified the result.