diff --git a/Bisection.py b/ArithmeticAnalysis/Bisection.py
similarity index 100%
rename from Bisection.py
rename to ArithmeticAnalysis/Bisection.py
diff --git a/Intersection.py b/ArithmeticAnalysis/Intersection.py
similarity index 100%
rename from Intersection.py
rename to ArithmeticAnalysis/Intersection.py
diff --git a/ArithmeticAnalysis/LUdecomposition.py b/ArithmeticAnalysis/LUdecomposition.py
new file mode 100644
index 000000000..bb0827bb3
--- /dev/null
+++ b/ArithmeticAnalysis/LUdecomposition.py
@@ -0,0 +1,34 @@
+import math
+import numpy
+
+def LUDecompose (table): #table that contains our data
+    #table has to be a square array so we need to check first
+    rows,columns=numpy.shape(table)
+    L=numpy.zeros((rows,columns))
+    U=numpy.zeros((rows,columns))
+    if rows!=columns:
+        return
+    for i in range (columns):
+        for j in range(i-1):
+            sum=0
+            for k in range (j-1):
+                sum+=L[i][k]*U[k][j]
+            L[i][j]=(table[i][j]-sum)/U[j][j]
+        L[i][i]=1
+        for j in range(i-1,columns):
+            sum1=0
+            for k in range(i-1):
+                sum1+=L[i][k]*U[k][j]
+            U[i][j]=table[i][j]-sum1
+    return L,U
+
+
+
+
+
+
+
+matrix =numpy.array([[2,-2,1],[0,1,2],[5,3,1]])
+L,U = LUDecompose(matrix)
+print(L)
+print(U)
\ No newline at end of file
diff --git a/NeutonMethod.py b/ArithmeticAnalysis/NeutonMethod.py
similarity index 100%
rename from NeutonMethod.py
rename to ArithmeticAnalysis/NeutonMethod.py