structsolve 0.9.0__tar.gz → 0.9.2__tar.gz

{structsolve-0.9.0/structsolve.egg-info → structsolve-0.9.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: structsolve
-Version: 0.9.0
+Version: 0.9.2
 Summary: Structural analysis solvers
 Author-email: "Saullo G. P. Castro" <castrosaullo@gmail.com>
 License-Expression: BSD-3-Clause
@@ -63,7 +63,7 @@ Currently these solvers are pretty much compatible with my other repository
 Citing this library
 ===================
 
-Saullo G. P. Castro (2026). Structural analysis solvers tailored for semi-analytical models (Version 0.9.0). Zenodo. DOI: https://doi.org/10.5281/zenodo.2581212.
+Saullo G. P. Castro (2026). Structural analysis solvers tailored for semi-analytical models (Version 0.9.2). Zenodo. DOI: https://doi.org/10.5281/zenodo.2581212.
 
 
 Documentation
@@ -78,10 +78,12 @@ History
 
 See [CHANGELOG.md](CHANGELOG.md) for the details of each version.
 
-* version 0.9.0 (2026-10-24)
+* version 0.9.2 (2026-10-24), including 0.9.0 and 0.9.1
     - Crisfield's convergence criterion is the default of the non-linear analyses, `Analysis.convergence = 'crisfield'`, with `relTOL = 1e-9`: the residual and the reference forces are measured with the norm scaled by the diagonal of `calc_kC()` over the free degrees of freedom; the former check is kept with `convergence = 'relative'`
     - `lb` returns the negative load multipliers closest to zero after the positive ones, and a tensile reference load no longer needs the dense fallback
     - `freq(sort=True)` sorts and filters `lambda2` together with the eigenvectors, and rigid-body modes no longer fail the verification of the residuals
+    - arc-length solvers: a converged step that points back along the path is repeated with half the arc length, instead of being accepted
+    - documentation published again: pandoc installed in the documentation workflow
 * version 0.8.0 (2026-10-14)
     - Fewer evaluations and factorizations, same solutions: `dR/dlbd` is evaluated together with the tangent stiffness matrix only, Newton-Raphson reuses the factorization of the tangent while it is not updated, the follower linear static analysis factorizes `K0` once, and `lb` estimates its shift and the inertia of `K` once for all its attempts
 * version 0.7.0 (2026-10-13)

{structsolve-0.9.0 → structsolve-0.9.2}/README.md

@@ -28,7 +28,7 @@ Currently these solvers are pretty much compatible with my other repository
 Citing this library
 ===================
 
-Saullo G. P. Castro (2026). Structural analysis solvers tailored for semi-analytical models (Version 0.9.0). Zenodo. DOI: https://doi.org/10.5281/zenodo.2581212.
+Saullo G. P. Castro (2026). Structural analysis solvers tailored for semi-analytical models (Version 0.9.2). Zenodo. DOI: https://doi.org/10.5281/zenodo.2581212.
 
 
 Documentation
@@ -43,10 +43,12 @@ History
 
 See [CHANGELOG.md](CHANGELOG.md) for the details of each version.
 
-* version 0.9.0 (2026-10-24)
+* version 0.9.2 (2026-10-24), including 0.9.0 and 0.9.1
     - Crisfield's convergence criterion is the default of the non-linear analyses, `Analysis.convergence = 'crisfield'`, with `relTOL = 1e-9`: the residual and the reference forces are measured with the norm scaled by the diagonal of `calc_kC()` over the free degrees of freedom; the former check is kept with `convergence = 'relative'`
     - `lb` returns the negative load multipliers closest to zero after the positive ones, and a tensile reference load no longer needs the dense fallback
     - `freq(sort=True)` sorts and filters `lambda2` together with the eigenvectors, and rigid-body modes no longer fail the verification of the residuals
+    - arc-length solvers: a converged step that points back along the path is repeated with half the arc length, instead of being accepted
+    - documentation published again: pandoc installed in the documentation workflow
 * version 0.8.0 (2026-10-14)
     - Fewer evaluations and factorizations, same solutions: `dR/dlbd` is evaluated together with the tangent stiffness matrix only, Newton-Raphson reuses the factorization of the tangent while it is not updated, the follower linear static analysis factorizes `K0` once, and `lb` estimates its shift and the inertia of `K` once for all its attempts
 * version 0.7.0 (2026-10-13)

{structsolve-0.9.0 → structsolve-0.9.2}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "structsolve"
-version = "0.9.0"
+version = "0.9.2"
 description = "Structural analysis solvers"
 readme = "README.md"
 license = "BSD-3-Clause"

{structsolve-0.9.0 → structsolve-0.9.2}/structsolve/arc_length.py

@@ -174,8 +174,20 @@ def _solver_arc_length(an, method, silent=False):
       angle, since both have the length `\Delta s`.
 
     The step fails when `\delta\lambda` cannot be computed or is not
-    finite. With full Newton-Raphson, `[K_T]` is updated at every iteration
-    at the current iterate `(c + \Delta c, \lambda + \Delta\lambda)`; with
+    finite, and when the converged increment points against the tangent
+    predictor `(\Delta c_{pred}, \Delta\lambda_{pred})` of the step,
+    `\langle (\Delta c, \Delta\lambda), (\Delta c_{pred},
+    \Delta\lambda_{pred}) \rangle \le 0`. The previous converged point is
+    also at the distance `\Delta s` from the last one, and with long steps
+    or near a limit point the iterations may converge to it and then trace
+    the path backwards, the "doubling back" that [2]_ (p. 56) avoids with
+    the choice of the root. The accepted points are thus on the side of the
+    tangent predictor of the hyperplane normal to it, in the inner product
+    above, through the last converged point, as the points of the plane of
+    Riks [1]_, normal to the tangent at the distance `\Delta s` from the
+    last converged point. With full Newton-Raphson, `[K_T]` is updated at
+    every iteration at the current iterate `(c + \Delta c, \lambda +
+    \Delta\lambda)`; with
     ``an.modified_NR = True`` the factorization at the last converged state
     is used for the first ``an.compute_every_n`` iterations and the tangent
     is then updated every ``an.compute_every_n`` iterations; at the first
@@ -313,6 +325,9 @@ def _solver_arc_length(an, method, silent=False):
                 sign = 1.
         dlbd = sign*arc_length/norm_q
         dc = dlbd*dc_q_conv
+        # tangent predictor, the forward direction of the step
+        dc_pred = dc
+        dlbd_pred = dlbd
 
         msg('Step %d, lbd %1.5f, arc-length increment %1.5f' % (step_num, lbd, arc_length),
             level=1, silent=silent)
@@ -393,6 +408,13 @@ def _solver_arc_length(an, method, silent=False):
             dc = dc + dc_R + varlbd*dc_q
             dlbd = dlbd + varlbd
 
+        if converged and inner(dc, dlbd, dc_pred, dlbd_pred) <= 0:
+            # the increment points backwards, e.g. to the previous converged
+            # point, which is also at the distance arc_length
+            warn('Diverged - the step returned along the path already traced',
+                 level=2, silent=silent)
+            converged = False
+
         finished = False
         if converged and lbd + dlbd > 1. and lbd < 1.:
             msg('Load factor 1.0 exceeded, correcting to load factor 1.0...', level=1, silent=silent)

{structsolve-0.9.0 → structsolve-0.9.2/structsolve.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: structsolve
-Version: 0.9.0
+Version: 0.9.2
 Summary: Structural analysis solvers
 Author-email: "Saullo G. P. Castro" <castrosaullo@gmail.com>
 License-Expression: BSD-3-Clause
@@ -63,7 +63,7 @@ Currently these solvers are pretty much compatible with my other repository
 Citing this library
 ===================
 
-Saullo G. P. Castro (2026). Structural analysis solvers tailored for semi-analytical models (Version 0.9.0). Zenodo. DOI: https://doi.org/10.5281/zenodo.2581212.
+Saullo G. P. Castro (2026). Structural analysis solvers tailored for semi-analytical models (Version 0.9.2). Zenodo. DOI: https://doi.org/10.5281/zenodo.2581212.
 
 
 Documentation
@@ -78,10 +78,12 @@ History
 
 See [CHANGELOG.md](CHANGELOG.md) for the details of each version.
 
-* version 0.9.0 (2026-10-24)
+* version 0.9.2 (2026-10-24), including 0.9.0 and 0.9.1
     - Crisfield's convergence criterion is the default of the non-linear analyses, `Analysis.convergence = 'crisfield'`, with `relTOL = 1e-9`: the residual and the reference forces are measured with the norm scaled by the diagonal of `calc_kC()` over the free degrees of freedom; the former check is kept with `convergence = 'relative'`
     - `lb` returns the negative load multipliers closest to zero after the positive ones, and a tensile reference load no longer needs the dense fallback
     - `freq(sort=True)` sorts and filters `lambda2` together with the eigenvectors, and rigid-body modes no longer fail the verification of the residuals
+    - arc-length solvers: a converged step that points back along the path is repeated with half the arc length, instead of being accepted
+    - documentation published again: pandoc installed in the documentation workflow
 * version 0.8.0 (2026-10-14)
     - Fewer evaluations and factorizations, same solutions: `dR/dlbd` is evaluated together with the tangent stiffness matrix only, Newton-Raphson reuses the factorization of the tangent while it is not updated, the follower linear static analysis factorizes `K0` once, and `lb` estimates its shift and the inertia of `K` once for all its attempts
 * version 0.7.0 (2026-10-13)

{structsolve-0.9.0 → structsolve-0.9.2}/tests/test_arc_length.py

@@ -139,6 +139,33 @@ def test_arc_length_snap_back(method, convergence, relTOL):
     assert cs[-1, 0] > 2.
 
 
+@pytest.mark.parametrize('convergence, relTOL', [('relative', 1.e-6),
+                                                  ('crisfield', 1.e-9)])
+@pytest.mark.parametrize('method', METHODS)
+def test_arc_length_no_doubling_back(method, convergence, relTOL):
+    """Long steps through the limit point at 10 times the limit load
+
+    The previous converged point is at the distance of the arc length from
+    the last one, and the iterations of the second step may converge to it,
+    which would trace the path backwards, the load factor decreasing below
+    zero without ever reaching 1.0. Such a step points against the tangent
+    predictor, and it is repeated with a shorter arc length.
+
+    """
+    p = von_mises_truss(frac=10., ks=1.)
+    p.analysis(NL_method=method, initialInc=0.2, convergence=convergence,
+               relTOL=relTOL)
+    p.an.static(NLgeom=True, silent=True)
+    check_equilibrium(p)
+    inc = np.asarray(p.an.increments)
+    cs = np.asarray(p.an.cs)
+    assert inc[-1] == 1.0
+    assert np.all(np.diff(np.r_[0., cs[:, 0]]) > 0)
+    np.testing.assert_allclose(cs[-1],
+                               p.solve_reference(c0=cs[-1], tol=1e-12),
+                               rtol=1e-6)
+
+
 @pytest.mark.parametrize('method', METHODS)
 def test_arc_length_step_cutting(method):
     p = von_mises_truss(frac=1.5)