pyMOTO 1.0.1__tar.gz → 1.0.2rc1__tar.gz

{pyMOTO-1.0.1 → pyMOTO-1.0.2rc1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: pyMOTO
-Version: 1.0.1
+Version: 1.0.2rc1
 Summary: Example package description
 Home-page: https://github.com/aatmdelissen/pyMOTO
 Author: Arnoud Delissen
@@ -15,6 +15,8 @@ Description-Content-Type: text/markdown
 Provides-Extra: dev
 License-File: LICENSE
 
+[![10.5281/zenodo.7708738](https://zenodo.org/badge/DOI/10.5281/zenodo.7708738.svg)](https://doi.org/10.5281/zenodo.7708738)
+
 # pyMOTO
 
 * [Link to Documentation](https://pymoto.readthedocs.io)
@@ -54,35 +56,19 @@ A local installation for development in `pyMOTO` can be done by first downloadin
 * **SymPy** - Symbolic differentiation for `MathGeneral` module
 * **Matplotlib** - Plotting and visualisation
 * (optional) **SAO** - Sequential approximated optimizers
-* (optional) **opt_einsum** - Optimized function for `EinSum` module
+* (optional) [**opt_einsum**](https://optimized-einsum.readthedocs.io/en/stable/install.html) - Optimized function for `EinSum` module
 
 For fast linear solvers for sparse matrices:
-* (optional) **scikit-umfpack** - Fast LU linear solver based on UMFPACK
-* (optional) **sksparse** - Fast Cholesky solver based on CHOLMOD
-* (optional) **CVXopt** - Another fast Cholesky solver based on CHOLMOD
-* (optional) **Intel OneAPI** - Non-python library with a fast PARDISO solver
+* (optional) [**pypardiso**](https://github.com/haasad/PyPardisoProject) - Uses the Intel OneAPI PARDISO solver (recommended)
+* (optional) [**scikit-umfpack**](https://scikit-umfpack.github.io/scikit-umfpack/install.html) - Fast LU linear solver based on UMFPACK
+* (optional) [**scikit-sparse**](https://github.com/scikit-sparse/scikit-sparse) - Fast Cholesky solver based on CHOLMOD
+* (optional) [**cvxopt**](https://cvxopt.org/install/index.html) - Another fast Cholesky solver based on CHOLMOD
 
 __Note on linear solvers for sparse matrices:__ Scipy implements a version of LU which is quite slow. To increase the 
-speed of the optimization, `Intel OneAPI` is recommended as it contains a very robust and flexible solver for symmetric 
+speed of the optimization, `pypardiso` is recommended as it contains a very robust and flexible solver for symmetric 
 and asymmetric matrices. An alternative is `scikit-umfpack` which provides a fast LU factorization. For symmetric 
 matrices a Cholesky factorization is recommended (not provided with Scipy), which can be used by either installing 
-`sksparse` or `cvxopt`.
-
-
-## How to make Python fast with Intel OneAPI
-Intel provides a toolkit with many fast math operations and solvers called OneAPI (basekit). 
-It can easily be installed on Linux by for instance following the steps described in https://www.intel.com/content/www/us/en/develop/documentation/installation-guide-for-intel-oneapi-toolkits-linux/top/installation/install-using-package-managers/apt.html
-For other OSes installation can be found in https://www.intel.com/content/www/us/en/developer/articles/guide/installation-guide-for-oneapi-toolkits.html
-
-The nice thing about OneAPI is that it also includes an optimized version of Python. To use it follow the next steps (Linux)
-
-1. `source <intel install location>/intel/oneapi/setvars.sh` (usually installed in `/opt/intel` or `/opt/ud/intel`). This loads the Intel OneAPI package.
-2. `conda create --name <venv_name> --clone base` to create a new conda virtual environment to work in.
-3. `conda activate <venv_name>` to activate the virtual environment.
-
-### Usage of multi-thread linear solvers
-Intel has a Pardiso type linear solver for fast solution of large systems.
-To use it.....
+`scikit-sparse` or `cvxopt`.
 
 # License
 pyMOTO is available under te [MIT License](https://opensource.org/licenses/MIT).

{pyMOTO-1.0.1 → pyMOTO-1.0.2rc1}/README.md

@@ -1,3 +1,5 @@
+[![10.5281/zenodo.7708738](https://zenodo.org/badge/DOI/10.5281/zenodo.7708738.svg)](https://doi.org/10.5281/zenodo.7708738)
+
 # pyMOTO
 
 * [Link to Documentation](https://pymoto.readthedocs.io)
@@ -37,35 +39,19 @@ A local installation for development in `pyMOTO` can be done by first downloadin
 * **SymPy** - Symbolic differentiation for `MathGeneral` module
 * **Matplotlib** - Plotting and visualisation
 * (optional) **SAO** - Sequential approximated optimizers
-* (optional) **opt_einsum** - Optimized function for `EinSum` module
+* (optional) [**opt_einsum**](https://optimized-einsum.readthedocs.io/en/stable/install.html) - Optimized function for `EinSum` module
 
 For fast linear solvers for sparse matrices:
-* (optional) **scikit-umfpack** - Fast LU linear solver based on UMFPACK
-* (optional) **sksparse** - Fast Cholesky solver based on CHOLMOD
-* (optional) **CVXopt** - Another fast Cholesky solver based on CHOLMOD
-* (optional) **Intel OneAPI** - Non-python library with a fast PARDISO solver
+* (optional) [**pypardiso**](https://github.com/haasad/PyPardisoProject) - Uses the Intel OneAPI PARDISO solver (recommended)
+* (optional) [**scikit-umfpack**](https://scikit-umfpack.github.io/scikit-umfpack/install.html) - Fast LU linear solver based on UMFPACK
+* (optional) [**scikit-sparse**](https://github.com/scikit-sparse/scikit-sparse) - Fast Cholesky solver based on CHOLMOD
+* (optional) [**cvxopt**](https://cvxopt.org/install/index.html) - Another fast Cholesky solver based on CHOLMOD
 
 __Note on linear solvers for sparse matrices:__ Scipy implements a version of LU which is quite slow. To increase the 
-speed of the optimization, `Intel OneAPI` is recommended as it contains a very robust and flexible solver for symmetric 
+speed of the optimization, `pypardiso` is recommended as it contains a very robust and flexible solver for symmetric 
 and asymmetric matrices. An alternative is `scikit-umfpack` which provides a fast LU factorization. For symmetric 
 matrices a Cholesky factorization is recommended (not provided with Scipy), which can be used by either installing 
-`sksparse` or `cvxopt`.
-
-
-## How to make Python fast with Intel OneAPI
-Intel provides a toolkit with many fast math operations and solvers called OneAPI (basekit). 
-It can easily be installed on Linux by for instance following the steps described in https://www.intel.com/content/www/us/en/develop/documentation/installation-guide-for-intel-oneapi-toolkits-linux/top/installation/install-using-package-managers/apt.html
-For other OSes installation can be found in https://www.intel.com/content/www/us/en/developer/articles/guide/installation-guide-for-oneapi-toolkits.html
-
-The nice thing about OneAPI is that it also includes an optimized version of Python. To use it follow the next steps (Linux)
-
-1. `source <intel install location>/intel/oneapi/setvars.sh` (usually installed in `/opt/intel` or `/opt/ud/intel`). This loads the Intel OneAPI package.
-2. `conda create --name <venv_name> --clone base` to create a new conda virtual environment to work in.
-3. `conda activate <venv_name>` to activate the virtual environment.
-
-### Usage of multi-thread linear solvers
-Intel has a Pardiso type linear solver for fast solution of large systems.
-To use it.....
+`scikit-sparse` or `cvxopt`.
 
 # License
 pyMOTO is available under te [MIT License](https://opensource.org/licenses/MIT).

{pyMOTO-1.0.1 → pyMOTO-1.0.2rc1}/pyMOTO.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: pyMOTO
-Version: 1.0.1
+Version: 1.0.2rc1
 Summary: Example package description
 Home-page: https://github.com/aatmdelissen/pyMOTO
 Author: Arnoud Delissen
@@ -15,6 +15,8 @@ Description-Content-Type: text/markdown
 Provides-Extra: dev
 License-File: LICENSE
 
+[![10.5281/zenodo.7708738](https://zenodo.org/badge/DOI/10.5281/zenodo.7708738.svg)](https://doi.org/10.5281/zenodo.7708738)
+
 # pyMOTO
 
 * [Link to Documentation](https://pymoto.readthedocs.io)
@@ -54,35 +56,19 @@ A local installation for development in `pyMOTO` can be done by first downloadin
 * **SymPy** - Symbolic differentiation for `MathGeneral` module
 * **Matplotlib** - Plotting and visualisation
 * (optional) **SAO** - Sequential approximated optimizers
-* (optional) **opt_einsum** - Optimized function for `EinSum` module
+* (optional) [**opt_einsum**](https://optimized-einsum.readthedocs.io/en/stable/install.html) - Optimized function for `EinSum` module
 
 For fast linear solvers for sparse matrices:
-* (optional) **scikit-umfpack** - Fast LU linear solver based on UMFPACK
-* (optional) **sksparse** - Fast Cholesky solver based on CHOLMOD
-* (optional) **CVXopt** - Another fast Cholesky solver based on CHOLMOD
-* (optional) **Intel OneAPI** - Non-python library with a fast PARDISO solver
+* (optional) [**pypardiso**](https://github.com/haasad/PyPardisoProject) - Uses the Intel OneAPI PARDISO solver (recommended)
+* (optional) [**scikit-umfpack**](https://scikit-umfpack.github.io/scikit-umfpack/install.html) - Fast LU linear solver based on UMFPACK
+* (optional) [**scikit-sparse**](https://github.com/scikit-sparse/scikit-sparse) - Fast Cholesky solver based on CHOLMOD
+* (optional) [**cvxopt**](https://cvxopt.org/install/index.html) - Another fast Cholesky solver based on CHOLMOD
 
 __Note on linear solvers for sparse matrices:__ Scipy implements a version of LU which is quite slow. To increase the 
-speed of the optimization, `Intel OneAPI` is recommended as it contains a very robust and flexible solver for symmetric 
+speed of the optimization, `pypardiso` is recommended as it contains a very robust and flexible solver for symmetric 
 and asymmetric matrices. An alternative is `scikit-umfpack` which provides a fast LU factorization. For symmetric 
 matrices a Cholesky factorization is recommended (not provided with Scipy), which can be used by either installing 
-`sksparse` or `cvxopt`.
-
-
-## How to make Python fast with Intel OneAPI
-Intel provides a toolkit with many fast math operations and solvers called OneAPI (basekit). 
-It can easily be installed on Linux by for instance following the steps described in https://www.intel.com/content/www/us/en/develop/documentation/installation-guide-for-intel-oneapi-toolkits-linux/top/installation/install-using-package-managers/apt.html
-For other OSes installation can be found in https://www.intel.com/content/www/us/en/developer/articles/guide/installation-guide-for-oneapi-toolkits.html
-
-The nice thing about OneAPI is that it also includes an optimized version of Python. To use it follow the next steps (Linux)
-
-1. `source <intel install location>/intel/oneapi/setvars.sh` (usually installed in `/opt/intel` or `/opt/ud/intel`). This loads the Intel OneAPI package.
-2. `conda create --name <venv_name> --clone base` to create a new conda virtual environment to work in.
-3. `conda activate <venv_name>` to activate the virtual environment.
-
-### Usage of multi-thread linear solvers
-Intel has a Pardiso type linear solver for fast solution of large systems.
-To use it.....
+`scikit-sparse` or `cvxopt`.
 
 # License
 pyMOTO is available under te [MIT License](https://opensource.org/licenses/MIT).

{pyMOTO-1.0.1 → pyMOTO-1.0.2rc1}/pyMOTO.egg-info/SOURCES.txt

@@ -12,13 +12,9 @@ pymoto/__init__.py
 pymoto/core_objects.py
 pymoto/routines.py
 pymoto/utils.py
-pymoto.egg-info/PKG-INFO
-pymoto.egg-info/SOURCES.txt
-pymoto.egg-info/dependency_links.txt
-pymoto.egg-info/requires.txt
-pymoto.egg-info/top_level.txt
 pymoto/common/domain.py
 pymoto/common/dyadcarrier.py
+pymoto/common/mma.py
 pymoto/common/solvers.py
 pymoto/common/solvers_dense.py
 pymoto/common/solvers_sparse.py
@@ -33,6 +29,7 @@ tests/test_automod.py
 tests/test_complex.py
 tests/test_core.py
 tests/test_dyadcarrier.py
+tests/test_module_concatsignal.py
 tests/test_module_eigensolve.py
 tests/test_module_einsum.py
 tests/test_module_mathgeneral.py

{pyMOTO-1.0.1 → pyMOTO-1.0.2rc1}/pymoto/__init__.py

@@ -1,4 +1,4 @@
-__version__ = '1.0.1'
+__version__ = '1.0.2-rc1'
 
 from .core_objects import Signal, Module, Network, make_signals
 from .routines import finite_difference, minimize_oc, minimize_mma
@@ -6,13 +6,14 @@ from .routines import finite_difference, minimize_oc, minimize_mma
 # Imports from common
 from .common.dyadcarrier import DyadCarrier
 from .common.domain import DomainDefinition
+from .common.mma import MMA
 from .common.solvers import matrix_is_complex, matrix_is_diagonal, matrix_is_symmetric, matrix_is_hermitian, \
     LinearSolver, LDAWrapper
 from .common.solvers_dense import SolverDiagonal, SolverDenseQR, SolverDenseLU, SolverDenseCholesky, SolverDenseLDL
 from .common.solvers_sparse import SolverSparsePardiso, SolverSparseLU, SolverSparseCholeskyScikit, SolverSparseCholeskyCVXOPT
 
 # Import from modules
-from .modules.generic import MathGeneral, EinSum
+from .modules.generic import MathGeneral, EinSum, ConcatSignal
 from .modules.linalg import Inverse, LinSolve, EigenSolve
 from .modules.assembly import AssembleGeneral, AssembleStiffness, AssembleMass
 from .modules.filter import FilterConv, Filter, DensityFilter, OverhangFilter
@@ -24,6 +25,7 @@ __all__ = [
     'Signal', 'Module', 'Network', 'make_signals',
     'finite_difference', 'minimize_oc', 'minimize_mma',
     # Common
+    'MMA',
     'DyadCarrier',
     'DomainDefinition',
     'matrix_is_complex', 'matrix_is_diagonal', 'matrix_is_symmetric', 'matrix_is_hermitian',
@@ -31,7 +33,7 @@ __all__ = [
     'SolverDiagonal', 'SolverDenseQR', 'SolverDenseLU', 'SolverDenseCholesky', 'SolverDenseLDL',
     'SolverSparsePardiso', 'SolverSparseLU', 'SolverSparseCholeskyScikit', 'SolverSparseCholeskyCVXOPT',
     # Modules
-    "MathGeneral", "EinSum",
+    "MathGeneral", "EinSum", "ConcatSignal",
     "Inverse", "LinSolve", "EigenSolve",
     "AssembleGeneral", "AssembleStiffness", "AssembleMass",
     "FilterConv", "Filter", "DensityFilter", "OverhangFilter",