pathsim 0.25.1__tar.gz → 0.27.0__tar.gz

{pathsim-0.25.1 → pathsim-0.27.0}/PKG-INFO

@@ -1,11 +1,11 @@
 Metadata-Version: 2.4
 Name: pathsim
-Version: 0.25.1
+Version: 0.27.0
 Summary: A differentiable block based hybrid system simulation framework.
 Author-email: Milan Rother <milan.rother@gmx.de>
 License: MIT
 Project-URL: Homepage, https://github.com/pathsim/pathsim
-Project-URL: documentation, https://pathsim.readthedocs.io/en/latest/
+Project-URL: documentation, https://docs.pathsim.org
 Keywords: simulation,differentiable,hybrid systems
 Classifier: Programming Language :: Python :: 3
 Classifier: License :: OSI Approved :: MIT License

{pathsim-0.25.1 → pathsim-0.27.0}/pyproject.toml

@@ -28,7 +28,7 @@ test = ["pytest", "pytest-cov", "pytest-xdist", "FMPy", "scikit-rf"]
 
 [project.urls]
 Homepage = "https://github.com/pathsim/pathsim"
-documentation = "https://pathsim.readthedocs.io/en/latest/"
+documentation = "https://docs.pathsim.org"
 
 [tool.pytest.ini_options]
 addopts = "-m 'not slow'"

{pathsim-0.25.1 → pathsim-0.27.0}/src/pathsim/_version.py

@@ -18,7 +18,7 @@ version_tuple: tuple[int | str, ...]
 commit_id: str | None
 __commit_id__: str | None
 
-__version__ = version = '0.25.1'
-__version_tuple__ = version_tuple = (0, 25, 1)
+__version__ = version = '0.27.0'
+__version_tuple__ = version_tuple = (0, 27, 0)
 
-__commit_id__ = commit_id = 'gea36c5c1e'
+__commit_id__ = commit_id = 'g2cbb2f919'

{pathsim-0.25.1 → pathsim-0.27.0}/src/pathsim/blocks/dae.py

@@ -16,6 +16,8 @@ from ._block import Block
 from ..optim.operator import DynamicOperator
 from ..optim.anderson import NewtonAnderson, solve_root
 
+from .._constants import SOL_TOLERANCE_FPI
+
 
 # BLOCKS ================================================================================
 
@@ -54,10 +56,22 @@ class SemiExplicitDAE(Block):
     Note
     ----
     The reduced Jacobian :math:`\\partial \\dot{x} / \\partial x` handed to
-    implicit solvers is obtained from central finite differences through the
-    eliminated constraint. An analytical Jacobian :math:`\\partial
-    f_\\mathrm{alg} / \\partial z` accelerates the inner constraint solve and
-    can be supplied via `jac_z`.
+    implicit solvers follows from the implicit function theorem,
+
+    .. math::
+
+        \\frac{\\partial \\dot{x}}{\\partial x}
+        = \\frac{\\partial f_\\mathrm{dyn}}{\\partial x}
+        - \\frac{\\partial f_\\mathrm{dyn}}{\\partial z}
+          \\left(\\frac{\\partial f_\\mathrm{alg}}{\\partial z}\\right)^{-1}
+          \\frac{\\partial f_\\mathrm{alg}}{\\partial x}
+
+    It is used analytically when `jac_z`, `jac_dyn_x`, `jac_dyn_z` and
+    `jac_alg_x` are all supplied, otherwise it is approximated by central
+    finite differences through the eliminated constraint, which requires one
+    constraint solve per differential state and becomes expensive for large
+    systems. An analytical `jac_z` alone accelerates the inner constraint
+    solve.
 
     Example
     -------
@@ -99,6 +113,19 @@ class SemiExplicitDAE(Block):
         optional analytical jacobian of `func_alg` with respect to `z` with
         signature `jac_z(x, z, u, t)`, central finite differences are used if
         `None`
+    jac_dyn_x : callable, None
+        optional analytical jacobian of `func_dyn` with respect to `x` with
+        signature `jac_dyn_x(x, z, u, t)`, used for the reduced jacobian
+    jac_dyn_z : callable, None
+        optional analytical jacobian of `func_dyn` with respect to `z` with
+        signature `jac_dyn_z(x, z, u, t)`, used for the reduced jacobian
+    jac_alg_x : callable, None
+        optional analytical jacobian of `func_alg` with respect to `x` with
+        signature `jac_alg_x(x, z, u, t)`, used for the reduced jacobian
+    tolerance : float
+        convergence tolerance on the residual norm of the algebraic constraint
+        solve, loosen it for ill-conditioned constraints whose residual cannot
+        reach the default due to roundoff
 
     Attributes
     ----------
@@ -117,7 +144,11 @@ class SemiExplicitDAE(Block):
         func_alg=lambda x, z, u, t: z,
         initial_value=0.0,
         z0=0.0,
-        jac_z=None
+        jac_z=None,
+        jac_dyn_x=None,
+        jac_dyn_z=None,
+        jac_alg_x=None,
+        tolerance=SOL_TOLERANCE_FPI
         ):
 
         super().__init__()
@@ -126,9 +157,17 @@ class SemiExplicitDAE(Block):
         self.func_dyn = func_dyn
         self.func_alg = func_alg
 
+        #convergence tolerance of the algebraic constraint solve
+        self.tolerance = tolerance
+
         #optional analytical jacobian of the constraint w.r.t. z
         self.jac_z = jac_z
 
+        #optional analytical jacobians for the reduced jacobian
+        self.jac_dyn_x = jac_dyn_x
+        self.jac_dyn_z = jac_dyn_z
+        self.jac_alg_x = jac_alg_x
+
         #initial condition of the differential states (drives the engine)
         self.initial_value = np.atleast_1d(initial_value).astype(float)
 
@@ -140,8 +179,12 @@ class SemiExplicitDAE(Block):
         self.opt = NewtonAnderson()
 
         #dynamic operator for the reduced right hand side, mirrors the ODE block
-        #and supplies the engine Jacobian through 'op_dyn.jac_x'
-        self.op_dyn = DynamicOperator(func=self._rhs)
+        #and supplies the engine Jacobian through 'op_dyn.jac_x'; the reduced
+        #Jacobian is analytic (implicit function theorem) when all jacobians
+        #are given, otherwise the operator falls back to finite differences
+        _all_jacs = (jac_z, jac_dyn_x, jac_dyn_z, jac_alg_x)
+        _jac_x = self._reduced_jac if all(j is not None for j in _all_jacs) else None
+        self.op_dyn = DynamicOperator(func=self._rhs, jac_x=_jac_x)
 
         #pre-size the output register to the stacked state [x, z]
         self.outputs.update_from_array(
@@ -188,7 +231,7 @@ class SemiExplicitDAE(Block):
         """
         _func = lambda z: self.func_alg(x, z, u, t)
         _jac = None if self.jac_z is None else (lambda z: self.jac_z(x, z, u, t))
-        z, _, _ = solve_root(self.opt, _func, self._z, _jac)
+        z, _, _ = solve_root(self.opt, _func, self._z, _jac, tolerance=self.tolerance)
         return z
 
 
@@ -213,6 +256,33 @@ class SemiExplicitDAE(Block):
         return self.func_dyn(x, self._solve_z(x, u, t), u, t)
 
 
+    def _reduced_jac(self, x, u, t):
+        """Analytical reduced Jacobian from the implicit function theorem,
+        :math:`f_x - f_z (g_z)^{-1} g_x` with the dynamic part `f` and the
+        algebraic constraint `g`.
+
+        Parameters
+        ----------
+        x : array[float]
+            current differential states
+        u : array[float]
+            current block input
+        t : float
+            evaluation time
+
+        Returns
+        -------
+        J : array[array[float]]
+            reduced jacobian of the differential states
+        """
+        z = self._solve_z(x, u, t)
+        fx = np.atleast_2d(self.jac_dyn_x(x, z, u, t))
+        fz = np.atleast_2d(self.jac_dyn_z(x, z, u, t))
+        gx = np.atleast_2d(self.jac_alg_x(x, z, u, t))
+        gz = np.atleast_2d(self.jac_z(x, z, u, t))
+        return fx - fz @ np.linalg.solve(gz, gx)
+
+
     def update(self, t):
         """Eliminate the algebraic states for the current input and expose the
         stacked state [x, z] at the output.
@@ -354,6 +424,10 @@ class MassMatrixDAE(Block):
     jac : callable, None
         optional analytical jacobian of `func` with respect to `x` with
         signature `jac(x, u, t)`, central finite differences are used if `None`
+    tolerance : float
+        convergence tolerance on the residual norm of the algebraic constraint
+        solve, loosen it for ill-conditioned constraints whose residual cannot
+        reach the default due to roundoff
 
     Attributes
     ----------
@@ -367,13 +441,24 @@ class MassMatrixDAE(Block):
         internal Newton-Anderson optimizer for the algebraic constraints
     """
 
-    def __init__(self, func=lambda x, u, t: -x, mass=1.0, initial_value=0.0, jac=None):
+    def __init__(
+        self,
+        func=lambda x, u, t: -x,
+        mass=1.0,
+        initial_value=0.0,
+        jac=None,
+        tolerance=SOL_TOLERANCE_FPI
+        ):
+
         super().__init__()
 
         #right hand side and optional analytical jacobian
         self.func = func
         self.jac = jac
 
+        #convergence tolerance of the algebraic constraint solve
+        self.tolerance = tolerance
+
         #constant mass matrix
         M = np.atleast_2d(np.asarray(mass, dtype=float))
         n = M.shape[0]
@@ -389,20 +474,54 @@ class MassMatrixDAE(Block):
                 )
         self._x0 = x0
 
-        #partition into differential (nonzero row) and algebraic (zero row) states
-        _nonzero_row = np.any(M != 0.0, axis=1)
-        self._d = np.flatnonzero(_nonzero_row)
-        self._a = np.flatnonzero(~_nonzero_row)
+        #partition into differential (nonzero column) and algebraic (zero column) states
+        _nonzero_column = np.any(M != 0.0, axis=0)
+        self._d = np.flatnonzero(_nonzero_column)
+        self._a = np.flatnonzero(~_nonzero_column)
+
+        #partition into differential (nonzero row) and algebraic (zero row) equations
+        _non_zero_rows = np.any(M != 0.0, axis=1)
+        self._d_equations = np.flatnonzero(_non_zero_rows)
+        self._a_equations = np.flatnonzero(~_non_zero_rows)
 
         #index-1 form: differential rows must not weight algebraic derivatives
-        if self._a.size and np.any(M[np.ix_(self._d, self._a)] != 0.0):
+        if self._a.size and np.any(M[np.ix_(self._d_equations, self._a)] != 0.0):
             raise ValueError(
                 "mass matrix is not in index-1 form: differential rows couple "
                 "to the derivatives of algebraic states"
                 )
 
-        #LU factorisation of the (constant) differential mass block
-        self._lu = lu_factor(M[np.ix_(self._d, self._d)])
+        #factorise the constant differential mass block when it is square; use
+        #the pseudoinverse for rectangular reduced systems so underdetermined
+        #differential blocks still admit a minimum-norm solution.
+        self._d_mass = M[np.ix_(self._d_equations, self._d)]
+        if self._d_mass.shape[0] == self._d_mass.shape[1]:
+            self._lu = lu_factor(self._d_mass)
+            self._solve_mass_rhs = lambda rhs: lu_solve(self._lu, rhs)
+            self._solve_mass_matrix = lambda mat: lu_solve(self._lu, mat)
+        else:
+            # Use SVD once and apply the pseudoinverse implicitly for stability
+            # and to avoid forming a dense pseudoinverse matrix.
+            U, s, Vt = np.linalg.svd(self._d_mass, full_matrices=False)
+            eps = np.finfo(float).eps
+            tol = max(self._d_mass.shape) * (s.max() if s.size else 0.0) * eps
+            s_inv = np.array([1.0/si if si > tol else 0.0 for si in s])
+
+            # store factors (optional) and set solver callables
+            self._svd_U = U
+            self._svd_s_inv = s_inv
+            self._svd_Vt = Vt
+
+            def _solve_mass_rhs(rhs):
+                # rhs can be vector or matrix; apply V * S_inv * (U.T @ rhs)
+                return (Vt.T * s_inv) @ (U.T @ rhs)
+
+            def _solve_mass_matrix(mat):
+                # mat: matrix of columns to be solved
+                return (Vt.T * s_inv) @ (U.T @ mat)
+
+            self._solve_mass_rhs = _solve_mass_rhs
+            self._solve_mass_matrix = _solve_mass_matrix
 
         #the engine integrates only the differential states
         self.initial_value = x0[self._d]
@@ -418,7 +537,9 @@ class MassMatrixDAE(Block):
         #when 'jac' is given, otherwise the operator falls back to finite differences
         _jac_x = None
         if self._a.size == 0 and jac is not None:
-            _jac_x = lambda x, u, t: lu_solve(self._lu, np.atleast_2d(jac(x, u, t)))
+            def _jac_x(x, u, t):
+                J = np.atleast_2d(jac(x, u, t))[np.ix_(self._d_equations, self._d)]
+                return self._solve_mass_matrix(J)
         self.op_dyn = DynamicOperator(func=self._rhs, jac_x=_jac_x)
 
         #pre-size the output register to the full state
@@ -496,7 +617,7 @@ class MassMatrixDAE(Block):
                 x[self._d], x[self._a] = x_d, xa
                 return np.atleast_2d(self.jac(x, u, t))[np.ix_(self._a, self._a)]
 
-        xa, _, _ = solve_root(self.opt, _res, self._xa, _jac)
+        xa, _, _ = solve_root(self.opt, _res, self._xa, _jac, tolerance=self.tolerance)
         return xa
 
 
@@ -524,7 +645,7 @@ class MassMatrixDAE(Block):
             xa = self._solve_xa(x_d, u, t)
             x = np.empty(self.mass.shape[0])
             x[self._d], x[self._a] = x_d, xa
-        return lu_solve(self._lu, self.func(x, u, t)[self._d])
+        return self._solve_mass_rhs(self.func(x, u, t)[self._d_equations])
 
 
     def update(self, t):
@@ -561,7 +682,8 @@ class MassMatrixDAE(Block):
 
         #commit the warm-start at the current state, then linearize around it
         self._xa = self._solve_xa(x_d, u, t)
-        f = lu_solve(self._lu, self.func(self._full(x_d), u, t)[self._d])
+        f = self._solve_mass_rhs(self.func(self._full(x_d), u, t)[self._d_equations])
+
         J = self.op_dyn.jac_x(x_d, u, t)
 
         return self.engine.solve(f, J, dt)
@@ -588,7 +710,7 @@ class MassMatrixDAE(Block):
         """
         x_d, u = self.engine.state, self.inputs.to_array()
         self._xa = self._solve_xa(x_d, u, t)
-        f = lu_solve(self._lu, self.func(self._full(x_d), u, t)[self._d])
+        f = self._solve_mass_rhs(self.func(self._full(x_d), u, t)[self._d_equations])
         return self.engine.step(f, dt)
 
 
@@ -666,6 +788,10 @@ class FullyImplicitDAE(Block):
         signature `jac_xdot(x, xdot, u, t)`, accelerates the inner solve and is
         used for the reduced jacobian, central finite differences are used if
         `None`
+    tolerance : float
+        convergence tolerance on the residual norm of the state derivative
+        solve, loosen it for ill-conditioned residuals that cannot reach the
+        default due to roundoff
 
     Attributes
     ----------
@@ -682,7 +808,8 @@ class FullyImplicitDAE(Block):
         func=lambda x, xdot, u, t: xdot + x,
         initial_value=0.0,
         jac_x=None,
-        jac_xdot=None
+        jac_xdot=None,
+        tolerance=SOL_TOLERANCE_FPI
         ):
 
         super().__init__()
@@ -692,6 +819,9 @@ class FullyImplicitDAE(Block):
         self.jac_x = jac_x
         self.jac_xdot = jac_xdot
 
+        #convergence tolerance of the state derivative solve
+        self.tolerance = tolerance
+
         #initial condition of the state (drives the engine)
         self.initial_value = np.atleast_1d(initial_value).astype(float)
 
@@ -746,7 +876,7 @@ class FullyImplicitDAE(Block):
         _res = lambda xd: self.func(x, xd, u, t)
         _jac = None if self.jac_xdot is None \
             else (lambda xd: self.jac_xdot(x, xd, u, t))
-        xdot, _, _ = solve_root(self.opt, _res, self._xdot, _jac)
+        xdot, _, _ = solve_root(self.opt, _res, self._xdot, _jac, tolerance=self.tolerance)
         return xdot
 
 

{pathsim-0.25.1 → pathsim-0.27.0}/src/pathsim/utils/graph.py

@@ -331,19 +331,22 @@ class Graph:
         """Optimized loop processing with minimal overhead.
 
         Finds strongly connected components (SCCs) within the loop blocks, determines
-        entry points for each SCC, and performs BFS to assign local depths. Identifies
+        entry points for each SCC, and performs BFS to assign local depths. Includes
+        acyclic descendants in dependency order alongside cycles. Identifies
         loop-closing connections (back edges) that need special handling.
 
         Parameters
         ----------
         blocks_loop : set
-            set of blocks that are part of algebraic loops
+            set of blocks that are part of or depend on algebraic loops
         """
         if not blocks_loop:
             return
 
-        # Find SCCs (already optimized)
-        sccs = self._find_strongly_connected_components(blocks_loop)
+        # Tarjan emits downstream components before their upstream dependencies.
+        # Reverse that order so each component receives updated upstream outputs
+        # before it is evaluated in the same loop-solver iteration.
+        sccs = reversed(self._find_strongly_connected_components(blocks_loop))
         
         current_depth = 0
 
@@ -433,7 +436,7 @@ class Graph:
     def _find_strongly_connected_components(self, blocks):
         """Iterative Tarjan's algorithm using cleaner state machine.
 
-        Finds strongly connected components (cycles) within the given blocks using
+        Finds all strongly connected components within the given blocks using
         an iterative implementation of Tarjan's algorithm. Avoids recursion limits
         that can occur with deep graphs.
 
@@ -445,7 +448,7 @@ class Graph:
         Returns
         -------
         list
-            list of SCCs, where each SCC is a list of blocks forming a cycle
+            list of SCCs in reverse topological order, including acyclic singletons
         """
         if not blocks:
             return []
@@ -508,11 +511,12 @@ class Graph:
                             if w == node:
                                 break
                         
-                        # Keep only actual cycles
-                        if len(scc) > 1:
-                            result.append(scc)
-                        elif scc[0] in successors_cache[scc[0]]:
-                            result.append(scc)
+                        # A block downstream of a loop can form a singleton SCC
+                        # without being part of a cycle. Its loop dependency keeps
+                        # it out of the ordinary DAG schedule, so discarding it here
+                        # would leave it unevaluated. Keep it in the loop schedule;
+                        # only actual cycle-closing connections receive acceleration.
+                        result.append(scc)
                     
                     # Update parent's lowlink if there is a parent
                     if work_stack:

{pathsim-0.25.1 → pathsim-0.27.0}/src/pathsim.egg-info/PKG-INFO

@@ -1,11 +1,11 @@
 Metadata-Version: 2.4
 Name: pathsim
-Version: 0.25.1
+Version: 0.27.0
 Summary: A differentiable block based hybrid system simulation framework.
 Author-email: Milan Rother <milan.rother@gmx.de>
 License: MIT
 Project-URL: Homepage, https://github.com/pathsim/pathsim
-Project-URL: documentation, https://pathsim.readthedocs.io/en/latest/
+Project-URL: documentation, https://docs.pathsim.org
 Keywords: simulation,differentiable,hybrid systems
 Classifier: Programming Language :: Python :: 3
 Classifier: License :: OSI Approved :: MIT License

{pathsim-0.25.1 → pathsim-0.27.0}/src/pathsim.egg-info/SOURCES.txt

@@ -12,21 +12,7 @@ pyproject.toml
 .github/workflows/pypi_deployment.yml
 .github/workflows/tests_codecov.yml
 .github/workflows/urlchecker.yml
-docs/.readthedocs.yaml
-docs/Makefile
-docs/requirements.txt
-docs/source/api.rst
-docs/source/conf.py
-docs/source/contributing.rst
-docs/source/examples.rst
-docs/source/index.rst
 docs/source/pathsim_docs.mplstyle
-docs/source/quickstart.ipynb
-docs/source/roadmap.rst
-docs/source/roadmap_generated.rst
-docs/source/_ext/github_issues.py
-docs/source/_static/custom.css
-docs/source/_static/redirect.js
 docs/source/examples/abs_braking.ipynb
 docs/source/examples/algebraic_loop.ipynb
 docs/source/examples/billards.ipynb
@@ -110,92 +96,9 @@ docs/source/examples/figures/figures_g/vanderpol_subsystem_lvl1_g.png
 docs/source/examples/figures/figures_g/vanderpol_subsystem_lvl2_g.png
 docs/source/examples/figures/figures_g/vanderpol_subsystem_lvl3_g.png
 docs/source/examples/figures/figures_g/volterralotka_blockdiagram_g.png
-docs/source/figures/pathsim_object_hierarchy_g.png
-docs/source/figures/pathsim_solver_hierarchy_g.png
-docs/source/figures/sin_cos_blockdiagram_g.png
-docs/source/figures/system_g.png
 docs/source/logos/pathsim_icon.png
 docs/source/logos/pathsim_logo.png
 docs/source/logos/pathsim_simplistic_logo.png
-docs/source/modules/pathsim.blocks._block.rst
-docs/source/modules/pathsim.blocks.adder.rst
-docs/source/modules/pathsim.blocks.amplifier.rst
-docs/source/modules/pathsim.blocks.comparator.rst
-docs/source/modules/pathsim.blocks.converters.rst
-docs/source/modules/pathsim.blocks.counter.rst
-docs/source/modules/pathsim.blocks.ctrl.rst
-docs/source/modules/pathsim.blocks.delay.rst
-docs/source/modules/pathsim.blocks.differentiator.rst
-docs/source/modules/pathsim.blocks.discrete.rst
-docs/source/modules/pathsim.blocks.dynsys.rst
-docs/source/modules/pathsim.blocks.filters.rst
-docs/source/modules/pathsim.blocks.fmu.rst
-docs/source/modules/pathsim.blocks.function.rst
-docs/source/modules/pathsim.blocks.integrator.rst
-docs/source/modules/pathsim.blocks.kalman.rst
-docs/source/modules/pathsim.blocks.lti.rst
-docs/source/modules/pathsim.blocks.math.rst
-docs/source/modules/pathsim.blocks.multiplier.rst
-docs/source/modules/pathsim.blocks.noise.rst
-docs/source/modules/pathsim.blocks.ode.rst
-docs/source/modules/pathsim.blocks.relay.rst
-docs/source/modules/pathsim.blocks.rf.rst
-docs/source/modules/pathsim.blocks.rng.rst
-docs/source/modules/pathsim.blocks.rst
-docs/source/modules/pathsim.blocks.scope.rst
-docs/source/modules/pathsim.blocks.sources.rst
-docs/source/modules/pathsim.blocks.spectrum.rst
-docs/source/modules/pathsim.blocks.switch.rst
-docs/source/modules/pathsim.blocks.table.rst
-docs/source/modules/pathsim.blocks.wrapper.rst
-docs/source/modules/pathsim.connection.rst
-docs/source/modules/pathsim.events._event.rst
-docs/source/modules/pathsim.events.condition.rst
-docs/source/modules/pathsim.events.rst
-docs/source/modules/pathsim.events.schedule.rst
-docs/source/modules/pathsim.events.zerocrossing.rst
-docs/source/modules/pathsim.optim.anderson.rst
-docs/source/modules/pathsim.optim.booster.rst
-docs/source/modules/pathsim.optim.numerical.rst
-docs/source/modules/pathsim.optim.operator.rst
-docs/source/modules/pathsim.optim.rst
-docs/source/modules/pathsim.simulation.rst
-docs/source/modules/pathsim.solvers._rungekutta.rst
-docs/source/modules/pathsim.solvers._solver.rst
-docs/source/modules/pathsim.solvers.bdf.rst
-docs/source/modules/pathsim.solvers.dirk2.rst
-docs/source/modules/pathsim.solvers.dirk3.rst
-docs/source/modules/pathsim.solvers.esdirk32.rst
-docs/source/modules/pathsim.solvers.esdirk4.rst
-docs/source/modules/pathsim.solvers.esdirk43.rst
-docs/source/modules/pathsim.solvers.esdirk54.rst
-docs/source/modules/pathsim.solvers.esdirk85.rst
-docs/source/modules/pathsim.solvers.euler.rst
-docs/source/modules/pathsim.solvers.gear.rst
-docs/source/modules/pathsim.solvers.rk4.rst
-docs/source/modules/pathsim.solvers.rkbs32.rst
-docs/source/modules/pathsim.solvers.rkck54.rst
-docs/source/modules/pathsim.solvers.rkdp54.rst
-docs/source/modules/pathsim.solvers.rkdp87.rst
-docs/source/modules/pathsim.solvers.rkf21.rst
-docs/source/modules/pathsim.solvers.rkf45.rst
-docs/source/modules/pathsim.solvers.rkf78.rst
-docs/source/modules/pathsim.solvers.rkv65.rst
-docs/source/modules/pathsim.solvers.rst
-docs/source/modules/pathsim.solvers.ssprk22.rst
-docs/source/modules/pathsim.solvers.ssprk33.rst
-docs/source/modules/pathsim.solvers.ssprk34.rst
-docs/source/modules/pathsim.solvers.steadystate.rst
-docs/source/modules/pathsim.subsystem.rst
-docs/source/modules/pathsim.utils.adaptivebuffer.rst
-docs/source/modules/pathsim.utils.analysis.rst
-docs/source/modules/pathsim.utils.gilbert.rst
-docs/source/modules/pathsim.utils.logger.rst
-docs/source/modules/pathsim.utils.portreference.rst
-docs/source/modules/pathsim.utils.progresstracker.rst
-docs/source/modules/pathsim.utils.realtimeplotter.rst
-docs/source/modules/pathsim.utils.register.rst
-docs/source/modules/pathsim.utils.rst
 examples/example_abs_braking.py
 examples/example_adc.py
 examples/example_algebraicchain.py

{pathsim-0.25.1 → pathsim-0.27.0}/src/pathsim.egg-info/scm_file_list.json

@@ -12,16 +12,6 @@
     "LICENSE.txt",
     "README.md",
     "conftest.py",
-    "docs/.readthedocs.yaml",
-    "docs/Makefile",
-    "docs/requirements.txt",
-    "docs/source/_ext/github_issues.py",
-    "docs/source/_static/custom.css",
-    "docs/source/_static/redirect.js",
-    "docs/source/api.rst",
-    "docs/source/conf.py",
-    "docs/source/contributing.rst",
-    "docs/source/examples.rst",
     "docs/source/examples/abs_braking.ipynb",
     "docs/source/examples/algebraic_loop.ipynb",
     "docs/source/examples/billards.ipynb",
@@ -105,97 +95,10 @@
     "docs/source/examples/thermostat.ipynb",
     "docs/source/examples/transfer_function.ipynb",
     "docs/source/examples/vanderpol.ipynb",
-    "docs/source/figures/pathsim_object_hierarchy_g.png",
-    "docs/source/figures/pathsim_solver_hierarchy_g.png",
-    "docs/source/figures/sin_cos_blockdiagram_g.png",
-    "docs/source/figures/system_g.png",
-    "docs/source/index.rst",
     "docs/source/logos/pathsim_icon.png",
     "docs/source/logos/pathsim_logo.png",
     "docs/source/logos/pathsim_simplistic_logo.png",
-    "docs/source/modules/pathsim.blocks._block.rst",
-    "docs/source/modules/pathsim.blocks.adder.rst",
-    "docs/source/modules/pathsim.blocks.amplifier.rst",
-    "docs/source/modules/pathsim.blocks.comparator.rst",
-    "docs/source/modules/pathsim.blocks.converters.rst",
-    "docs/source/modules/pathsim.blocks.counter.rst",
-    "docs/source/modules/pathsim.blocks.ctrl.rst",
-    "docs/source/modules/pathsim.blocks.delay.rst",
-    "docs/source/modules/pathsim.blocks.differentiator.rst",
-    "docs/source/modules/pathsim.blocks.discrete.rst",
-    "docs/source/modules/pathsim.blocks.dynsys.rst",
-    "docs/source/modules/pathsim.blocks.filters.rst",
-    "docs/source/modules/pathsim.blocks.fmu.rst",
-    "docs/source/modules/pathsim.blocks.function.rst",
-    "docs/source/modules/pathsim.blocks.integrator.rst",
-    "docs/source/modules/pathsim.blocks.kalman.rst",
-    "docs/source/modules/pathsim.blocks.lti.rst",
-    "docs/source/modules/pathsim.blocks.math.rst",
-    "docs/source/modules/pathsim.blocks.multiplier.rst",
-    "docs/source/modules/pathsim.blocks.noise.rst",
-    "docs/source/modules/pathsim.blocks.ode.rst",
-    "docs/source/modules/pathsim.blocks.relay.rst",
-    "docs/source/modules/pathsim.blocks.rf.rst",
-    "docs/source/modules/pathsim.blocks.rng.rst",
-    "docs/source/modules/pathsim.blocks.rst",
-    "docs/source/modules/pathsim.blocks.scope.rst",
-    "docs/source/modules/pathsim.blocks.sources.rst",
-    "docs/source/modules/pathsim.blocks.spectrum.rst",
-    "docs/source/modules/pathsim.blocks.switch.rst",
-    "docs/source/modules/pathsim.blocks.table.rst",
-    "docs/source/modules/pathsim.blocks.wrapper.rst",
-    "docs/source/modules/pathsim.connection.rst",
-    "docs/source/modules/pathsim.events._event.rst",
-    "docs/source/modules/pathsim.events.condition.rst",
-    "docs/source/modules/pathsim.events.rst",
-    "docs/source/modules/pathsim.events.schedule.rst",
-    "docs/source/modules/pathsim.events.zerocrossing.rst",
-    "docs/source/modules/pathsim.optim.anderson.rst",
-    "docs/source/modules/pathsim.optim.booster.rst",
-    "docs/source/modules/pathsim.optim.numerical.rst",
-    "docs/source/modules/pathsim.optim.operator.rst",
-    "docs/source/modules/pathsim.optim.rst",
-    "docs/source/modules/pathsim.simulation.rst",
-    "docs/source/modules/pathsim.solvers._rungekutta.rst",
-    "docs/source/modules/pathsim.solvers._solver.rst",
-    "docs/source/modules/pathsim.solvers.bdf.rst",
-    "docs/source/modules/pathsim.solvers.dirk2.rst",
-    "docs/source/modules/pathsim.solvers.dirk3.rst",
-    "docs/source/modules/pathsim.solvers.esdirk32.rst",
-    "docs/source/modules/pathsim.solvers.esdirk4.rst",
-    "docs/source/modules/pathsim.solvers.esdirk43.rst",
-    "docs/source/modules/pathsim.solvers.esdirk54.rst",
-    "docs/source/modules/pathsim.solvers.esdirk85.rst",
-    "docs/source/modules/pathsim.solvers.euler.rst",
-    "docs/source/modules/pathsim.solvers.gear.rst",
-    "docs/source/modules/pathsim.solvers.rk4.rst",
-    "docs/source/modules/pathsim.solvers.rkbs32.rst",
-    "docs/source/modules/pathsim.solvers.rkck54.rst",
-    "docs/source/modules/pathsim.solvers.rkdp54.rst",
-    "docs/source/modules/pathsim.solvers.rkdp87.rst",
-    "docs/source/modules/pathsim.solvers.rkf21.rst",
-    "docs/source/modules/pathsim.solvers.rkf45.rst",
-    "docs/source/modules/pathsim.solvers.rkf78.rst",
-    "docs/source/modules/pathsim.solvers.rkv65.rst",
-    "docs/source/modules/pathsim.solvers.rst",
-    "docs/source/modules/pathsim.solvers.ssprk22.rst",
-    "docs/source/modules/pathsim.solvers.ssprk33.rst",
-    "docs/source/modules/pathsim.solvers.ssprk34.rst",
-    "docs/source/modules/pathsim.solvers.steadystate.rst",
-    "docs/source/modules/pathsim.subsystem.rst",
-    "docs/source/modules/pathsim.utils.adaptivebuffer.rst",
-    "docs/source/modules/pathsim.utils.analysis.rst",
-    "docs/source/modules/pathsim.utils.gilbert.rst",
-    "docs/source/modules/pathsim.utils.logger.rst",
-    "docs/source/modules/pathsim.utils.portreference.rst",
-    "docs/source/modules/pathsim.utils.progresstracker.rst",
-    "docs/source/modules/pathsim.utils.realtimeplotter.rst",
-    "docs/source/modules/pathsim.utils.register.rst",
-    "docs/source/modules/pathsim.utils.rst",
     "docs/source/pathsim_docs.mplstyle",
-    "docs/source/quickstart.ipynb",
-    "docs/source/roadmap.rst",
-    "docs/source/roadmap_generated.rst",
     "examples/example_abs_braking.py",
     "examples/example_adc.py",
     "examples/example_algebraicchain.py",