pymodab 1.0.2__tar.gz → 1.0.4__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,12 +1,12 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: pymodab
3
- Version: 1.0.2
3
+ Version: 1.0.4
4
4
  Summary: Fast and robust root-finding library using the Modified Anderson-Bjork method
5
5
  Author: Ganchovski, Traykov
6
6
  License-Expression: MIT
7
- Project-URL: Homepage, https://github.com/Just-A-Random-Geek/ModAB-Root-Finding/tree/main/Python/PyModAB
8
- Project-URL: Repository, https://github.com/Just-A-Random-Geek/ModAB-Root-Finding/tree/main/Python/PyModAB
9
- Keywords: root-finding,numerical,mathematics,optimization,bisection,Anderson-Bjork
7
+ Project-URL: Homepage, https://github.com/Proektsoft-EOOD/ModAB-Root-Finding/tree/main/Python/PyModAB
8
+ Project-URL: Repository, https://github.com/Proektsoft-EOOD/ModAB-Root-Finding/tree/main/Python/PyModAB
9
+ Keywords: root-finding,nonlinear equations,numerical methods,computational mathematics,optimization,bisection,Anderson-Bjork
10
10
  Classifier: Development Status :: 5 - Production/Stable
11
11
  Classifier: Intended Audience :: Science/Research
12
12
  Classifier: Intended Audience :: Developers
@@ -87,8 +87,9 @@ Modified Anderson-Björck's method is a new robust and efficient bracketing root
87
87
  Ganchovski N.; Traykov A. Modified Anderson-Björck's method for solving non-linear equations in structural mechanics. IOP Conference Series: Materials Science and Engineering 2023, 1276 (1) 012010, IOP Publishing.
88
88
  https://iopscience.iop.org/article/10.1088/1757-899X/1276/1/012010/pdf
89
89
 
90
- Ganchovski, N.; Smith, O.; Rackauckas, C.; Tomov, L.; Traykov, A. Improvements of the Modified Anderson-Björck (modAB) Root-Finding Algorithm. Preprints 2026, 2026032190.
91
- https://www.preprints.org/manuscript/202603.2190
90
+ Ganchovski, N.; Smith, O.; Rackauckas, C.; Tomov, L.; Traykov, A. Improvements to the Modified Anderson–Björck (modAB) Root-Finding Algorithm. Algorithms 2026, 19, 332.
91
+ https://doi.org/10.3390/a19050332
92
+
92
93
 
93
94
  ### License
94
95
 
@@ -97,7 +98,7 @@ MIT License
97
98
  ### Benchmark results
98
99
 
99
100
  The modAB algorithm is benchmarked against the available algorithms in Python/SciPy in respect to number of evaluations and execution times:
100
- * `bisect`- Bisection method
101
+ * `bisect` - Bisection method
101
102
  * `brentq` - Brent’s method (van Wijngaarden–Dekker–Brent, 1973)
102
103
  * `brenth` - Brent–Dekker variant (hyperbolic extrapolation variant, 1975)
103
104
  * `ridder` - Ridder’s method (1979)
@@ -134,4 +135,4 @@ Intel(R) Core(TM) i7-1065G7 CPU @ 1.30GHz (1.50 GHz) with 16.0 GB RAM
134
135
  Windows 11 Home
135
136
  numpy Version: 2.4.4
136
137
  scipy Version: 1.17.1
137
- pymodab Version: 1.0.1
138
+ pymodab Version: 1.0.4
@@ -58,8 +58,9 @@ Modified Anderson-Björck's method is a new robust and efficient bracketing root
58
58
  Ganchovski N.; Traykov A. Modified Anderson-Björck's method for solving non-linear equations in structural mechanics. IOP Conference Series: Materials Science and Engineering 2023, 1276 (1) 012010, IOP Publishing.
59
59
  https://iopscience.iop.org/article/10.1088/1757-899X/1276/1/012010/pdf
60
60
 
61
- Ganchovski, N.; Smith, O.; Rackauckas, C.; Tomov, L.; Traykov, A. Improvements of the Modified Anderson-Björck (modAB) Root-Finding Algorithm. Preprints 2026, 2026032190.
62
- https://www.preprints.org/manuscript/202603.2190
61
+ Ganchovski, N.; Smith, O.; Rackauckas, C.; Tomov, L.; Traykov, A. Improvements to the Modified Anderson–Björck (modAB) Root-Finding Algorithm. Algorithms 2026, 19, 332.
62
+ https://doi.org/10.3390/a19050332
63
+
63
64
 
64
65
  ### License
65
66
 
@@ -68,7 +69,7 @@ MIT License
68
69
  ### Benchmark results
69
70
 
70
71
  The modAB algorithm is benchmarked against the available algorithms in Python/SciPy in respect to number of evaluations and execution times:
71
- * `bisect`- Bisection method
72
+ * `bisect` - Bisection method
72
73
  * `brentq` - Brent’s method (van Wijngaarden–Dekker–Brent, 1973)
73
74
  * `brenth` - Brent–Dekker variant (hyperbolic extrapolation variant, 1975)
74
75
  * `ridder` - Ridder’s method (1979)
@@ -105,4 +106,4 @@ Intel(R) Core(TM) i7-1065G7 CPU @ 1.30GHz (1.50 GHz) with 16.0 GB RAM
105
106
  Windows 11 Home
106
107
  numpy Version: 2.4.4
107
108
  scipy Version: 1.17.1
108
- pymodab Version: 1.0.1
109
+ pymodab Version: 1.0.4
@@ -4,14 +4,14 @@ build-backend = "setuptools.build_meta"
4
4
 
5
5
  [project]
6
6
  name = "pymodab"
7
- version = "1.0.2"
7
+ version = "1.0.4"
8
8
  description = "Fast and robust root-finding library using the Modified Anderson-Bjork method"
9
9
  readme = "README.md"
10
10
  license = "MIT"
11
11
  authors = [
12
12
  {name = "Ganchovski, Traykov"}
13
13
  ]
14
- keywords = ["root-finding", "numerical", "mathematics", "optimization", "bisection", "Anderson-Bjork"]
14
+ keywords = ["root-finding", "nonlinear equations", "numerical methods", "computational mathematics", "optimization", "bisection", "Anderson-Bjork"]
15
15
  classifiers = [
16
16
  "Development Status :: 5 - Production/Stable",
17
17
  "Intended Audience :: Science/Research",
@@ -32,8 +32,8 @@ classifiers = [
32
32
  requires-python = ">=3.8"
33
33
 
34
34
  [project.urls]
35
- Homepage = "https://github.com/Just-A-Random-Geek/ModAB-Root-Finding/tree/main/Python/PyModAB"
36
- Repository = "https://github.com/Just-A-Random-Geek/ModAB-Root-Finding/tree/main/Python/PyModAB"
35
+ Homepage = "https://github.com/Proektsoft-EOOD/ModAB-Root-Finding/tree/main/Python/PyModAB"
36
+ Repository = "https://github.com/Proektsoft-EOOD/ModAB-Root-Finding/tree/main/Python/PyModAB"
37
37
 
38
38
  [tool.setuptools.packages.find]
39
39
  where = ["src"]
Binary file
Binary file
@@ -1,12 +1,12 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: pymodab
3
- Version: 1.0.2
3
+ Version: 1.0.4
4
4
  Summary: Fast and robust root-finding library using the Modified Anderson-Bjork method
5
5
  Author: Ganchovski, Traykov
6
6
  License-Expression: MIT
7
- Project-URL: Homepage, https://github.com/Just-A-Random-Geek/ModAB-Root-Finding/tree/main/Python/PyModAB
8
- Project-URL: Repository, https://github.com/Just-A-Random-Geek/ModAB-Root-Finding/tree/main/Python/PyModAB
9
- Keywords: root-finding,numerical,mathematics,optimization,bisection,Anderson-Bjork
7
+ Project-URL: Homepage, https://github.com/Proektsoft-EOOD/ModAB-Root-Finding/tree/main/Python/PyModAB
8
+ Project-URL: Repository, https://github.com/Proektsoft-EOOD/ModAB-Root-Finding/tree/main/Python/PyModAB
9
+ Keywords: root-finding,nonlinear equations,numerical methods,computational mathematics,optimization,bisection,Anderson-Bjork
10
10
  Classifier: Development Status :: 5 - Production/Stable
11
11
  Classifier: Intended Audience :: Science/Research
12
12
  Classifier: Intended Audience :: Developers
@@ -87,8 +87,9 @@ Modified Anderson-Björck's method is a new robust and efficient bracketing root
87
87
  Ganchovski N.; Traykov A. Modified Anderson-Björck's method for solving non-linear equations in structural mechanics. IOP Conference Series: Materials Science and Engineering 2023, 1276 (1) 012010, IOP Publishing.
88
88
  https://iopscience.iop.org/article/10.1088/1757-899X/1276/1/012010/pdf
89
89
 
90
- Ganchovski, N.; Smith, O.; Rackauckas, C.; Tomov, L.; Traykov, A. Improvements of the Modified Anderson-Björck (modAB) Root-Finding Algorithm. Preprints 2026, 2026032190.
91
- https://www.preprints.org/manuscript/202603.2190
90
+ Ganchovski, N.; Smith, O.; Rackauckas, C.; Tomov, L.; Traykov, A. Improvements to the Modified Anderson–Björck (modAB) Root-Finding Algorithm. Algorithms 2026, 19, 332.
91
+ https://doi.org/10.3390/a19050332
92
+
92
93
 
93
94
  ### License
94
95
 
@@ -97,7 +98,7 @@ MIT License
97
98
  ### Benchmark results
98
99
 
99
100
  The modAB algorithm is benchmarked against the available algorithms in Python/SciPy in respect to number of evaluations and execution times:
100
- * `bisect`- Bisection method
101
+ * `bisect` - Bisection method
101
102
  * `brentq` - Brent’s method (van Wijngaarden–Dekker–Brent, 1973)
102
103
  * `brenth` - Brent–Dekker variant (hyperbolic extrapolation variant, 1975)
103
104
  * `ridder` - Ridder’s method (1979)
@@ -134,4 +135,4 @@ Intel(R) Core(TM) i7-1065G7 CPU @ 1.30GHz (1.50 GHz) with 16.0 GB RAM
134
135
  Windows 11 Home
135
136
  numpy Version: 2.4.4
136
137
  scipy Version: 1.17.1
137
- pymodab Version: 1.0.1
138
+ pymodab Version: 1.0.4
Binary file
Binary file
File without changes
File without changes
File without changes
File without changes
File without changes