a3linux
diff --git a/‎Bisection.py‎ ‎ArithmeticAnalysis/Bisection.py‎Bisection.py renamed to ArithmeticAnalysis/Bisection.py b/‎Bisection.py‎ ‎ArithmeticAnalysis/Bisection.py‎Bisection.py renamed to ArithmeticAnalysis/Bisection.py
diff --git a/‎Intersection.py‎ ‎ArithmeticAnalysis/Intersection.py‎Intersection.py renamed to ArithmeticAnalysis/Intersection.py b/‎Intersection.py‎ ‎ArithmeticAnalysis/Intersection.py‎Intersection.py renamed to ArithmeticAnalysis/Intersection.py
diff --git a/‎ArithmeticAnalysis/LUdecomposition.py‎
Lines changed: 34 additions & 0 deletions b/‎ArithmeticAnalysis/LUdecomposition.py‎
Lines changed: 34 additions & 0 deletions
diff --git a/‎NeutonMethod.py‎ ‎ArithmeticAnalysis/NeutonMethod.py‎NeutonMethod.py renamed to ArithmeticAnalysis/NeutonMethod.py b/‎NeutonMethod.py‎ ‎ArithmeticAnalysis/NeutonMethod.py‎NeutonMethod.py renamed to ArithmeticAnalysis/NeutonMethod.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)