Metraipolis › archive › dc_5c84e06cefbb

Parallel Sparse Identification of Nonlinear Dynamics in Python: Task- and Data-Parallel SINDy with Numba, OpenMP, Threads and Multiprocessing for the Lorenz and Rössler… — arXiv:2611.05215

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05215
License (as archived)
CC0-1.0
Archived
2026-11-04T21:45:48.243Z
SHA-256 of the archived text
cb3fc7e7ab20b46861452c200cbe56f0c2387de232cd604fdd72347a56f396f9
Stable URL of this page
https://metraipolis.com/documento/dc_5c84e06cefbb

How to cite

Parallel Sparse Identification of Nonlinear Dynamics in Python: Task- and Data-Parallel SINDy with Numba, OpenMP, Threads and Multiprocessing for the Lorenz and Rössler… — arXiv:2611.05215 — arXiv (en), https://arxiv.org/abs/2611.05215 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5c84e06cefbb (Metraipolis archive dc_5c84e06cefbb, sha256 cb3fc7e7ab20b46861452c200cbe56f0c2387de232cd604fdd72347a56f396f9)
BibTeX
@misc{dc5c84e06cefbb,
  title = {Parallel Sparse Identification of Nonlinear Dynamics in Python: Task- and Data-Parallel SINDy with Numba, OpenMP, Threads and Multiprocessing for the Lorenz and Rössler… — arXiv:2611.05215},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05215},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5c84e06cefbb; sha256 cb3fc7e7ab20b46861452c200cbe56f0c2387de232cd604fdd72347a56f396f9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05215. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The sparse identification of nonlinear dynamics (SINDy) recovers interpretable governing equations from time-series data by sparse regression over a library of candidate functions. As data sets, candidate libraries and the number of repeated fits grow, the cost of SINDy becomes dominated by the evaluation of the library matrix and its least-squares problems. We present an open-source Python implementation of SINDy in which a single set of loop-based kernels is just-in-time compiled with Numba and executed on a shared-memory multicore node by four interchangeable back ends: Numba prange, OpenMP directives through PyOMP, Python threads that release the global interpreter lock, and multiprocessing with shared memory. The normal equations are accumulated in one cache-blocked pass over the data, with an automatic fallback to a tall-skinny QR reduction for ill-conditioned problems. Two decompositions are studied on the Lorenz and Rössler systems: an ensemble (task-parallel) workload of 960 independent identifications and a library (data-parallel) workload of one trajectory with $2\times10^7$ samples and a fifth-order library of 56 candidate terms. All back ends recover the exact sparsity pattern in every identification, with coefficient errors identical to PySINDy. On a dual-socket Intel Xeon E5-2650 v4 node of the University of Houston-Downtown HPC cluster (24 cores, 48 hardware threads), the compiled serial code is 4.3-5.6x faster than PySINDy, the parallel back ends reach speed-ups of 14.8-20.3 on 24 cores (parallel efficiency 0.61-0.84), and the overall time to solution is reduced by up to 117x with respect to PySINDy. We analyse the differences between the back ends, the effect of the two sockets and of hyper-threading, and give practical recommendations.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Mathematical Software (cs.MS).
Pagina del lavoro: https://arxiv.org/abs/2611.05215 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T21:36:19.397Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).