(Update) |
|||
(8 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
[[Category:Software]] |
[[Category:Software]] |
||
+ | [[Category:Python]] |
||
== Synopsis == |
== Synopsis == |
||
[https://pymor.org pyMOR] is a [https://opensource.org/licenses/BSD-2-Clause BSD-licensed] software library for building model order reduction applications in the [[:Wikipedia:Python_(programming_language)|Python programming language]]. |
[https://pymor.org pyMOR] is a [https://opensource.org/licenses/BSD-2-Clause BSD-licensed] software library for building model order reduction applications in the [[:Wikipedia:Python_(programming_language)|Python programming language]]. |
||
+ | All algorithms in '''pyMOR''' are formulated in terms of abstract interfaces, allowing generic implementations to work with different backends, from NumPy/SciPy to external partial differential equation solver packages. |
||
− | Implemented algorithms include reduced basis methods for parametric linear and non-linear problems, as well as system-theoretic methods such as balanced truncation and iterative rational Krylov algorithm. |
||
− | '''pyMOR''' is designed from the ground up for easy integration with external [[List_of_abbreviations#PDE|PDE]] solver packages but also offers Python-based discretizations for getting started easily. |
||
== Features == |
== Features == |
||
Line 13: | Line 13: | ||
* Efficient error estimation for linear affinely decomposed problems. |
* Efficient error estimation for linear affinely decomposed problems. |
||
* Empirical interpolation of arbitrary operators (with efficient evaluation of projected interpolated operators if the operator supports restriction to selected degrees of freedom). |
* Empirical interpolation of arbitrary operators (with efficient evaluation of projected interpolated operators if the operator supports restriction to selected degrees of freedom). |
||
− | * Parallel adaptive greedy and |
+ | * Parallel adaptive greedy and POD algorithms for reduced space construction. |
− | * Empirical-Interpolation-Greedy and |
+ | * Empirical-Interpolation-Greedy and DEIM algorithms for generation of interpolation data for empirical operator interpolation. |
− | * Balanced-based and interpolation-based reduction methods for first-order |
+ | * Balanced-based and interpolation-based reduction methods for first-order, second-order, and port-Hamiltonian linear time-invariant systems. |
* Model order reduction using artificial neural networks. |
* Model order reduction using artificial neural networks. |
||
+ | * Data-driven model order reduction with Dynamic Mode Decomposition, Loewner matrices, Eigensystem Realization, and parametric AAA. |
||
* [[:Wikipedia:Gram_schmidt|Gram-Schmidt algorithm]] supporting re-orthogonalization for improved numerical accuracy. |
* [[:Wikipedia:Gram_schmidt|Gram-Schmidt algorithm]] supporting re-orthogonalization for improved numerical accuracy. |
||
* Time-stepping and Newton algorithms, as well as generic iterative linear solvers. |
* Time-stepping and Newton algorithms, as well as generic iterative linear solvers. |
||
− | * Low-rank alternating direction implicit (LR ADI) method for large-scale Lyapunov equations and bindings for matric equations solvers in [ |
+ | * Low-rank alternating direction implicit (LR ADI) method for large-scale Lyapunov equations and bindings for matric equations solvers in [https://www.slicot.org SLICOT] (via [https://github.com/python-control/Slycot slycot]) and [https://www.mpi-magdeburg.mpg.de/projects/mess Py-M.E.S.S]. |
* Eigenvalue/pole computation using the implicitly restarted Arnoldi method and the subspace accelerated dominant pole (SAMDP) algorithm. |
* Eigenvalue/pole computation using the implicitly restarted Arnoldi method and the subspace accelerated dominant pole (SAMDP) algorithm. |
||
+ | * Modal truncation for linear time-invariant systems. |
||
+ | * Time-dependent parameters. |
||
− | All these algorithms are formulated in terms of abstract interfaces for seamless integration with external high-dimensional |
+ | All these algorithms are formulated in terms of abstract interfaces for seamless integration with external high-dimensional PDE solvers. |
Bindings for the following PDE solver libraries are available: |
Bindings for the following PDE solver libraries are available: |
||
− | * [ |
+ | * [https://www.dealii.org/ deal.II] |
− | * [ |
+ | * [https://dune-project.org/ DUNE] |
− | * [ |
+ | * [https://fenicsproject.org/ FEniCS] |
+ | * [https://fenicsproject.org/ FEniCSx] (in preparation, see feature branch) |
||
− | * [ |
+ | * [https://sourceforge.net/projects/ngsolve/ NGSolve] |
+ | * [https://scikit-fem.readthedocs.io/ scikit-fem] (experimental) |
||
− | Pure Python implementations of discretizations using the [https:// |
+ | Pure Python implementations of discretizations using the [https://numpy.org NumPy]/[https://scipy.org SciPy] scientific computing stack are implemented to provide an easy-to-use sandbox for experimentation with new model reduction approaches. '''pyMOR''' offers: |
* Structured 1D and 2D grids, as well as an experimental Gmsh-based grid, implementing the same abstract grid interface. |
* Structured 1D and 2D grids, as well as an experimental Gmsh-based grid, implementing the same abstract grid interface. |
||
* [[:Wikipedia:Finite_element|Finite element]] and [[:Wikipedia:Finite_volume|finite volume]] operators based on this interface. |
* [[:Wikipedia:Finite_element|Finite element]] and [[:Wikipedia:Finite_volume|finite volume]] operators based on this interface. |
||
* SciPy/[http://crd-legacy.lbl.gov/~xiaoye/SuperLU SuperLU] based iterative and direct solvers for sparse systems. |
* SciPy/[http://crd-legacy.lbl.gov/~xiaoye/SuperLU SuperLU] based iterative and direct solvers for sparse systems. |
||
⚫ | |||
− | * Algebraic multigrid solvers through pyAMG bindings. |
||
⚫ | |||
== References == |
== References == |
||
− | * M. Ohlberger, S. Rave, S. Schmidt, S. Zhang. "[ |
+ | * M. Ohlberger, S. Rave, S. Schmidt, S. Zhang. "[https://doi.org/10.1007/978-3-319-05591-6_69 A Model Reduction Framework for Efficient Simulation of Li-Ion Batteries]". Springer Proceedings in Mathematics & Statistics Vol. 78: Finite Volumes for Complex Applications VII-Elliptic, Parabolic and Hyperbolic Problems, Berlin, June 2014. |
* R. Milk, S. Rave, F. Schindler. "[https://doi.org/10.1137/15M1026614 pyMOR - Generic Algorithms and Interfaces for Model Order Reduction]". SIAM Journal on Scientific Computing 38(5): S194--S216, 2016. |
* R. Milk, S. Rave, F. Schindler. "[https://doi.org/10.1137/15M1026614 pyMOR - Generic Algorithms and Interfaces for Model Order Reduction]". SIAM Journal on Scientific Computing 38(5): S194--S216, 2016. |
||
== Links == |
== Links == |
||
− | * Official |
+ | * Official [https://pymor.org website], |
* Development of '''pyMOR''' can be tracked on [https://github.com/pymor/pymor GitHub], |
* Development of '''pyMOR''' can be tracked on [https://github.com/pymor/pymor GitHub], |
||
− | * Online [https://docs.pymor.org documentation] |
+ | * Online [https://docs.pymor.org documentation]. |
== Contact == |
== Contact == |
||
− | For assistance with, and contributions to '''pyMOR''', the developers can be contacted via [ |
+ | For assistance with, and contributions to '''pyMOR''', the developers can be contacted via [https://github.com/pymor/pymor/discussions GitHub discussions]. |
Latest revision as of 11:26, 14 September 2024
Synopsis
pyMOR is a BSD-licensed software library for building model order reduction applications in the Python programming language. All algorithms in pyMOR are formulated in terms of abstract interfaces, allowing generic implementations to work with different backends, from NumPy/SciPy to external partial differential equation solver packages.
Features
Currently, the following model reduction algorithms are provided by pyMOR:
- A generic reduction routine for projection of arbitrary high-dimensional discretizations onto reduced spaces, preserving (possibly nested) affine decompositions of operators and functionals for efficient offline/online decomposition.
- Efficient error estimation for linear affinely decomposed problems.
- Empirical interpolation of arbitrary operators (with efficient evaluation of projected interpolated operators if the operator supports restriction to selected degrees of freedom).
- Parallel adaptive greedy and POD algorithms for reduced space construction.
- Empirical-Interpolation-Greedy and DEIM algorithms for generation of interpolation data for empirical operator interpolation.
- Balanced-based and interpolation-based reduction methods for first-order, second-order, and port-Hamiltonian linear time-invariant systems.
- Model order reduction using artificial neural networks.
- Data-driven model order reduction with Dynamic Mode Decomposition, Loewner matrices, Eigensystem Realization, and parametric AAA.
- Gram-Schmidt algorithm supporting re-orthogonalization for improved numerical accuracy.
- Time-stepping and Newton algorithms, as well as generic iterative linear solvers.
- Low-rank alternating direction implicit (LR ADI) method for large-scale Lyapunov equations and bindings for matric equations solvers in SLICOT (via slycot) and Py-M.E.S.S.
- Eigenvalue/pole computation using the implicitly restarted Arnoldi method and the subspace accelerated dominant pole (SAMDP) algorithm.
- Modal truncation for linear time-invariant systems.
- Time-dependent parameters.
All these algorithms are formulated in terms of abstract interfaces for seamless integration with external high-dimensional PDE solvers. Bindings for the following PDE solver libraries are available:
Pure Python implementations of discretizations using the NumPy/SciPy scientific computing stack are implemented to provide an easy-to-use sandbox for experimentation with new model reduction approaches. pyMOR offers:
- Structured 1D and 2D grids, as well as an experimental Gmsh-based grid, implementing the same abstract grid interface.
- Finite element and finite volume operators based on this interface.
- SciPy/SuperLU based iterative and direct solvers for sparse systems.
- OpenGL, matplotlib, and k3d based visualizations of solutions.
References
- M. Ohlberger, S. Rave, S. Schmidt, S. Zhang. "A Model Reduction Framework for Efficient Simulation of Li-Ion Batteries". Springer Proceedings in Mathematics & Statistics Vol. 78: Finite Volumes for Complex Applications VII-Elliptic, Parabolic and Hyperbolic Problems, Berlin, June 2014.
- R. Milk, S. Rave, F. Schindler. "pyMOR - Generic Algorithms and Interfaces for Model Order Reduction". SIAM Journal on Scientific Computing 38(5): S194--S216, 2016.
Links
- Official website,
- Development of pyMOR can be tracked on GitHub,
- Online documentation.
Contact
For assistance with, and contributions to pyMOR, the developers can be contacted via GitHub discussions.