SciPy 1.0: fundamental algorithms for scientific computing in Python
Open accessThe DOI matches its Crossref record; 74 of the 74 references it cites were found in a registry or an index.
Abstract
SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year. In this work, we provide an overview of the capabilities and development practices of SciPy 1.0 and highlight some recent technical developments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures



Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“We recently updated Circuitscape [34], a widely used, open-source connectivity analysis software package, by migrating it from Python [35] to the Julia programming language [33].”
From Circuitscape in julia: empowering dynamic approaches to connectivity assessment (2021) · cites this paper as [35]
The cited source says what the claim attributes to it.
In the citing paper
“It made heavy use of several of Python's numerical code libraries (numpy [182], scipy [35] and pyamg [183]), which improved computational efficiency, and allowed users to solve problems with millions of nodes.”
From Circuitscape in julia: empowering dynamic approaches to connectivity assessment (2021) · cites this paper as [35]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scikit-learn: Machine Learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Müller, A., Nothman, J., Louppe, G., et al. (2012) · arXiv · doi:10.48550/arxiv.1201.0490 · Cited by 71,016
Self-citationStorn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Observation of Gravitational Waves from a Binary Black Hole Merger
Abbott, B. P., Abbott, R., Abbott, T. D., Abernathy, M. R., Acernese, F., Ackley, K., Adams, C., Adams, T., Addesso, P., Adhikari, R. X., et al. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.061102 · Cited by 14,151
<tt>emcee</tt>: The MCMC Hammer
Foreman-Mackey, D., Hogg, D. W., Lang, D., & Goodman, J. (2013) · Publications of the Astronomical Society of the Pacific · doi:10.1086/670067 · Cited by 12,414
de Boor, C. (1978) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-6333-3 · Cited by 11,944
GW170817: Observation of Gravitational Waves from a Binary Neutron Star Inspiral
Abbott, B. P., Abbott, R., Abbott, T. D., Acernese, F., Ackley, K., Adams, C., Adams, T., Addesso, P., Adhikari, R. X., Adya, V. B., et al. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.161101 · Cited by 9,473
Self-citationThe NumPy Array: A Structure for Efficient Numerical Computation
van der Walt, S., Colbert, S. C., & Varoquaux, G. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2011.37 · Cited by 9,381
The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package*
The Astropy Collaboration, Price-Whelan, A. M., Sipőcz, B. M., Günther, H. M., Lim, P. L., Crawford, S. M., Conseil, S., Shupe, D. L., Craig, M. W., Dencheva, N., et al. (2018) · The Astronomical Journal · doi:10.3847/1538-3881/aabc4f · Cited by 7,687
Self-citationExploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477 · cited 2×
“For example, SciPy provides what one expects to find in a statistics textbook (probability distributions, hypothesis tests, frequency statistics, correlation functions, and more), whereas Statsmodels 45 provides more advanced statistical estimators and inference methods, scikit-learn 3 covers machine learning, and PyM…”
Methodscikit-image: image processing in Python
van der Walt, S., Schönberger, J. L., Nunez-Iglesias, J., Boulogne, F., Warner, J. D., Yager, N., Gouillart, E., & Yu, T. (2014) · PeerJ · doi:10.7717/peerj.453 · Cited by 6,794
Self-citationStatsmodels: Econometric and Statistical Modeling with Python
Seabold, S., & Perktold, J. (2010) · Proceedings of the Python in Science Conference · doi:10.25080/majora-92bf1922-011 · Cited by 6,465 · cited 2×
“…in a statistics textbook (probability distributions, hypothesis tests, frequency statistics, correlation functions, and more), whereas Statsmodels 45 provides more advanced statistical estimators and inference methods, scikit-learn 3 covers machine learning, and PyMC3 46 , emcee 47 and PyStan…”
BackgroundSelf-citationA Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
The quickhull algorithm for convex hulls
Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. (1996) · ACM Transactions on Mathematical Software · doi:10.1145/235815.235821 · Cited by 5,359
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Zhu, C., Byrd, R. H., Lu, P., & Nocedal, J. (1997) · ACM Transactions on Mathematical Software · doi:10.1145/279232.279236 · Cited by 3,462
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Lehoucq, R. B., Sorensen, D. C., & Yang, C. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719628 · Cited by 2,936
Probabilistic programming in Python using PyMC3
Salvatier, J., Wiecki, T. V., & Fonnesbeck, C. (2016) · PeerJ Computer Science · doi:10.7717/peerj-cs.55 · Cited by 2,544
Monotone Piecewise Cubic Interpolation
Fritsch, F. N., & Carlson, R. E. (1980) · SIAM Journal on Numerical Analysis · doi:10.1137/0717021 · Cited by 2,491
A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures
Akima, H. (1970) · Journal of the ACM · doi:10.1145/321607.321609 · Cited by 2,063
SymPy: symbolic computing in Python
Meurer, A., Smith, C. P., Paprocki, M., Čertík, O., Kirpichev, S. B., Rocklin, M., Kumar, A., Ivanov, S., Moore, J. K., Singh, S., et al. (2017) · PeerJ Computer Science · doi:10.7717/peerj-cs.103 · Cited by 1,680
Self-citationNumba: a LLVM-based Python JIT compiler
Lam, S. K., Pitrou, A., & Seibert, S. (2015) · Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC · doi:10.1145/2833157.2833162 · Cited by 1,514
Moré, J. J., & Sorensen, D. C. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904038 · Cited by 1,411
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
Python for Scientists and Engineers
Millman, K. J., & Aivazis, M. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2011.36 · Cited by 1,294
Cython: The Best of Both Worlds
Behnel, S., Bradshaw, R., Citro, C., Dalcin, L., Seljebotn, D. S., & Smith, K. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2010.118 · Cited by 1,230
PyMC: a modern, and comprehensive probabilistic programming framework in Python
Abril-Pla, O., Andreani, V., Carroll, C., Dong, L., Fonnesbeck, C. J., Kochurov, M., Kumar, R., Lao, J., Luhmann, C. C., Martin, O. A., et al. (2023) · PeerJ Computer Science · doi:10.7717/peerj-cs.1516 · Cited by 870
First M87 Event Horizon Telescope Results. III. Data Processing and Calibration
The Event Horizon Telescope Collaboration, Akiyama, K., Alberdi, A., Alef, W., Asada, K., Azulay, R., Baczko, A.-K., Ball, D., Baloković, M., Barrett, J., et al. (2019) · The Astrophysical Journal Letters · doi:10.3847/2041-8213/ab0c57 · Cited by 862
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Steihaug, T. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720042 · Cited by 824
NetCDF: an interface for scientific data access
Rew, R., & Davis, G. (1990) · IEEE Computer Graphics and Applications · doi:10.1109/38.56302 · Cited by 801
Andersen, E. D., & Andersen, K. D. (2000) · Applied Optimization · doi:10.1007/978-1-4757-3216-0_8 · Cited by 766 · cited 1×
“Implementing the core algorithm of the commercial solver MOSEK 78 , it solves all of the 90 + NETLIB LP benchmark problems 79 tested.”
MethodMayavi: 3D Visualization of Scientific Data
Ramachandran, P., & Varoquaux, G. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2011.35 · Cited by 648
User guide for MINPACK-1. [In FORTRAN]
More, J., Garbow, B., & Hillstrom, K. (1980) · doi:10.2172/6997568 · Cited by 584
Direct search algorithms for optimization calculations
Powell, M. J. D. (1998) · Acta Numerica · doi:10.1017/s0962492900002841 · Cited by 558
Curve and Surface Fitting with Splines
Dierckx, P. (1993) · doi:10.1093/oso/9780198534419.001.0001 · Cited by 542
GW150914: First results from the search for binary black hole coalescence with Advanced LIGO
Abbott, B. P., Abbott, R., Abbott, T. D., Abernathy, M. R., Acernese, F., Ackley, K., Adams, C., Adams, T., Addesso, P., Adhikari, R. X., et al. (2016) · Physical Review D · doi:10.1103/physrevd.93.122003 · Cited by 496
Piessens, R., de Doncker-Kapenga, E., Überhuber, C. W., & Kahaner, D. K. (1983) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61786-7 · Cited by 485
An overview of SuperLU: Algorithms, implementation, and user interface
Li, X. S. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1089014.1089017 · Cited by 467
A New Algorithm for Unconstrained Optimization
POWELL, M. J. D. (1970) · Nonlinear Programming · doi:10.1016/b978-0-12-597050-1.50006-3 · Cited by 447
Newton-Type Minimization via the Lanczos Method
Nash, S. G. (1984) · SIAM Journal on Numerical Analysis · doi:10.1137/0721052 · Cited by 338
Characterization of structures from X-ray scattering data using genetic algorithms
Wormington, M., Panaccione, C., Matney, K. M., & Bowen, D. K. (1999) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1999.0469 · Cited by 322
CODATA Recommended Values of the Fundamental Physical Constants: 2018
Tiesinga, E., Mohr, P. J., Newell, D. B., & Taylor, B. N. (2021) · Journal of Physical and Chemical Reference Data · doi:10.1063/5.0064853 · Cited by 299
Proceedings of the 19th Python in Science Conference
(2020) · Proceedings of the Python in Science Conference · doi:10.25080/majora-342d178e-02b · Cited by 284
Tracing the meta-level: PyPy's tracing JIT compiler
Bolz, C. F., Cuni, A., Fijalkowski, M., & Rigo, A. (2009) · Proceedings of the 4th workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems · doi:10.1145/1565824.1565827 · Cited by 282
Solving the Trust-Region Subproblem using the Lanczos Method
Gould, N. I. M., Lucidi, S., Roma, M., & Toint, P. L. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497322735 · Cited by 280
Schittkowski, K. (1982) · Numerische Mathematik · doi:10.1007/bf01395810 · Cited by 273
Vallisneri, M., Kanner, J., Williams, R., Weinstein, A., & Stephens, B. (2015) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/610/1/012021 · Cited by 269
Matrix Market: a web resource for test matrix collections
Boisvert, R. F., Pozo, R., Remington, K., Barrett, R. F., & Dongarra, J. J. (1997) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-1-5041-2940-4_9 · Cited by 268
CODATA Recommended Values of the Fundamental Physical Constants: 2014
Mohr, P. J., Newell, D. B., & Taylor, B. N. (2016) · Journal of Physical and Chemical Reference Data · doi:10.1063/1.4954402 · Cited by 252
Schittkowski, K. (1983) · Mathematische Operationsforschung und Statistik. Series Optimization · doi:10.1080/02331938308842847 · Cited by 243
Python: An Ecosystem for Scientific Computing
Perez, F., Granger, B. E., & Hunter, J. D. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2010.119 · Cited by 241
Algorithm 644: A portable package for Bessel functions of a complex argument and nonnegative order
Amos, D. E. (1986) · ACM Transactions on Mathematical Software · doi:10.1145/7921.214331 · Cited by 227
Boggs, P. T., Byrd, R. H., Rogers, J. E., & Schnabel, R. B. (1992) · doi:10.6028/nist.ir.4834 · Cited by 213
Nitz, A., Harry, I. W., Brown, D. A., Biwer, C. M., Willis, J., Canton, T. D., Capano, C. D., Dent, T., Pekowsky, L., Davies, G. S. C., et al. (2017) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.596388 · Cited by 189
High Performance Fortran Handbook
Koelbel, C. H., Loveman, D., Schreiber, R. S., Steele, G. L., & Zosel, M. (1993) · The MIT Press eBooks · doi:10.7551/mitpress/3499.001.0001 · Cited by 183
FFT algorithms for vector computers
Swarztrauber, P. N. (1984) · Parallel Computing · doi:10.1016/s0167-8191(84)90413-7 · Cited by 179
Swarztrauber, P. N. (1982) · Elsevier eBooks · doi:10.1016/b978-0-12-592101-5.50007-5 · Cited by 135 · cited 2×
“Thus, we wrap the following excellent, field-tested Fortran libraries to provide Python convenience while benefiting from their performance: QUADPACK 51 and ODEPACK 52 for numerical integration and solution of initial value problems; FITPACK 53 , ODRPACK 54 and MINPACK 55 for curve-fitting and least-squares minimizati…”
BackgroundFast Algorithms and Efficient Statistics: N-Point Correlation Functions
Moore, A. W., Connolly, A. J., Genovese, C., Gray, A., Grone, L., Kanidoris II, N., Nichol, R. C., Schneider, J., Szalay, A. S., Szapudi, I., et al. (2006) · ESO ASTROPHYSICS SYMPOSIA · doi:10.1007/10849171_5 · Cited by 75
Schittkowski, K. (1982) · Numerische Mathematik · doi:10.1007/bf01395811 · Cited by 74
THE CLUSTERING CHARACTERISTICS OF H I-SELECTED GALAXIES FROM THE 40% ALFALFA SURVEY
Martin, A. M., Giovanelli, R., Haynes, M. P., & Guzzo, L. (2012) · The Astrophysical Journal · doi:10.1088/0004-637x/750/1/38 · Cited by 70
Muller, E., Bednar, J. A., Diesmann, M., Gewaltig, M.-O., Hines, M., & Davison, A. P. (2015) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2015.00011 · Cited by 68
Analysis of approximate nearest neighbor searching with clustered point setsPreprint
Maneewongvatana, S., & Mount, D. M. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9901013 · Cited by 58 · cited 1×
“In 2013, the time complexity of the k -nearest-neighbor search from cKDTree.query was approximately loglinear 68 , consistent with its formal description 69 .”
BackgroundGuest Editor's Introduction: Python: Batteries Included
Dubois, P. F. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.51 · Cited by 40
Developing Open-Source Scientific Practice *
Millman, K. J., & Pérez, F. (2018) · Implementing Reproducible Research · doi:10.1201/9781315373461-6 · Cited by 26 · cited 1×
“The library was expanded carefully, with the patience affordable in open-source projects and via best practices, which are increasingly common in the scientific Python ecosystem and industry 30 .”
MethodLenders, F., Kirches, C., & Potschka, A. (2018) · Optimization methods & software · doi:10.1080/10556788.2018.1449842 · Cited by 19
Self-citationSparse: A more modern sparse array library
Abbasi, H. (2018) · Proceedings of the Python in Science Conferences · doi:10.25080/majora-4af1f417-00a · Cited by 16
Efficient Assembly of Sparse Matrices Using Hashing
Aspnäs, M., Signell, A., & Westerholm, J. (2007) · Springer eBooks · doi:10.1007/978-3-540-75755-9_107 · Cited by 14
The guide to available mathematical software problem classification system1
Boisvert, R. F., Howe, S. E., & Kahaner, D. K. (1991) · Communications in Statistics - Simulation and Computation · doi:10.1080/03610919108812986 · Cited by 13
Collaborative software development made easy
Silver, A. (2017) · Nature · doi:10.1038/550143a · Cited by 6
gwastro/pycbc: PyCBC v1.13.2 Release
Nitz, A., Harry, I. W., Brown, D. A., et al. (2018) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.1596771 · Cited by 4
Circumventing The Linker: Using SciPy's BLAS and LAPACK Within Cython
Henriksen, I. (2015) · Proceedings of the Python in Science Conferences · doi:10.25080/majora-7b98e3ed-008 · Cited by 2 · cited 1×
“Developers can also use the low-level Cython interfaces without linking against the wrapped libraries 77 .”
MethodSelf-citationNumerical Python ("Numeric") manual
Ascher, D., Dubois, P. F., Hinsen, K., Hugunin, J., & Oliphant, T. E. (2001) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.3599566 · Cited by 1
Self-citation
Research works printed but not linked: 15
- 16. Oliphant, T. E. Moving forward from the last decade of SciPy. Presentation slides, https://conference.scipy.org/scipy2010/slides/travis_oliphant_keynote.pdf (1 July 2010).
- 19. Peterson P F2PY: a tool for connecting Fortran and Python programs Int. J. Comput. Sci. Eng. 2009 4 296 305
- 25. Vaught, T. N. [ANN] SciPy ‘02 - Python for Scientific Computing Workshop, https://mail.python.org/pipermail/numpy-discussion/2002-June/001511.html (2002).
- 27. Greenfield, P. How Python slithered Into astronomy. Presentation, https://conference.scipy.org/scipy2011/slides/greenfield_keynote_astronomy.pdf (2011).
- 33. Harrington, J. The SciPy documentation project. In Proceedings of the 7th Python in Science Conference (eds G. Varoquaux, G., Vaught, T. & Millman, K. J.) 33–35 (2008).
- 34. van der Walt, S. The SciPy documentation project (technical overview). In Proceedings of the 7th Python in Science Conference (eds G. Varoquaux, G., Vaught, T. & Millman, K. J.) 27–28 (2008).
- 36. Pérez, F., Langtangen, H. P. & LeVeque, R. Python for scientific computing. In SIAM Conference on Computational Science and Engineering,42 (5) (2009).
- 61. Kernighan, B. W. & Ritchie, D. M. The C Programming Language 2nd edn (Prentice Hall Professional Technical Reference, 1988).
- 72. Cormen, T. H., Stein, C., Rivest, R. L. & Leiserson, C. E. Introduction to Algorithms 2nd edn (McGraw-Hill Higher Education, 2001).
- 80. Andersen ED Andersen KD Presolving in linear programming Math. Program. 1995 71 221 245
- 84. Dierckx, P. Curve and Surface Fitting with Splines (Oxford Univ. Press, 1993). · DOI · Paper page
- 91. Beck, K. Test-driven Development: By Example (Addison-Wesley, 2003).
- 103. Powell MJD A view of algorithms for optimization without derivatives Math. Today Bull. Inst. Math. Appl. 2007 43 170 174
- 104. Polak E Ribiere G Note sur la convergence de methodes de directions conjuguees Rev. française d’informatique et. de. Rech. op.érationnelle 1969 3 35 43
- 105. Nocedal, J. & Wright, S. Numerical Optimization 2nd edn (Springer Science & Business Media, 2006).
Cited by
Harris, C. R., Millman, K. J., van der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N. J., et al. (2020) · Nature · doi:10.1038/s41586-020-2649-2 · Cited by 23,826
“Now, fifteen years later, NumPy underpins almost every Python library that does scientific or numerical computation including SciPy [13], Matplotlib [14], pandas [15], scikit-learn [16], and scikit-image [17].”
BackgroundSelf-citationHarris, C., Millman, K., van der Walt, S., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N., et al. (2020) · RePEc: Research Papers in Economics · Cited by 17,844
Self-citationLearning Transferable Visual Models From Natural Language Supervision
Radford, A., Kim, J. W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al. (2021) · arXiv · doi:10.48550/arxiv.2103.00020 · Cited by 15,293
The Astropy Collaboration, Price-Whelan, A. M., Lim, P. L., Earl, N., Starkman, N., Bradley, L., Shupe, D. L., Patil, A. A., Corrales, L., Brasseur, C. E., et al. (2022) · The Astrophysical Journal · doi:10.3847/1538-4357/ac7c74 · Cited by 5,022
“…domain specific, this landscape now includes packages that provide core numerical analysis functionality like numpy Harris et al. (2020) and scipy Virtanen et al. (2020), visualization frameworks like matplotlib (Hunter 2007), machine-learning and data analysis packages like tensorflow (Abadi et…”
MethodSelf-citationGaia Early Data Release 3: Summary of the contents and survey properties
Gaia Collaboration, Brown, A. G. A., Vallenari, A., Prusti, T., de Bruijne, J. H. J., Babusiaux, C., Biermann, M., Creevey, O. L., Evans, D. W., Eyer, L., et al. (2021) · Astronomy & Astrophysics · doi:10.1051/0004-6361/202039657 · Cited by 578
Metadata
- Authors
- Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S. J., Brett, M., Wilson, J., Millman, K. J., Mayorov, N., Nelson, A. R. J., Jones, E., Kern, R., Larson, E., Carey, C. J., Polat, İ., Feng, Y., Moore, E. W., VanderPlas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E. A., Harris, C. R., Archibald, A. M., Ribeiro, A. H., Pedregosa, F., van Mulbregt, P., Contributors, S. 1. 0., Vijaykumar, A., Bardelli, A. P., Rothberg, A., Hilboll, A., Kloeckner, A., Scopatz, A., Lee, A., Rokem, A., Woods, C. N., Fulton, C., Masson, C., Häggström, C., Fitzgerald, C., Nicholson, D. A., Hagen, D. R., Pasechnik, D. V., Olivetti, E., Martin, E., Wieser, E., Silva, F., Lenders, F., Wilhelm, F., Young, G., Price, G. A., Ingold, G.-L., Allen, G. E., Lee, G. R., Audren, H., Probst, I., Dietrich, J. P., Silterra, J., Webber, J. T., Slavič, J., Nothman, J., Buchner, J., Kulick, J., Schönberger, J. L., de Miranda Cardoso, J. V., Reimer, J., Harrington, J., Rodríguez, J. L. C., Nunez-Iglesias, J., Kuczynski, J., Tritz, K., Thoma, M., Newville, M., Kümmerer, M., Bolingbroke, M., Tartre, M., Pak, M., Smith, N. J., Nowaczyk, N., Shebanov, N., Pavlyk, O., Brodtkorb, P. A., Lee, P., McGibbon, R. T., Feldbauer, R., Lewis, S., Tygier, S., Sievert, S., Vigna, S., Peterson, S., More, S., Pudlik, T., Oshima, T., Pingel, T. J., Robitaille, T. P., Spura, T., Jones, T. R., Cera, T., Leslie, T., Zito, T., Krauss, T., Upadhyay, U., Halchenko, Y. O., & Vázquez-Baeza, Y.
- Affiliations
- University of Jyväskylä (FI)
- Quansight (United States) (US)
- Brigham Young University (US)
- California Polytechnic State University (US)
- Los Alamos National Laboratory (US)
- National Research University Higher School of Economics (RU)
- Tallinn University of Technology (EE)
- University of California, Berkeley (US)
- University of Birmingham (GB)
- WayRay (Russia) (RU)
- Australian Nuclear Science and Technology Organisation (AU)
- Enthought (United States) (US)
- University of Washington (US)
- University of Massachusetts Amherst (US)
- Bruker (United States) (US)
- University of West Bohemia in Pilsen (CZ)
- Utah State University Space Dynamics Laboratory (US)
- University of Amsterdam (NL)
- Universidade Federal de Minas Gerais (BR)
- Tata Institute of Fundamental Research (IN)
- University of Bremen (DE)
- University of Illinois Urbana-Champaign (US)
- Centre National de la Recherche Scientifique (FR)
- Federal Reserve Board of Governors (US)
- Orexplore (Sweden) (SE)
- University of California, Davis (US)
- Emory University (US)
- Applied BioMath (United States) (US)
- Fondazione Bruno Kessler (IT)
- University of Cambridge (GB)
- Heidelberg University (DE)
- Lawrence Berkeley National Laboratory (US)
- University of Augsburg (DE)
- Applied Research Laboratories, The University of Texas at Austin (US)
- Cincinnati Children's Hospital Medical Center (US)
- École nationale supérieure de techniques avancées Bretagne (FR)
- Excellence Cluster Universe (DE)
- Chan Zuckerberg Biohub San Francisco (US)
- University of Ljubljana (SI)
- The University of Sydney (AU)
- Pontificia Universidad Católica de Chile (CL)
- University of Stuttgart (DE)
- Christian-Albrechts-Universität zu Kiel (DE)
- University of Central Florida (US)
- Monash University (AU)
- University of Colorado Boulder (US)
- Johns Hopkins University (US)
- University of Chicago (US)
- University of Tübingen (DE)
- Two Sigma Investments (United States) (US)
- Technical University of Munich (DE)
- Intel (United States) (US)
- D. E. Shaw Research (US)
- University of Vienna (AT)
- University of Manchester (GB)
- University of Wisconsin–Madison (US)
- University of Milan (IT)
- Kavli Institute for the Physics and Mathematics of the Universe (JP)
- Niigata University (JP)
- Virginia Tech (US)
- Broad Institute (US)
- Humboldt-Universität zu Berlin (DE)
- Max Planck Society (DE)
- Dartmouth College (US)
- University of California San Diego (US)
- Corresponding author
- Gommers, Ralf
- Haberland, Matt
- Reddy, Tyler
- ORCID
- Virtanen, Pauli
- Gommers, Ralf
- Haberland, Matt
- Reddy, Tyler
- Burovski, Evgeni
- van der Walt, Stéfan J.
- Millman, K. Jarrod
- Nelson, Andrew R. J.
- Polat, İlhan
- Laxalde, Denis
- Henriksen, Ian
- Quintero, E. A.
- Archibald, Anne M.
- Ribeiro, Antônio H.
- van Mulbregt, Paul
- Vijaykumar, Aditya
- Lee, Antony
- Rokem, Ariel
- Hagen, David R.
- Olivetti, Emanuele
- Wieser, Eric
- Silva, Fabrice
- Lenders, Felix
- Ingold, Gert-Ludwig
- Audren, Hervé
- Webber, James T
- Slavič, Janko
- Harrington, Joseph
- Nunez-Iglesias, Juan
- McGibbon, Robert T.
- Feldbauer, Roman
- Tygier, Sam
- Pingel, Thomas J.
- Spura, Thomas
- Jones, Thouis R.
- Zito, Tiziano
- Halchenko, Yaroslav O.
- Venue
- Nature Methods
- Published
- 2020-02-03
- Volume
- 17
- Issue
- 3
- Pages
- 261-272
- ISSN
- 1548-7091 (ISSN-L)
- 1548-7105
- PMC
- PMC7056644
- OpenAlex
- W3003257820
- Cited by
- 38,430
- References
- 70
- Citations by year
- 2026: 7003 · 2025: 8153 · 2024: 6915 · 2023: 5719 · 2022: 4839 · 2021: 3960 · 2020: 1561
- FWCI
- 138.34
- Type
- journal article
- Language
- en
- Update notices
- correction (2020-02-24)
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Nature Methods (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano) (submittedVersion, cc-by)
- Institutional Research Information System (Università degli Studi di Trento) (submittedVersion, cc-by)
- Jyväskylä University Digital Archive (University of Jyväskylä) (submittedVersion, cc-by)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- Monash University Research Portal (Monash University) (submittedVersion, cc-by)
- HAL (submittedVersion, cc-by)
- Digital Library (University of West Bohemia) (submittedVersion)
- eScholarship (California Digital Library) (submittedVersion, cc-by)
- Cambridge University Engineering Department Publications Database (submittedVersion)
- mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) (submittedVersion, other-oa)
- Research Explorer (The University of Manchester) (submittedVersion, other-oa)
- Science and Technology Facilities Council (submittedVersion)
- OPUS (Augsburg University) (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- U.S. Department of Energy (#89233218CNA000001)
- Kessler Foundation
- Emory University
- University of Wisconsin-Madison
- Cincinnati Children's Hospital Medical Center
- University of Chicago
- Virginia Polytechnic Institute and State University
- University of Washington
- Johns Hopkins University
- University of Central Florida
- University of Cincinnati
- Dartmouth College
- University of Texas at Austin
- Università degli Studi di Milano
- Broad Institute
- University of Oxford
- Tata Institute of Fundamental Research
- University of Sydney
- Monash University
- Eberhard Karls Universität Tübingen
- Universität Wien
- Centre National de la Recherche Scientifique
- Technische Universität Braunschweig
- Technische Universität München
- Université de Bordeaux
- Birla Institute of Technology and Science, Pilani
- Univerza v Ljubljani
- Universität Bremen
- Universität Stuttgart
- Pontificia Universidad Católica de Chile
- University of Illinois at Urbana-Champaign
- National Nuclear Security Administration (89233218C-NA000001)
- University of California, San Diego
- Science and Technology Facilities Council (ST/P002056/1)
- Lawrence Berkeley National Laboratory
- Los Alamos National Laboratory (89233218CNA 000001)
- Topics
- Physical Sciences › Computer Science › Software › Computational Physics and Python Applications
- Social Sciences › Decision Sciences › Information Systems and Management › Scientific Computing and Data Management
- Physical Sciences › Mathematics › Modeling and Simulation › Modeling and Simulation Systems
- Keywords
- SciPy, scientific computing, Python, open source software, numerical algorithms, software development practices
- MeSH terms
- Algorithms, Computer Simulation, Models, Biological, Programming Languages, Signal Processing, Computer-Assisted, Software, Linear Models, Nonlinear Dynamics, Computational Biology, History, 20th Century, History, 21st Century
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.