numanpy 0.1.0__tar.gz → 0.1.1__tar.gz

{numanpy-0.1.0 → numanpy-0.1.1}/PKG-INFO

@@ -1,7 +1,7 @@
 Metadata-Version: 2.4
 Name: numanpy
-Version: 0.1.0
-Summary: Python library implementing numerical and simulation methods
+Version: 0.1.1
+Summary: Python library implementing numerical and simulation methods.
 Author: Siddharth Kulkarni
 License-Expression: MIT
 Project-URL: Homepage, https://github.com/siddharthskulkarni/numanpy

{numanpy-0.1.0 → numanpy-0.1.1}/numanpy/root_finding.py

@@ -1,4 +1,4 @@
-def bisect(f, a, b, eps=1e-5, N=100):
+def bisect(f, a, b, eps=1e-6, N=100, verbose=False):
     """
     Bisection method for finding a root of the scalar function f in the interval [a, b].
 
@@ -8,17 +8,24 @@ def bisect(f, a, b, eps=1e-5, N=100):
     b (float): The end of the interval.
     eps (float): The tolerance for convergence.
     N (int): The maximum number of iterations.
+    verbose (bool): If True, returns iterates and prints convergence information; else, returns only the root.
 
     Returns:
     float: The approximate root of the scalar function f.
     """
     if f(a) * f(b) >= 0:
         raise ValueError("f(a) and f(b) must have different signs.")
+    cs = []
 
     for _ in range(N):
-        c = (a + b) / 2
+        cs.append((a + b) / 2)
+        c = cs[-1]
         if abs(f(c)) < eps or (b - a) / 2 < eps:
-            return c
+            if verbose:
+                print(f"Converged to {c} after {_ + 1} iterations.")
+                return cs
+            else:
+                return c
         if f(c) * f(a) < 0:
             b = c
         else:
@@ -27,7 +34,7 @@ def bisect(f, a, b, eps=1e-5, N=100):
     raise RuntimeError("Maximum number of iterations reached without convergence.")
 
 
-def iterate(f, x0, eps=1e-5, N=100):
+def iterate(f, x0, eps=1e-6, N=100):
     """
     Fixed-point iteration method for finding a root of the scalar function f.
 
@@ -49,7 +56,8 @@ def iterate(f, x0, eps=1e-5, N=100):
 
     raise RuntimeError("Maximum number of iterations reached without convergence.")
 
-def newton(f, df, x0, eps=1e-5, N=100):
+
+def newton(f, df, x0, eps=1e-6, N=100, verbose=False):
     """
     Newton's method for finding a root of the scalar function f.
 
@@ -59,19 +67,24 @@ def newton(f, df, x0, eps=1e-5, N=100):
     x0 (float or ndarray): The initial guess for the root.
     eps (float): The tolerance for convergence.
     N (int): The maximum number of iterations.
+    verbose (bool): If True, returns iterates and prints convergence information; else, returns only the root.
 
     Returns:
     float: The approximate root of the scalar function f.
     """
-    x = x0
+    x = [x0]
     for _ in range(N):
-        fx = f(x)
-        dfx = df(x)
+        fx = f(x[-1])
+        dfx = df(x[-1])
         if dfx == 0:
             raise ValueError("Derivative is zero. No solution found.")
-        x_ = x - fx / dfx
-        if abs(x_ - x) < eps:
-            return x_
-        x = x_
+        
+        x.append(x[-1] - fx / dfx)
+        if abs(x[-1] - x[-2]) < eps:
+            if verbose:
+                print(f"Converged to {x[-1]} after {_ + 1} iterations.")
+                return x
+            else:
+                return x[-1]
 
     raise RuntimeError("Maximum number of iterations reached without convergence.")

{numanpy-0.1.0 → numanpy-0.1.1}/numanpy.egg-info/PKG-INFO

@@ -1,7 +1,7 @@
 Metadata-Version: 2.4
 Name: numanpy
-Version: 0.1.0
-Summary: Python library implementing numerical and simulation methods
+Version: 0.1.1
+Summary: Python library implementing numerical and simulation methods.
 Author: Siddharth Kulkarni
 License-Expression: MIT
 Project-URL: Homepage, https://github.com/siddharthskulkarni/numanpy

{numanpy-0.1.0 → numanpy-0.1.1}/pyproject.toml

@@ -1,10 +1,10 @@
 [project]
 name = "numanpy"
-version = "0.1.0"
+version = "0.1.1"
 authors = [
   { name="Siddharth Kulkarni" },
 ]
-description = "Python library implementing numerical and simulation methods"
+description = "Python library implementing numerical and simulation methods."
 readme = "README.md"
 requires-python = ">=3.9"
 classifiers = [