From be01607041d2ded41e5bf39a0a8e17ffb9bcc296 Mon Sep 17 00:00:00 2001
From: y-jan137 <yousefjan24000@gmail.com>
Date: Sun, 15 Mar 2026 11:16:49 +0300
Subject: Add QR iteration and cleanup

---
 examples/linear_system.cpp | 36 ------------------------------------
 1 file changed, 36 deletions(-)
 delete mode 100644 examples/linear_system.cpp

(limited to 'examples/linear_system.cpp')

diff --git a/examples/linear_system.cpp b/examples/linear_system.cpp
deleted file mode 100644
index 184f576..0000000
--- a/examples/linear_system.cpp
+++ /dev/null
@@ -1,36 +0,0 @@
-#include "matrix.hpp"
-#include "norms.hpp"
-#include "triangular_solve.hpp"
-#include "vector.hpp"
-
-#include <iomanip>
-#include <iostream>
-
-int main() {
-    const linalg::Matrix basis = linalg::Matrix::identity(3);
-    const linalg::Matrix upper{
-        {4.0, -2.0, 1.0},
-        {0.0, 3.0, 5.0},
-        {0.0, 0.0, -2.0}
-    };
-    const linalg::Vector expected{2.0, -1.0, 3.0};
-    const linalg::Vector rhs = upper * expected;
-    const linalg::Vector x = linalg::backward_substitution(upper, rhs);
-
-    std::cout << "Week 3 triangular solve demo\n";
-    std::cout << "Identity matrix diagonal: ";
-    for (std::size_t i = 0; i < basis.rows(); ++i) {
-        std::cout << basis(i, i) << (i + 1 == basis.rows() ? '\n' : ' ');
-    }
-
-    std::cout << "Recovered solution x: ";
-    for (std::size_t i = 0; i < x.size(); ++i) {
-        std::cout << std::fixed << std::setprecision(2) << x[i]
-                  << (i + 1 == x.size() ? '\n' : ' ');
-    }
-
-    const linalg::Vector residual = (upper * x) - rhs;
-    std::cout << "Residual 2-norm = " << linalg::norm2(residual) << '\n';
-
-    return 0;
-}
-- 
cgit v1.2.3