structsolve 0.2.2__tar.gz → 0.3.0__tar.gz

structsolve-0.3.0/LICENSE

@@ -0,0 +1,12 @@
+Copyright (c) 2012-2026, Saullo G. P. Castro (S.G.P.Castro@tudelft.nl)
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

structsolve-0.3.0/PKG-INFO

@@ -0,0 +1,65 @@
+Metadata-Version: 2.4
+Name: structsolve
+Version: 0.3.0
+Summary: Structural analysis solvers
+Author-email: "Saullo G. P. Castro" <castrosaullo@gmail.com>
+License: BSD-2-Clause
+Project-URL: Homepage, https://github.com/compmech/structsolve
+Project-URL: Repository, https://github.com/compmech/structsolve
+Keywords: structural analysis,stress,vibration,linear buckling,newton raphson,arc length
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Education
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Classifier: License :: OSI Approved :: BSD License
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Operating System :: Microsoft :: Windows
+Classifier: Operating System :: Unix
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy
+Requires-Dist: scipy
+Provides-Extra: test
+Requires-Dist: pytest; extra == "test"
+Requires-Dist: pytest-cov; extra == "test"
+Requires-Dist: flake8; extra == "test"
+Requires-Dist: coverage; extra == "test"
+Requires-Dist: composites; extra == "test"
+Requires-Dist: buckling>=2026b4; extra == "test"
+Dynamic: license-file
+
+Github Actions status:
+[![pytest](https://github.com/saullocastro/structsolve/actions/workflows/pytest.yml/badge.svg)](https://github.com/saullocastro/structsolve/actions/workflows/pytest.yml)
+[![Deploy](https://github.com/saullocastro/structsolve/actions/workflows/pythonpublish.yml/badge.svg)](https://github.com/saullocastro/structsolve/actions/workflows/pythonpublish.yml)
+
+Coverage status:
+[![codecov](https://github.com/saullocastro/structsolve/actions/workflows/coverage.yml/badge.svg)](https://github.com/saullocastro/structsolve/actions/workflows/coverage.yml)
+[![Codecov Status](https://codecov.io/gh/saullocastro/structsolve/branch/master/graph/badge.svg)](https://codecov.io/gh/saullocastro/structsolve)
+
+
+Structural analysis solvers tailored for semi-analytical models
+===============================================================
+
+- Linear statics: [K]{u} = {f}
+- Eigensolver for Linear buckling: ([K] + lambda[KG]){u} = 0
+- Eigensolver for dynamics: ([K] + lambda^2[M]){u} = 0
+- Nonlinear statics using Newton-Raphson 
+- Nonlinear statics using the Arc-Length method
+
+Currently these solvers are pretty much compatible with my other repositories
+[panels](https://github.com/saullocastro/panels), 
+[buckling](https://github.com/saullocastro/buckling).
+
+
+License
+-------
+Distrubuted in the 3-Clause BSD license (https://raw.github.com/saullocastro/structsolve/master/LICENSE).
+
+Contact: S.G.P.Castro@tudelft.nl
+

structsolve-0.3.0/README.md

@@ -0,0 +1,29 @@
+Github Actions status:
+[![pytest](https://github.com/saullocastro/structsolve/actions/workflows/pytest.yml/badge.svg)](https://github.com/saullocastro/structsolve/actions/workflows/pytest.yml)
+[![Deploy](https://github.com/saullocastro/structsolve/actions/workflows/pythonpublish.yml/badge.svg)](https://github.com/saullocastro/structsolve/actions/workflows/pythonpublish.yml)
+
+Coverage status:
+[![codecov](https://github.com/saullocastro/structsolve/actions/workflows/coverage.yml/badge.svg)](https://github.com/saullocastro/structsolve/actions/workflows/coverage.yml)
+[![Codecov Status](https://codecov.io/gh/saullocastro/structsolve/branch/master/graph/badge.svg)](https://codecov.io/gh/saullocastro/structsolve)
+
+
+Structural analysis solvers tailored for semi-analytical models
+===============================================================
+
+- Linear statics: [K]{u} = {f}
+- Eigensolver for Linear buckling: ([K] + lambda[KG]){u} = 0
+- Eigensolver for dynamics: ([K] + lambda^2[M]){u} = 0
+- Nonlinear statics using Newton-Raphson 
+- Nonlinear statics using the Arc-Length method
+
+Currently these solvers are pretty much compatible with my other repositories
+[panels](https://github.com/saullocastro/panels), 
+[buckling](https://github.com/saullocastro/buckling).
+
+
+License
+-------
+Distrubuted in the 3-Clause BSD license (https://raw.github.com/saullocastro/structsolve/master/LICENSE).
+
+Contact: S.G.P.Castro@tudelft.nl
+

structsolve-0.3.0/pyproject.toml

@@ -0,0 +1,54 @@
+[build-system]
+requires = ["setuptools>=64", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "structsolve"
+version = "0.3.0"
+description = "Structural analysis solvers"
+readme = "README.md"
+license = {text = "BSD-2-Clause"}
+requires-python = ">=3.8"
+authors = [
+    { name = "Saullo G. P. Castro", email = "castrosaullo@gmail.com" },
+]
+keywords = [
+    "structural analysis", "stress", "vibration", "linear buckling",
+    "newton raphson", "arc length",
+]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Science/Research",
+    "Intended Audience :: Developers",
+    "Intended Audience :: Education",
+    "Topic :: Scientific/Engineering :: Mathematics",
+    "License :: OSI Approved :: BSD License",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
+    "Operating System :: Microsoft :: Windows",
+    "Operating System :: Unix",
+]
+dependencies = [
+    "numpy",
+    "scipy",
+]
+
+[project.optional-dependencies]
+test = [
+    "pytest",
+    "pytest-cov",
+    "flake8",
+    "coverage",
+    "composites",
+    "buckling>=2026b4",
+]
+
+[project.urls]
+Homepage = "https://github.com/compmech/structsolve"
+Repository = "https://github.com/compmech/structsolve"
+
+[tool.setuptools.packages.find]
+include = ["structsolve*"]

{structsolve-0.2.2 → structsolve-0.3.0}/setup.cfg

@@ -1,4 +1,4 @@
-[egg_info]
-tag_build = 
-tag_date = 0
-
+[egg_info]
+tag_build = 
+tag_date = 0
+

{structsolve-0.2.2 → structsolve-0.3.0}/structsolve/__init__.py

@@ -1,23 +1,23 @@
-r"""
-===============================================
-Structural Analysis Solver (:mod:`structsolve`)
-===============================================
-
-.. currentmodule:: structsolve
-
-.. autoclass:: Analysis
-    :members:
-
-.. autofunction:: freq
-
-.. autofunction:: lb
-
-.. autofunction:: static
-
-"""
-from __future__ import absolute_import
-
-from .analysis import Analysis
-from .freq import freq
-from .linear_buckling import lb
-from .static import solve, static
+r"""
+===============================================
+Structural Analysis Solver (:mod:`structsolve`)
+===============================================
+
+.. currentmodule:: structsolve
+
+.. autoclass:: Analysis
+    :members:
+
+.. autofunction:: freq
+
+.. autofunction:: lb
+
+.. autofunction:: static
+
+"""
+from __future__ import absolute_import
+
+from .analysis import Analysis
+from .freq import freq
+from .linear_buckling import lb
+from .static import solve, static

{structsolve-0.2.2 → structsolve-0.3.0}/structsolve/analysis.py

@@ -1,170 +1,170 @@
-from __future__ import absolute_import
-
-import numpy as np
-from numpy import dot
-
-from .static import solve
-from .logger import msg
-from .newton_raphson import _solver_NR
-from .arc_length_riks import _solver_arc_length_riks
-from .arc_length_crisfield import _solver_arc_length_crisfield
-
-
-class Analysis(object):
-    r"""Class that embodies all data required for linear/non-linear analysis
-
-    The parameters are described in the following tables:
-
-    ========================  ==================================================
-    Non-Linear Algorithm      Description
-    ========================  ==================================================
-    ``NL_method``             ``str``, ``'NR'`` for the Newton-Raphson
-                              ``'arc_length'`` for the Arc-Length method
-    ``line_search``           ``bool``, activate line_search (for
-                              Newton-Raphson methods only)
-    ``max_iter_line_search``  ``int``, maximum number of iteration attempts
-                              for the line-search algorithm
-    ``modified_NR``           ``bool``, activates the modified Newton-Raphson
-    ``compute_every_n``       ``int``, if ``modified_NR=True``, the non-linear
-                              matrices will be updated at every `n` iterations
-    ``kT_initial_state``      ``bool``, tells if the tangent stiffness matrix
-                              should be calculated already at the initial
-                              state, which is required for example when
-                              initial imperfections take place
-    ========================  ==================================================
-
-    ==============     =================================================
-    Incrementation     Description
-    ==============     =================================================
-    ``initialInc``     initial load increment size. In the arc-length
-                       method it will be the initial value for
-                       `\lambda`
-    ``minInc``         minimum increment size; if achieved the analysis
-                       is terminated. The arc-length method will use
-                       this parameter to terminate when the minimum
-                       arc-length increment is smaller than ``minInc``
-    ``maxInc``         maximum increment size
-    ``maxArcLength``   maximum length covered by the arc-length  search
-    ==============     =================================================
-
-    ====================    ============================================
-    Convergence Criteria    Description
-    ====================    ============================================
-    ``absTOL``              the convergence is achieved when the maximum
-                            residual force is smaller than this value
-    ``maxNumIter``          maximum number of iteration; if achieved the
-                            load increment is bisected
-    ``too_slow_TOL``        tolerance that tells if the convergence is too
-                            slow
-    ====================    ============================================
-
-    Parameters
-    ----------
-    calc_fext : callable, optional
-        Must return a 1-D array containing the external forces. Required for
-        linear/non-linear static analysis.
-    calc_fint : callable, optional
-        Must return a 1-D array containing the internal forces. Required for
-        non-linear analysis.
-    calc_kC : callable, optional
-        Must return a sparse matrix containing the constitutive stiffness matrix.
-        Required for linear/non-linear static analysis.
-    calc_kG : callable, optional
-        Must return a sparse matrix containing the geometric stiffness matrix.
-        Required for non-linear analysis.
-
-    Returns
-    -------
-    increments : list
-        Each time increment that achieved convergence.
-    cs : list
-        The solution for each increment.
-
-    """
-    __slots__ = ['NL_method', 'line_search', 'max_iter_line_search',
-            'modified_NR', 'compute_every_n',
-            'kT_initial_state', 'initialInc', 'minInc', 'maxInc',
-            'maxArcLength', 'absTOL', 'relTOL', 'maxNumIter', 'too_slow_TOL',
-            'increments', 'cs', 'last_analysis', 'calc_fext', 'calc_kC',
-            'calc_fint', 'calc_kG']
-
-
-    def __init__(self, calc_fext=None, calc_fint=None, calc_kC=None,
-            calc_kG=None):
-        # non-linear algorithm
-        self.NL_method = 'NR'
-        self.line_search = True
-        self.max_iter_line_search = 20
-        self.modified_NR = True
-        self.compute_every_n = 6
-        self.kT_initial_state = True
-        # incrementation
-        self.initialInc = 0.1
-        self.minInc = 1.e-4
-        self.maxInc = 1.
-        self.maxArcLength = 18
-        # convergence criteria
-        self.absTOL = 1.e-3
-        self.relTOL = 1.e-3
-        self.maxNumIter = 30
-        self.too_slow_TOL = 0.005
-
-        # required methods
-        self.calc_fext = calc_fext
-        self.calc_fint = calc_fint
-        self.calc_kC = calc_kC
-        self.calc_kG = calc_kG
-
-        # outputs to be filled
-        self.increments = None
-        self.cs = None
-
-        # flag telling the last analysis
-        self.last_analysis = ''
-
-
-    def static(self, NLgeom=False, silent=False):
-        """General solver for static analyses
-
-        Selects the specific solver based on the ``NL_method`` parameter.
-
-        Parameters
-        ----------
-
-        NLgeom : bool
-            Flag to indicate whether a linear or a non-linear analysis is to
-            be performed.
-        silent : bool, optional
-            A boolean to tell whether the log messages should be printed.
-
-        """
-        self.increments = []
-        self.cs = []
-
-        if NLgeom:
-            self.maxInc = max(self.initialInc, self.maxInc)
-            msg('Started Non-Linear Static Analysis', silent=silent)
-            if self.NL_method is 'NR':
-                _solver_NR(self, silent=silent)
-            elif self.NL_method is 'arc_length_riks':
-                _solver_arc_length_riks(self, silent=silent)
-            elif self.NL_method is 'arc_length_crisfield':
-                _solver_arc_length_crisfield(self, silent=silent)
-            else:
-                raise ValueError('{0} is an invalid NL_method')
-
-        else:
-            msg('Started Linear Static Analysis', silent=silent)
-            fext = self.calc_fext(silent=silent)
-            k0 = self.calc_kC(silent=silent)
-
-            c = solve(k0, fext, silent=silent)
-
-            self.cs.append(c)
-            self.increments.append(1.)
-            msg('Finished Linear Static Analysis', silent=silent)
-
-        self.last_analysis = 'static'
-
-        return self.increments, self.cs
-
+from __future__ import absolute_import
+
+import numpy as np
+from numpy import dot
+
+from .static import solve
+from .logger import msg
+from .newton_raphson import _solver_NR
+from .arc_length_riks import _solver_arc_length_riks
+from .arc_length_crisfield import _solver_arc_length_crisfield
+
+
+class Analysis(object):
+    r"""Class that embodies all data required for linear/non-linear analysis
+
+    The parameters are described in the following tables:
+
+    ========================  ==================================================
+    Non-Linear Algorithm      Description
+    ========================  ==================================================
+    ``NL_method``             ``str``, ``'NR'`` for the Newton-Raphson
+                              ``'arc_length'`` for the Arc-Length method
+    ``line_search``           ``bool``, activate line_search (for
+                              Newton-Raphson methods only)
+    ``max_iter_line_search``  ``int``, maximum number of iteration attempts
+                              for the line-search algorithm
+    ``modified_NR``           ``bool``, activates the modified Newton-Raphson
+    ``compute_every_n``       ``int``, if ``modified_NR=True``, the non-linear
+                              matrices will be updated at every `n` iterations
+    ``kT_initial_state``      ``bool``, tells if the tangent stiffness matrix
+                              should be calculated already at the initial
+                              state, which is required for example when
+                              initial imperfections take place
+    ========================  ==================================================
+
+    ==============     =================================================
+    Incrementation     Description
+    ==============     =================================================
+    ``initialInc``     initial load increment size. In the arc-length
+                       method it will be the initial value for
+                       `\lambda`
+    ``minInc``         minimum increment size; if achieved the analysis
+                       is terminated. The arc-length method will use
+                       this parameter to terminate when the minimum
+                       arc-length increment is smaller than ``minInc``
+    ``maxInc``         maximum increment size
+    ``maxArcLength``   maximum length covered by the arc-length  search
+    ==============     =================================================
+
+    ====================    ============================================
+    Convergence Criteria    Description
+    ====================    ============================================
+    ``absTOL``              the convergence is achieved when the maximum
+                            residual force is smaller than this value
+    ``maxNumIter``          maximum number of iteration; if achieved the
+                            load increment is bisected
+    ``too_slow_TOL``        tolerance that tells if the convergence is too
+                            slow
+    ====================    ============================================
+
+    Parameters
+    ----------
+    calc_fext : callable, optional
+        Must return a 1-D array containing the external forces. Required for
+        linear/non-linear static analysis.
+    calc_fint : callable, optional
+        Must return a 1-D array containing the internal forces. Required for
+        non-linear analysis.
+    calc_kC : callable, optional
+        Must return a sparse matrix containing the constitutive stiffness matrix.
+        Required for linear/non-linear static analysis.
+    calc_kG : callable, optional
+        Must return a sparse matrix containing the geometric stiffness matrix.
+        Required for non-linear analysis.
+
+    Returns
+    -------
+    increments : list
+        Each time increment that achieved convergence.
+    cs : list
+        The solution for each increment.
+
+    """
+    __slots__ = ['NL_method', 'line_search', 'max_iter_line_search',
+            'modified_NR', 'compute_every_n',
+            'kT_initial_state', 'initialInc', 'minInc', 'maxInc',
+            'maxArcLength', 'absTOL', 'relTOL', 'maxNumIter', 'too_slow_TOL',
+            'increments', 'cs', 'last_analysis', 'calc_fext', 'calc_kC',
+            'calc_fint', 'calc_kG']
+
+
+    def __init__(self, calc_fext=None, calc_fint=None, calc_kC=None,
+            calc_kG=None):
+        # non-linear algorithm
+        self.NL_method = 'NR'
+        self.line_search = True
+        self.max_iter_line_search = 20
+        self.modified_NR = True
+        self.compute_every_n = 6
+        self.kT_initial_state = True
+        # incrementation
+        self.initialInc = 0.1
+        self.minInc = 1.e-4
+        self.maxInc = 1.
+        self.maxArcLength = 18
+        # convergence criteria
+        self.absTOL = 1.e-3
+        self.relTOL = 1.e-3
+        self.maxNumIter = 30
+        self.too_slow_TOL = 0.005
+
+        # required methods
+        self.calc_fext = calc_fext
+        self.calc_fint = calc_fint
+        self.calc_kC = calc_kC
+        self.calc_kG = calc_kG
+
+        # outputs to be filled
+        self.increments = None
+        self.cs = None
+
+        # flag telling the last analysis
+        self.last_analysis = ''
+
+
+    def static(self, NLgeom=False, silent=False):
+        """General solver for static analyses
+
+        Selects the specific solver based on the ``NL_method`` parameter.
+
+        Parameters
+        ----------
+
+        NLgeom : bool
+            Flag to indicate whether a linear or a non-linear analysis is to
+            be performed.
+        silent : bool, optional
+            A boolean to tell whether the log messages should be printed.
+
+        """
+        self.increments = []
+        self.cs = []
+
+        if NLgeom:
+            self.maxInc = max(self.initialInc, self.maxInc)
+            msg('Started Non-Linear Static Analysis', silent=silent)
+            if self.NL_method == 'NR':
+                _solver_NR(self, silent=silent)
+            elif self.NL_method == 'arc_length_riks':
+                _solver_arc_length_riks(self, silent=silent)
+            elif self.NL_method == 'arc_length_crisfield':
+                _solver_arc_length_crisfield(self, silent=silent)
+            else:
+                raise ValueError('{0} is an invalid NL_method')
+
+        else:
+            msg('Started Linear Static Analysis', silent=silent)
+            fext = self.calc_fext(silent=silent)
+            k0 = self.calc_kC(silent=silent)
+
+            c = solve(k0, fext, silent=silent)
+
+            self.cs.append(c)
+            self.increments.append(1.)
+            msg('Finished Linear Static Analysis', silent=silent)
+
+        self.last_analysis = 'static'
+
+        return self.increments, self.cs
+