SciPy 1.0: fundamental algorithms for scientific computing in Python

Pauli Virtanen; Ralf Gommers; Travis E Oliphant; Matt Haberland; Tyler Reddy; David Cournapeau; Evgeni Burovski; Pearu Peterson; Warren Weckesser; Jonathan Bright; Stéfan J van der Walt; Matthew Brett; Joshua Wilson; K Jarrod Millman; Nikolay Mayorov; Andrew R J Nelson; Eric Jones; Robert Kern; Eric Larson; C J Carey; İlhan Polat; Yu Feng; Eric W Moore; Jake VanderPlas; Denis Laxalde; Josef Perktold; Robert Cimrman; Ian Henriksen; E A Quintero; Charles R Harris; Anne M Archibald; Antônio H Ribeiro; Fabian Pedregosa; Paul van Mulbregt; SciPy 1.0 Contributors

doi:10.1038/s41592-019-0686-2

. 2020 Feb 3;17(3):261–272. doi: 10.1038/s41592-019-0686-2

SciPy 1.0: fundamental algorithms for scientific computing in Python

Pauli Virtanen ¹, Ralf Gommers ^2,^✉, Travis E Oliphant ^2,^3,^4,^5,⁶, Matt Haberland ^7,^8,^✉, Tyler Reddy ^9,^✉, David Cournapeau ¹⁰, Evgeni Burovski ¹¹, Pearu Peterson ^12,¹³, Warren Weckesser ¹⁴, Jonathan Bright ¹⁵, Stéfan J van der Walt ¹⁴, Matthew Brett ¹⁶, Joshua Wilson ¹⁷, K Jarrod Millman ^14,¹⁸, Nikolay Mayorov ¹⁹, Andrew R J Nelson ²⁰, Eric Jones ⁵, Robert Kern ⁵, Eric Larson ²¹, C J Carey ²², İlhan Polat ²³, Yu Feng ²⁴, Eric W Moore ²⁵, Jake VanderPlas ²⁶, Denis Laxalde ²⁷, Josef Perktold ²⁸, Robert Cimrman ²⁹, Ian Henriksen ^6,^30,³¹, E A Quintero ³², Charles R Harris ^33,³⁴, Anne M Archibald ³⁵, Antônio H Ribeiro ³⁶, Fabian Pedregosa ³⁷, Paul van Mulbregt ³⁸; SciPy 1.0 Contributors

¹University of Jyväskylä, Jyväskylä, Finland

²Quansight LLC, Austin, TX USA

³Ultrasound Imaging, Mayo Clinic, Rochester, MN USA

⁴Electrical Engineering, Brigham Young University, Provo, UT USA

⁵Enthought, Inc., Austin, TX USA

⁶Anaconda Inc., Austin, TX USA

⁷BioResource and Agricultural Engineering Department, California Polytechnic State University, San Luis Obispo, CA USA

⁸Department of Mathematics, University of California Los Angeles, Los Angeles, CA USA

⁹Los Alamos National Laboratory, Los Alamos, NM USA

¹⁰Independent researcher, Tokyo, Japan

¹¹National Research University Higher School of Economics, Moscow, Russia

¹²Independent researcher, Saue, Estonia

¹³Department of Mechanics and Applied Mathematics, Institute of Cybernetics at Tallinn Technical University, Tallinn, Estonia

¹⁴Berkeley Institute for Data Science, University of California Berkeley, Berkeley, CA USA

¹⁵Independent researcher, New York, NY USA

¹⁶School of Psychology, University of Birmingham, Edgbaston, Birmingham UK

¹⁷Independent researcher, San Francisco, CA USA

¹⁸Division of Biostatistics, University of California Berkeley, Berkeley, CA USA

¹⁹WayRay LLC, Skolkovo Innovation Center, Moscow, Russia

²⁰Australian Nuclear Science and Technology Organisation, Lucas Heights, NSW Australia

²¹Institute for Learning and Brain Sciences, University of Washington, Seattle, WA USA

²²College of Information and Computing Sciences, University of Massachusetts Amherst, Amherst, MA USA

²³Independent researcher, Amsterdam, the Netherlands

²⁴Berkeley Center for Cosmological Physics, University of California Berkeley, Berkeley, CA USA

²⁵Bruker Biospin Corp., Billerica, MA USA

²⁶University of Washington, Seattle, WA USA

²⁷Independent researcher, Toulouse, France

²⁸Independent researcher, Montreal, Quebec Canada

²⁹New Technologies Research Centre, University of West Bohemia, Plzeň, Czech Republic

³⁰Department of Mathematics, Brigham Young University, Provo, UT USA

³¹Oden Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX USA

³²Independent researcher, Belmont, Massachusetts USA

³³Space Dynamics Laboratory, North Logan, UT USA

³⁴Independent researcher, Logan, Utah USA

³⁵Anton Pannekoek Institute, Amsterdam, The Netherlands

³⁶Graduate Program in Electrical Engineering, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil

³⁷Google LLC, Montreal, Quebec Canada

³⁸Google LLC, Cambridge, MA USA

⁴⁰International Centre for Theoretical Sciences, Tata Institute of Fundamental Research, Bengaluru, India

⁴¹Department of Physics, Birla Institute of Technology and Science, Pilani, India

⁴²Independent researcher, Milan, Italy

⁴³Institute of Environmental Physics, University of Bremen, Bremen, Germany

⁴⁴Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL USA

⁴⁵Laboratoire Photonique, Numérique et Nanosciences UMR 5298, Université de Bordeaux, Institut d’Optique Graduate School, CNRS, Talence, France

⁴⁶The University of Washington eScience Institute, The University of Washington, Seattle, WA USA

⁴⁷Federal Reserve Board of Governors, Washington, DC, USA

⁴⁸Datadog Inc., New York, NY USA

⁴⁹HQ, Orexplore, Stockholm, Sweden

⁵⁰Statistics Department, University of California - Davis, Davis, CA USA

⁵¹Emory University, Atlanta, GA USA

⁵²Applied BioMath, Concord, MA USA

⁵³Department of Computer Science, University of Oxford, Oxford, UK

⁵⁴NeuroInformatics Laboratory, Bruno Kessler Foundation, Trento, Italy

⁵⁵Independent researcher, Chicago, IL USA

⁵⁶Department of Engineering, University of Cambridge, Cambridge, UK

⁵⁷Aix Marseille Univ, CNRS, Centrale Marseille, LMA, Marseille, France

⁵⁸Interdisciplinary Center for Scientific Computing (IWR), Heidelberg University, Heidelberg, Germany

⁵⁹ABB Corporate Research, ABB AG, Ladenburg, Germany

⁶⁰Institut für Mathematische Optimierung, Technische Universität Carolo-Wilhelmina zu Braunschweig, Braunschweig, Germany

⁶¹Independent researcher, Cologne, Germany

⁶²Lawrence Berkeley National Laboratory, Berkeley, CA USA

⁶³Institut für Physik, Universität Augsburg, Augsburg, Germany

⁶⁴Applied Research Laboratories, The University of Texas at Austin, Austin, TX USA

⁶⁵Department of Radiology, School of Medicine, University of Cincinnati, Cincinnati, OH USA

⁶⁶Department of Radiology, Cincinnati Children’s Hospital Medical Center, Cincinnati, OH USA

⁶⁷Ascent Robotics Inc., Tokyo, Japan

⁶⁸ENSTA Bretagne, Brest, France

⁶⁹Faculty of Physics, Ludwig-Maximilians-Universität, München, Germany

⁷⁰Excellence Cluster Universe, München, Germany

⁷¹Independent researcher, Malden, Massachusetts USA

⁷²Data Sciences, Chan Zuckerberg Biohub, San Francisco, CA USA

⁷³Faculty of Mechanical Engineering, University of Ljubljana, Ljubljana, Slovenia

⁷⁴Sydney Informatics Hub, The University of Sydney, Camperdown, NSW Australia

⁷⁵Instituto de Astrofísica, Pontificia Universidad Católica de Chile, Santiago, Chile

⁷⁶Max Planck Institute for Extraterrestrial Physics, Garching, Germany

⁷⁷University of Stuttgart, Machine Learning and Robotics Lab, Stuttgart, Germany

⁷⁸Department of Electrical Engineering, Universidade Federal de Campina Grande, Campina Grande, Brazil

⁷⁹Department of Computer Science, Kiel University, Kiel, Germany

⁸⁰Planetary Sciences Group and Florida Space Institute and Department of Physics, University of Central Florida, Orlando, FL USA

⁸¹Independent researcher, Madrid, Spain

⁸²Monash Micro Imaging, Monash University, Clayton, VIC Australia

⁸³Department of Molecular, Cellular, and Developmental Biology, University of Colorado, Boulder, Boulder, CO USA

⁸⁴Department of Physics and Astronomy, Johns Hopkins University, Baltimore, MD USA

⁸⁵Independent researcher, Munich, Germany

⁸⁶Center for Advanced Radiation Sources, The University of Chicago, Chicago, IL USA

⁸⁷University of Tübingen, Tübingen, Germany

⁸⁸Independent researcher, Rugby, UK

⁸⁹Two Sigma Investments, New York, NY USA

⁹⁰Department of Mechanical Engineering, Technical University of Munich, Garching, Germany

⁹¹Independent researcher, Berkeley, CA USA

⁹²Independent researcher, London, UK

⁹³Independent researcher, Berlin, Germany

⁹⁴Intel Corp., Austin, TX USA

⁹⁵Independent Researcher, Horten, Norway

⁹⁶Independent researcher, Daly City, CA USA

⁹⁷D. E. Shaw Research, New York, NY USA

⁹⁸Division of Computational Systems Biology, Department of Microbiology and Ecosystem Science, University of Vienna, Vienna, Austria

⁹⁹Independent researcher, Melbourne, Australia

¹⁰⁰School of Physics and Astronomy, University of Manchester, Manchester, UK

¹⁰¹Electrical and Computer Engineering, University of Wisconsin–Madison, Madison, WI USA

¹⁰²Dipartimento di Informatica, Università degli Studi di Milano, Milan, Italy

¹⁰³Inter-University Centre for Astronomy and Astrophysics, Ganeshkhind, Pune, India

¹⁰⁴Kavli Institute for the Physics and Mathematics of the Universe, Kashiwa-shi, Japan

¹⁰⁵Waymo LLC, Mountain View, CA USA

¹⁰⁶Faculty of Engineering, Niigata University, Nishi-ku, Niigata, Japan

¹⁰⁷Virginia Polytechnic Institute and State University, Blacksburg, VA USA

¹⁰⁸Aperio Software, Headingley Enterprise and Arts Centre, Leeds, UK

¹⁰⁹Independent researcher, Duisburg, Germany

¹¹⁰Broad Institute, Cambridge, MA USA

¹¹¹Independent researcher, Gainesville, FL USA

¹¹²Department of Psychology, Humboldt University of Berlin, Berlin, Germany

¹¹³Epiq Solutions, Schaumburg, IL USA

¹¹⁴Max Planck Institute for Software Systems, Kaiserslautern, Germany

¹¹⁵Department of Psychology and Brain Sciences, Dartmouth College, Hanover, NH USA

¹¹⁶Jacobs School of Engineering, University of California San Diego, La Jolla, CA USA

^✉

Corresponding author.

PMCID: PMC7056644 PMID: 32015543

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.

Subject terms: Computational biology and bioinformatics, Biophysical chemistry, Technology

This Perspective describes the development and capabilities of SciPy 1.0, an open source scientific computing library for the Python programming language.

Main

SciPy is a library of numerical routines for the Python programming language that provides fundamental building blocks for modeling and solving scientific problems. SciPy includes algorithms for optimization, integration, interpolation, eigenvalue problems, algebraic equations, differential equations and many other classes of problems; it also provides specialized data structures, such as sparse matrices and k-dimensional trees. SciPy is built on top of NumPy^1,2, which provides array data structures and related fast numerical routines, and SciPy is itself the foundation upon which higher level scientific libraries, including scikit-learn³ and scikit-image⁴, are built. Scientists, engineers and others around the world rely on SciPy. For example, published scripts^5,6 used in the analysis of gravitational waves^7,8 import several subpackages of SciPy, and the M87 black hole imaging project cites SciPy⁹.

Recently, SciPy released version 1.0, a milestone that traditionally signals a library’s API (application programming interface) being mature enough to be trusted in production pipelines. This version numbering convention, however, belies the history of a project that has become the standard others follow and has seen extensive adoption in research and industry.

SciPy’s arrival at this point is surprising and somewhat anomalous. When started in 2001, the library had little funding and was written mainly by graduate students—many of them without a computer science education and often without the blessing of their advisors. To even imagine that a small group of ‘rogue’ student programmers could upend the already well-established ecosystem of research software—backed by millions in funding and many hundreds of highly qualified engineers^10–12—was preposterous.

Yet the philosophical motivations behind a fully open tool stack, combined with an excited, friendly community with a singular focus, have proven auspicious in the long run. They led not only to the library described in this paper, but also to an entire ecosystem of related packages (https://wiki.python.org/moin/NumericAndScientific) and a variety of social activities centered around them (https://wiki.python.org/moin/PythonConferences). The packages in the SciPy ecosystem share high standards of implementation, documentation and testing, and a culture eager to learn and adopt better practices—both for community management and software development.

Background

Here we capture a selective history of some milestones and important events in the growth of SciPy. Despite what we highlight here, it is important to understand that a project like SciPy is only possible because of the contributions of very many contributors—too many to mention individually, but each bringing an important piece to the puzzle.

Python is an interpreted, high-level, general-purpose computer programming language, designed by Guido van Rossum in the late 1980s, with a dynamic type system and an emphasis on readability and rapid prototyping¹³ (https://github.com/python/cpython). As a general-purpose programming language, it had no special support for scientific data structures or algorithms, unlike many of the other established computation platforms of the time. Yet scientists soon discovered the language’s virtues, such as its ability to wrap C and Fortran libraries, and to then drive those libraries interactively. Scientists could thereby gain access to a wide variety of existing computational libraries without concerning themselves with low-level programming concepts such as memory management.

In 1995, Jim Hugunin, a graduate student at the Massachusetts Institute of Technology, wrote the first message in a new Python Matrix Special Interest Group (Matrix-SIG) mailing list¹⁴:

“There seems to be a fair amount of interest in the Python community concerning the addition of numeric operations to Python. My own desire is to have as large a library of matrix based functions available as possible (linear algebra, eigenfunctions, signal processing, statistics, etc.). In order to ensure that all of these libraries interoperate, there needs to be agreement on a basic matrix object that can be used to represent arrays of numbers.”

Over the next several months, conversations on that mailing list by, among others, Jim Fulton, Jim Hugunin, Paul Dubois, Konrad Hinsen and Guido van Rossum led to the creation of a package called Numeric with an array object that supported a high number of dimensions. Jim Hugunin explained the utility of Python for numerical computation¹⁵:

“I’ve used almost all of the available numerical languages at one time or another over the past 8 years. One thing I’ve noticed is that over time, the designers of these languages are steadily adding more of the features that one would expect to find in a general-purpose programming language.”

This remains a distinguishing feature of Python for science and one of the reasons why it has been so successful in the realm of data science: instead of adding general features to a language designed for numerical and scientific computing, here scientific features are added to a general-purpose language. This broadens the scope of problems that can be addressed easily, expands the sources of data that are readily accessible and increases the size of the community that develops code for the platform.

SciPy begins

By the late 1990s, discussions appeared on Matrix-SIG expressing a desire for a complete scientific data analysis environment¹⁶. Travis Oliphant, a PhD student at the Mayo Clinic, released a number of packages^17,18 that built on top of the Numeric array package, and provided algorithms for signal processing, special functions, sparse matrices, quadrature, optimization, fast Fourier transforms and more. One of these packages, Multipack (http://pylab.sourceforge.net/multipack.html), was a set of extension modules that wrapped Fortran and C libraries to solve nonlinear equations and least-squares problems, integrate differential equations and fit splines. Robert Kern, then an undergraduate student (and currently a SciPy core developer), provided compilation instructions under Windows. Around the same time, Pearu Peterson, a PhD student from Estonia, released F2PY¹⁹, a command line tool for binding Python and Fortran codes, and wrote modules for linear algebra and interpolation. Eric Jones, while a graduate student at Duke University, wrote packages to support his dissertation, including a parallel job scheduler and genetic optimizer. Gary Strangman, a postdoctoral fellow at Harvard Medical School, published several descriptive and inferential statistical routines²⁰.

With a rich programming environment and a numerical array object in place, the time was ripe for the development of a full scientific software stack. In 2001, Eric Jones and Travis Vaught founded Enthought Scientific Computing Solutions (now Enthought, Inc.) in Austin, Texas, USA. To simplify the tool stack, they created the SciPy project, centered around the SciPy library, which would subsume all the above-mentioned packages. The new project quickly gained momentum, with a website and code repository²¹ appearing in February, and a mailing list announced²² in June 2001. By August 2001, a first release was announced²³, an excerpt of which is shown in Box 1. In September, the first documentation was published²⁴. The first SciPy workshop²⁵ was held in September 2002 at Caltech—a single track, two-day event with 50 participants, many of them developers of SciPy and surrounding libraries.

At this point, scientific Python started attracting more serious attention; code that started as side projects by graduate students had grown into essential infrastructure at national laboratories and research institutes. For example, Paul Dubois at Lawrence Livermore National Laboratory (LLNL) took over the maintenance of Numeric and funded the writing of its manual²⁶, and the Space Telescope Science Institute (STScI), which was in charge of Hubble Space Telescope science operations, decided to replace their custom scripting language and analysis pipeline with Python²⁷. As STScI continued to use Python for an increasingly large portion of the Hubble Space Telescope data analysis pipeline, they encountered problems with the Python numerical array container. Numeric, the original array package, was suitable for small arrays, but not for the large images processed by STScI. With the Numeric maintainer’s blessing, the decision was made to write NumArray²⁸, a library that could handle data on a larger scale. Unfortunately, NumArray proved inefficient for small arrays, presenting the community with a rather unfortunate choice. In 2005, Travis Oliphant combined the best elements of Numeric and NumArray, thereby solving the dilemma. NumPy 1.0 was released²⁹ in October 2006, paving the way for the reunified scientific Python community to mature.

SciPy matures

By the middle to late 2000s, SciPy was starting to mature after a long phase of significant growth and adoption. The scope of the SciPy library narrowed, while the breadth of the ecosystem grew through a new type of auxiliary package: the scikit (https://www.scipy.org/scikits.html), a complementary library developed outside SciPy, allowing for more rapid exploration of experimental ideas while maintaining familiar style and development methodology. In SciPy itself, tooling, development, documentation and release processes became more professional. 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³⁰.

Early versions of SciPy had minimal documentation, but this began to change with the 2006 release of a Guide to NumPy¹. In 2007, Sphinx³¹ made it possible to render hypertext and PDF documents automatically from plain text (docstrings) interspersed with Python code, and in 2008, pydocweb³² enabled collaborative documentation development in a wiki-like fashion. The SciPy Documentation Project^33,34 used these tools to complete documentation of SciPy’s user-facing functionality: offering t-shirts to contributors from around the world in exchange for high-quality text, it collected contributions from over 75 people to produce an 884-page manual³⁵. Since then, SciPy has remained committed to maintaining high-quality documentation as part of the normal development cycle.

In the early SciPy workshops, recurrent topics reflected the state of development, with emphasis being placed on the underlying array package, plotting, parallel processing, acceleration/wrapping and user interfaces. By 2004, presentations about the application of SciPy to scientific problems began to appear. The event also started to draw in more keynote speakers from outside the community, such as Guido van Rossum (creator of Python, 2006), Ivan Krstić (One Laptop per Child, 2007), Alex Martelli (Google, 2008) and Peter Norvig (Google Research, 2009). The informal workshop grew from a small gathering of core developers into an international conference with hundreds of attendees, increased funding, a published proceedings and scholarships for attending students. By 2010, the US SciPy conference had multiple tracks, and satellite conferences were being organized by volunteers elsewhere, such as EuroSciPy (since 2008) and SciPy India (since 2009). Special sessions and minisymposia dedicated to scientific Python began appearing at many other events. For example, a three-part minisymposium organized for International Conferences on Computational Science and Engineering (CSE) 2009 was featured in SIAM News³⁶.

In 2007, Python had a strong enough presence in science and engineering that the editors of IEEE Computing in Science and Engineering solicited a special issue about Python in science³⁷, edited by Paul Dubois. However, Python was still sufficiently niche that the average reader would need additional information to decide whether it would be useful in their own work. The follow-up March/April 2011 Python for Scientists and Engineers special issue³⁸ focused more on the core parts of the scientific Python ecosystem³⁹ including NumPy², Cython⁴⁰ and Mayavi⁴¹. Python became so pervasive that journals began publishing domain-specific special issues. For example, in 2015, Frontiers in Neuroinformatics published a collection of 25 articles—covering topics including modeling and simulation, data collection, electrophysiology, visualization as well as stimulus generation and presentation—called Python in Neuroscience⁴².

SciPy today

As of February 2019, the SciPy library consists of nearly 600,000 lines of open-source code organized in 16 subpackages summarized in Box 2. The development team and community currently interact and operate primarily on GitHub, an online version control and task management platform. Over 110,000 GitHub repositories and 6,500 packages depend on SciPy⁴³. Some of the major feature highlights from the three years preceding SciPy 1.0 are discussed in the “Key technical improvements” section below, and milestones in its history are highlighted in Fig. 1.

Fig. 1 — Note that SciKits and GitHub have been introduced in the Background section; more information about Cython and SciPy subpackages (for example, scipy.sparse) is available in the ‘Architecture and implementation choices’ section, BLAS/LAPACK support is detailed in the ‘Key technical improvements’ section, and continuous integration is discussed in the ‘Test and benchmark suite’ section.

Box 1 Excerpt from the SciPy 0.1 release announcement (typos corrected), posted 20 August 2001 on the Python-list mailing list.

SciPy is an open-source package that builds on the strengths of Python and Numeric, providing a wide range of fast scientific and numeric functionality. SciPy’s current module set includes the following:

Special functions (Bessel, Hankel, Airy and others)
Signal/image processing
2D plotting capabilities
Integration
ODE solvers
Optimization (simplex, BFGS, Newton-CG and others)
Genetic algorithms
Numeric to C++ expression compiler
Parallel programming tools
Splines and interpolation
Other items

Box 2 Package organization.

The SciPy library is organized as a collection of subpackages. The 16 subpackages include mathematical building blocks (for example, linear algebra, Fourier transforms, special functions), data structures (for example, sparse matrices, k-D trees), algorithms (for example, numerical optimization and integration, clustering, interpolation, graph algorithms, computational geometry) and higher-level data analysis functionality (for example, signal and image processing, statistical methods).

Here we summarize the scope and capabilities of each subpackage. Additional information is available in the SciPy tutorial (https://docs.scipy.org/doc/scipy/reference/tutorial/) and API reference (https://docs.scipy.org/doc/scipy/reference/index.html#api-reference).

cluster

The cluster subpackage contains cluster.vq, which provides vector quantization and k-means algorithms, and cluster.hierarchy, which provides functions for hierarchical and agglomerative clustering.

constants

Physical and mathematical constants, including the CODATA recommended values of the fundamental physical constants¹¹⁹.

fftpack

Fast Fourier Transform routines. In addition to the FFT itself, the subpackage includes functions for the discrete sine and cosine transforms and for pseudo-differential operators.

integrate

The integrate subpackage provides tools for the numerical computation of single and multiple definite integrals and for the solution of ordinary differential equations, including initial value problems and two-point boundary value problems.

interpolate

The interpolate subpackage contains spline functions and classes, one-dimensional and multi-dimensional (univariate and multivariate) interpolation classes, Lagrange and Taylor polynomial interpolators, and wrappers for FITPACK⁵³ and DFITPACK functions.

io

A collection of functions and classes for reading and writing Matlab (https://www.mathworks.com/products/matlab.html), IDL, Matrix Market¹²⁰, Fortran, NetCDF¹²¹, Harwell-Boeing¹²², WAV and ARFF data files.

linalg

Linear algebra functions, including elementary functions of a matrix, such as the trace, determinant, norm and condition number; basic solver for Ax = b; specialized solvers for Toeplitz matrices, circulant matrices, triangular matrices and other structured matrices; least-squares solver and pseudo-inverse calculations; eigenvalue and eigenvector calculations (basic and generalized); matrix decompositions, including Cholesky, Schur, Hessenberg, LU, LDL^T, QR, QZ, singular value and polar; and functions to create specialized matrices, such as diagonal, Toeplitz, Hankel, companion, Hilbert and more.

ndimage

This subpackage contains various functions for multi-dimensional image processing, including convolution and assorted linear and nonlinear filters (Gaussian filter, median filter, Sobel filter and others); interpolation; region labeling and processing; and mathematical morphology functions.

misc

A collection of functions that did not fit into the other subpackages. Although this subpackage still exists in SciPy 1.0, an effort is underway to deprecate or relocate the contents of this subpackage and remove it.

odr

Orthogonal distance regression, including Python wrappers for the Fortran library ODRPACK⁵⁴.

optimize

This subpackage includes simplex and interior-point linear programming solvers, implementations of many nonlinear minimization algorithms, a routine for least-squares curve fitting, and a collection of general nonlinear solvers for root-finding.

signal

The signal subpackage focuses on signal processing and basic linear systems theory. Functionality includes convolution and correlation, splines, filtering and filter design, continuous and discrete time linear systems, waveform generation, window functions, wavelet computations, peak finding and spectral analysis.

sparse

This subpackage includes implementations of several representations of sparse matrices. scipy.sparse.linalg provides a collection of linear algebra routines that work with sparse matrices, including linear equation solvers, eigenvalue decomposition, singular value decomposition and LU factorization. scipy.sparse.csgraph provides a collections of graph algorithms for which the graph is represented using a sparse matrix. Algorithms include connected components, shortest path, minimum spanning tree and more.

spatial

This subpackage provides spatial data structures and algorithms, including the k-d tree, Delaunay triangulation, convex hulls and Voronoi diagrams. scipy.spatial.distance provides a large collection of distance functions, along with functions for computing the distance between all pairs of vectors in a given collection of points or between all pairs from two collections of points.

special

The name comes from the class of functions traditionally known as special functions, but over time, the subpackage has grown to include functions beyond the classical special functions. A more appropriate characterization of this subpackage is simply useful functions. It includes a large collection of the classical special functions such as Airy, Bessel and others; families of orthogonal polynomials; the Gamma function, and functions related to it; functions for computing the PDF, CDF and quantile function for several probability distributions; information theory functions; combinatorial functions comb and factorial; and more.

stats

The stats subpackage provides a large collection of continuous and discrete probability distributions, each with methods to compute the PDF or PMF, CDF, moments and other statistics, generation of random variates and more; statistical tests, including tests on equality of means/medians/variance (such as the t-test) and tests whether a sample is drawn from a certain distribution (such as the Kolmogorov-Smirnov test); measures of correlation, including Pearson’s r, Kendall’s τ, and Spearman’s ρ coefficients; descriptive statistics including trimmed values; kernel density estimation; and transformations of data such as the Box-Cox power transformation.

Architecture and implementation choices

Project scope

SciPy provides fundamental algorithms for scientific computing. The breadth of its scope was derived from the guide to available mathematical software (GAMS) classification system⁴⁴. In areas that move relatively slowly, for example, linear algebra, SciPy aims to provide complete coverage. In other areas it aims to provide fundamental building blocks while interacting well with other packages specialized in that area. 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⁴⁵ provides more advanced statistical estimators and inference methods, scikit-learn³ covers machine learning, and PyMC3⁴⁶, emcee⁴⁷ and PyStan (http://mc-stan.org) cover Bayesian statistics and probabilistic modeling. scikit-image⁴ provides image processing capabilities beyond SciPy’s ndimage, SymPy⁴⁸ provides a Python interface for symbolic computation, and sparse.csgraph and spatial offer basic tools for working with graphs and networks compared to specialized libraries such as NetworkX⁴⁹.

We use the following criteria to determine whether to include new functionality in SciPy:

The algorithm is of relevance to multiple fields of science.
The algorithm is demonstrably important. For example, it is classic enough to be included in textbooks, or it is based on a peer-reviewed article that has a substantial number of citations.

In terms of software systems and architecture, SciPy’s scope matches NumPy’s: algorithms for in-memory computing on single machines, with support for a wide range of data types and process architectures. Distributed computing and support for graphics processing units (GPUs) were explicitly out of scope at the 1.0 release point, but this has been revised in our roadmap (see Discussion).

Language choices

According to analysis using the linguist library (https://github.com/github/linguist), SciPy is approximately 50% Python, 25% Fortran, 20% C, 3% Cython and 2% C++, with a dash of TeX, Matlab, shell script and Make. The distribution of secondary programming languages in SciPy is a compromise between a powerful, performance-enhancing language that interacts well with Python (that is, Cython) and the usage of languages (and their libraries) that have proven reliable and performant over many decades.

Fortran, despite its age, is still a high-performance scientific programming language with continued contemporary usage⁵⁰. Thus, we wrap the following excellent, field-tested Fortran libraries to provide Python convenience while benefiting from their performance: QUADPACK⁵¹ and ODEPACK⁵² for numerical integration and solution of initial value problems; FITPACK⁵³, ODRPACK⁵⁴ and MINPACK⁵⁵ for curve-fitting and least-squares minimization; FFTPACK^56,57 for performing Fourier transforms; ARPACK⁵⁸ for solving eigenvalue problems; ALGORITHM 644 (ref. ⁵⁹) for computing Bessel functions; and CDFLIB⁶⁰ for evaluating cumulative density functions.

Rounding out the top three languages in SciPy is C, which is also extremely well-established over several decades⁶¹ of scientific computing. The C libraries that we wrap in SciPy include trlib⁶² for optimization, SuperLU^63,64 for solving sparse linear systems, Qhull⁶⁵ for computational geometry and Cephes (http://www.netlib.org/cephes/) for special functions.

Cython has been described as a creole language that mixes the best parts of Python and lower-level C/C++ paradigms⁴⁰. We often use Cython as a glue between well-established, low-level scientific computing libraries written in C/C++ and the Python interface offered by SciPy. We also use Cython to enable performance enhancements in Python code, especially for cases where heavily used inner loops benefit from a compiled code with static typing.

For implementing new functionality, Python is the still the language of choice. If Python performance is an issue, then we prefer the use of Cython followed by C, C++ or Fortran (in that order). The main motivation for this is maintainability: Cython has the highest abstraction level, and most Python developers will understand it. C is also widely known, and easier for the current core development team to manage than C++ and especially Fortran.

The position that SciPy occupies near the foundation of the scientific Python ecosystem is such that adoption of new languages or major dependencies is generally unlikely; our choices are strongly driven by long-term stability. GPU acceleration, new transpiling libraries and the latest JIT compilation approaches (for example, Numba⁶⁶) are very powerful but have traditionally fallen outside the remit of the main SciPy library. That said, we have recently increased our efforts to support compatibility with some of these options, and our full test suite passed with the PyPy JIT compiler⁶⁷ at the 1.0 release point.

API and ABI evolution

The API for SciPy consists of approximately 1,500 functions and classes. Our policy for evolving the API over time is that new functionality can be added, while removing or changing existing functionality can only be done if the benefits exceed the (often significant) costs to users and only after giving clear deprecation warnings to those users for at least one year. In general, we encourage changes that improve clarity in the API of the library but strongly discourage breaking backward compatibility, given our position near the base of the scientific Python computing stack.

In addition to the Python API, SciPy has C and Cython interfaces. Therefore, we also have to consider the application binary interface (ABI). This ABI has been stable for a long time, and we aim to evolve it only in a backward-compatible way.

Key technical improvements

Here we describe key technical improvements made in the last three years.

Data structures

Sparse matrices

scipy.sparse offers seven sparse matrix data structures, also known as sparse formats. The most important ones are the row- and column-compressed formats (CSR and CSC, respectively). These offer fast major-axis indexing and fast matrix-vector multiplication, and are used heavily throughout SciPy and dependent packages.

Over the last three years, our sparse matrix handling internals were rewritten and performance was improved. Iterating over and slicing of CSC and CSR matrices is now up to 35% faster, and the speed of coordinate (COO)/diagonal (DIA) to CSR/CSC matrix format conversions has increased. SuperLU⁶³ was updated to version 5.2.1, enhancing the low-level implementations leveraged by a subset of our sparse offerings.

From a new features standpoint, scipy.sparse matrices and linear operators now support the Python matrix multiplication (@) operator. We added scipy.sparse.norm and scipy.sparse.random for computing sparse matrix norms and drawing random variates from arbitrary distributions, respectively. Also, we made a concerted effort to bring the scipy.sparse API into line with the equivalent NumPy API where possible.

cKDTree

The scipy.spatial.ckdtree module, which implements a space-partitioning data structure that organizes points in k-dimensional space, was rewritten in C++ with templated classes. Support was added for periodic boundary conditions, which are often used in simulations of physical processes.

In 2013, the time complexity of the k-nearest-neighbor search from cKDTree.query was approximately loglinear⁶⁸, consistent with its formal description⁶⁹. Since then, we enhanced cKDTree.query by reimplementing it in C++, removing memory leaks and allowing release of the global interpreter lock (GIL) so that multiple threads may be used⁷⁰. This generally improved performance on any given problem while preserving the asymptotic complexity.

In 2015, SciPy added the sparse_distance_matrix routine for generating approximate sparse distance matrices between KDTree objects by ignoring all distances that exceed a user-provided value. This routine is not limited to the conventional L2 (Euclidean) norm but supports any Minkowski p-norm between 1 and infinity. By default, the returned data structure is a dictionary of keys (DOK)-based sparse matrix, which is very efficient for matrix construction. This hashing approach to sparse matrix assembly can be seven times faster than constructing with CSR format⁷¹, and the C++ level sparse matrix construction releases the Python GIL for increased performance. Once the matrix is constructed, distance value retrieval has an amortized constant time complexity⁷², and the DOK structure can be efficiently converted to a CSR, CSC or COO matrix to allow for speedy arithmetic operations.

In 2015, the cKDTree dual tree counting algorithm⁷³ was enhanced to support weights⁷⁴, which are essential in many scientific applications, for example, computing correlation functions of galaxies⁷⁵.

Unified bindings to compiled code

LowLevelCallable

As of SciPy version 0.19, it is possible for users to wrap low-level functions in a scipy.LowLevelCallable object that reduces the overhead of calling compiled C functions, such as those generated using Numba or Cython, directly from Python. Supported low-level functions include PyCapsule objects, ctypes function pointers and cffi function pointers. Furthermore, it is possible to generate a low-level callback function automatically from a Cython module using scipy.LowLevelCallable.from_cython.

Cython bindings for BLAS, LAPACK and special

SciPy has provided special functions and leveraged basic linear algebra subprograms (BLAS) and linear algebra package (LAPACK)⁷⁶ routines for many years. SciPy now additionally includes Cython⁴⁰ wrappers for many BLAS and LAPACK routines (added in 2015) and the special functions provided in the scipy.special subpackage (added in 2016), which are available in scipy.linalg.cython_blas, scipy.linalg.cython_lapack and scipy.special.cython_special, respectively. When writing algorithms in Cython, it is typically more efficient to call directly into the libraries SciPy wraps rather than indirectly, using SciPy’s Python APIs. These low-level interfaces for Cython can also be used outside of the SciPy codebase to gain access to the functions in the wrapped libraries while avoiding the overhead of Python function calls. This can give performance gains of one or two orders of magnitude for many use cases.

Developers can also use the low-level Cython interfaces without linking against the wrapped libraries⁷⁷. This lets other extensions avoid the complexity of finding and using the correct libraries. Avoiding this complexity is especially important when wrapping libraries written in Fortran. Not only can these low-level wrappers be used without a Fortran compiler, they can also be used without having to handle all the different Fortran compiler ABIs and name mangling schemes.

Most of these low-level Cython wrappers are generated automatically to help with both correctness and ease of maintenance. The wrappers for BLAS and LAPACK are primarily generated using type information that is parsed from the BLAS and LAPACK source files using F2PY¹⁹, though a small number of routines use hand-written type signatures instead. The input and output types of each routine are saved in a data file that is read at build time and used to generate the corresponding Cython wrapper files. The wrappers in scipy.special.cython_special are also generated from a data file containing type information for the wrapped routines.

Since SciPy can be built with LAPACK 3.4.0 or later, Cython wrappers are only provided for the routines that maintain a consistent interface across all supported LAPACK versions. The standard BLAS interface provided by the various existing BLAS libraries is not currently changing, so changes are not generally needed in the wrappers provided by SciPy. Changes to the Cython wrappers for the functions in scipy.special follow corresponding changes to the interface of that subpackage.

Numerical optimization

The scipy.optimize subpackage provides functions for the numerical solution of several classes of root finding and optimization problems. Here we highlight recent additions through SciPy 1.0.

Linear optimization

A new interior-point optimizer for continuous linear programming problems, linprog with method = ’interior-point’, was released with SciPy 1.0. Implementing the core algorithm of the commercial solver MOSEK⁷⁸, it solves all of the 90+ NETLIB LP benchmark problems⁷⁹ tested. Unlike some interior point methods, this homogeneous self-dual formulation provides certificates of infeasibility or unboundedness as appropriate.

A presolve routine⁸⁰ solves trivial problems and otherwise performs problem simplifications, such as bound tightening and removal of fixed variables, and one of several routines for eliminating redundant equality constraints is automatically chosen to reduce the chance of numerical difficulties caused by singular matrices. Although the main solver implementation is pure Python, end-to-end sparse matrix support and heavy use of SciPy’s compiled linear system solvers—often for the same system with multiple right hand sides owing to the predictor-corrector approach—provide speed sufficient for problems with tens of thousands of variables and constraints.

Nonlinear optimization: local minimization

The minimize function provides a unified interface for finding local minima of nonlinear optimization problems. Four new methods for unconstrained optimization were added to minimize in recent versions of SciPy: dogleg, trust-ncg, trust-exact and trust-krylov. All are trust-region methods that build a local model of the objective function based on first and second derivative information, approximate the best point within a local ‘trust region’ and iterate until a local minimum of the original objective function is reached, but each has unique characteristics that make it appropriate for certain types of problems. For instance, trust-exact achieves fast convergence by solving the trust-region subproblem almost exactly, but it requires the second derivative Hessian matrix to be stored and factored every iteration, which may preclude the solution of large problems (≥1,000 variables). In contrast, trust-ncg and trust-krylov are well suited to large-scale optimization problems because they do not need to store and factor the Hessian explicitly, instead using second derivative information in a faster, approximate way. We compare the characteristics of all minimize methods in detail in Table 1, which illustrates the level of completeness that SciPy aims for when covering a numerical method or topic.

Table 1.

Optimization methods from minimize

	Nelder-Mead	Powell	COBYLA	CG	BFGS	L-BFGS-G	SLSQP	TNC	Newton-CG	dogleg	trust-ncg	trust-exact	trust-Krylov
Version added	0.6*	0.6*	0.6*	0.6*	0.6*	0.6*	0.9	0.6*	0.6*	0.13	0.13	0.19	1.0
Wrapper			✓			✓	✓	✓					✓
First derivatives				✓	✓	✓	✓	✓	✓	✓	✓	✓	✓
Second derivatives					~	~	~	✓	✓	✓	✓	✓	✓
Iterative Hessian factorization								✓	✓		✓		✓
Local convergence				L	S	L	S	S*	S*	Q	S*	Q	S*
Global convergence					✓	✓	✓	✓	✓	✓	✓	✓	✓
Trust region	Neither	LS	TR	LS	LS	LS	LS	LS	LS	TR	TR	TR	TR
Bound constraints						✓	✓	✓	✓
Equality constraints							✓
Inequality constraints			✓				✓
References	^98,99	¹⁰⁰	^101–103	^104,105	¹⁰⁵	^106,107	^108–111	¹¹²	¹⁰⁵	^105,113	^105,114	^115,116	^62,117

Open in a new tab

Optimization methods from minimize, which solves problems of the form $\min_{x} f (x)$ , where $x \in R^{n}$ and $f : R^{n} \to R$ . ‘Version added’ specifies the algorithm’s first appearance in SciPy. Algorithms with version added “0.6*” were added in version 0.6 or before. ‘Wrapper’ indicates whether the implementation available in SciPy wraps a function written in a compiled language (for example, C or FORTRAN). ‘First derivatives’ and ‘second derivatives’ indicate whether first or second order derivatives are required. When ‘second derivatives’ is flagged with ‘~’, the algorithm accepts but does not require second-order derivatives from the user; it computes an approximation internally and uses it to accelerate method convergence.

‘Iterative Hessian factorization’ denotes algorithms that factorize the Hessian in an iterative way, which does not require explicit matrix factorization or storage of the Hessian. ‘Local convergence’ gives a lower bound on the rate of convergence of the iteration sequence once the iterate is sufficiently close to the solution: linear (L), superlinear (S) and quadratic (Q). Convergence rates denoted S* indicate that the algorithm has a superlinear rate for the parameters used in SciPy, but can achieve a quadratic convergence rate with other parameter choices. ‘Global convergence’ is marked for the algorithms with guarantees of convergence to a stationary point (that is, a point x* for which $\nabla f (x^{*}) = 0$ ); this is not a guarantee of convergence to a global minimum. ‘Lines-search’ (LS) or ‘trust-region’ (TR) indicates which of the two globalization approaches is used by the algorithm. The table also indicates which algorithms can deal with constraints on the variables. We distinguish among bound constraints ( $x^{l} \leq x \leq x^{u}$ ), equality constraints ( $c_{eq} (x) = 0$ ) and inequality constraints ( $c_{ineq} (x) \geq 0$ ).

Nonlinear optimization: global minimization

As minimize may return any local minimum, some problems require the use of a global optimization routine. The new scipy.optimize.differential_evolution function^81,82 is a stochastic global optimizer that works by evolving a population of candidate solutions. In each iteration, trial candidates are generated by combination of candidates from the existing population. If the trial candidates represent an improvement, then the population is updated. Most recently, the SciPy benchmark suite gained a comprehensive set of 196 global optimization problems for tracking the performance of existing solvers over time and for evaluating whether the performance of new solvers merits their inclusion in the package.

Statistical distributions

The scipy.stats subpackage contains more than 100 probability distributions: 96 continuous and 13 discrete univariate distributions, and 10 multivariate distributions. The implementation relies on a consistent framework that provides methods to sample random variates, to evaluate the cumulative distribution function (CDF) and the probability density function (PDF), and to fit parameters for every distribution. Generally, the methods rely on specific implementations for each distribution, such as a closed-form expression of the CDF or a sampling algorithm, if available. Otherwise, default methods are used based on generic code, for example, numerical integration of the PDF to obtain the CDF. Key recent distributions added to scipy.stats include the histogram-based distribution in scipy.stats.rv_histogram and the multinomial distribution in scipy.stats.multinomial (used, for example, in natural language processing⁸³).

Polynomial interpolators

Historically, SciPy relied heavily on the venerable FITPACK Fortran library by P. Dierckx^53,84 for univariate interpolation and approximation of data, but the original monolithic design and API for interaction between SciPy and FITPACK was limiting for both users and developers.

Implementing a new, modular design of polynomial interpolators was spread over several releases. The goals of this effort were to have a set of basic objects representing piecewise polynomials, to implement a collection of algorithms for constructing various interpolators, and to provide users with building blocks for constructing additional interpolators.

At the lowest level of the new design are classes that represent univariate piecewise polynomials: PPoly (SciPy 0.13)⁸⁵, BPoly (SciPy 0.13) and BSpline (SciPy 0.19)⁸⁶, which allow efficient vectorized evaluations, differentiation, integration and root-finding. PPoly represents piecewise polynomials in the power basis in terms of breakpoints and coefficients at each interval. BPoly is similar and represents piecewise polynomials in the Bernstein basis (which is suitable, for example, for constructing Bézier curves). BSpline represents spline curves, that is, linear combinations of B-spline basis elements⁸⁷.

In the next layer, these polynomial classes are used to construct several common ways of interpolating data: CubicSpline (SciPy 0.18)⁸⁸ constructs a twice differentiable piecewise cubic function, Akima1DInterpolator and PCHIPInterpolator implement two classic prescriptions for constructing a C¹ continuous monotone shape-preserving interpolator^89,90.

Test and benchmark suite

Test suite

Test-driven development has been described as a way to manage fear and uncertainty when making code changes⁹¹. For each component of SciPy, we write multiple small executable tests that verify its intended behavior. The collection of these, known as a ‘test suite’, increases confidence in the correctness and accuracy of the library, and allows us to make code modifications known not to alter desired behavior. According to the practice of continuous integration⁹², all proposed contributions to SciPy are temporarily integrated with the master branch of the library before the test suite is run, and all tests must be passed before the contribution is permanently merged. Continuously monitoring the number of lines of code in SciPy covered by unit tests is one way we maintain some certainty that changes and new features are correctly implemented.

The SciPy test suite is orchestrated by a continuous integration matrix that includes POSIX and Windows (32/64-bit) platforms managed by Travis CI and AppVeyor, respectively. Our tests cover Python versions 2.7, 3.4, 3.5, 3.6, and include code linting with pyflakes and pycodestyle. There are more than 13,000 unit tests in the test suite, which is written for usage with the pytest (https://docs.pytest.org/en/latest) framework. In Fig. 2, we show historical test coverage data generated using a Docker-based approach (https://github.com/tylerjereddy/scipy-cov-track). With the exception of the removal of ∼61,000 lines of compiled code for SciPy v0.14, the volume of both compiled (C, C++ and Fortran) and Python code has increased between releases, as have the number of lines covered by unit tests. Test coverage at the SciPy 1.0 release point was at 87% for Python code according to pytest-cov (https://pypi.org/project/pytest-cov/). Coverage of compiled (C, C++ and Fortran) code was only 45% according to gcov (https://gcc.gnu.org/onlinedocs/gcc/Gcov.html), but the compiled codebase is much more robust than this figure would suggest as the figure does not correct for the inclusion of reputable vendor code, the original library of which is well-tested; generated code, for which full coverage is impractical; and deprecated code, which does not require unit tests. Documentation for the code is automatically built and published by the CircleCI service to facilitate evaluation of documentation changes/integrity.

Fig. 2 — Python and compiled code volume in SciPy over time.

Benchmark suite

In addition to ensuring that unit tests are passing, it is important to confirm that the performance of the SciPy codebase improves over time. Since February 2015, the performance of SciPy has been monitored with Airspeed Velocity (asv https://github.com/airspeed-velocity/asv). SciPy’s run.py script conveniently wraps asv features such that benchmark results over time can be generated with a single console command. For example, in Fig. 3 we illustrate the improvement of scipy.spatial.cKDTree.query over roughly nine years of project history. The tree used in the benchmark was generated without application of toroidal topology (boxsize = None), and tests were performed by Airspeed Velocity 0.4 using Python 2.7, NumPy 1.8.2 and Cython versions 0.27.3, 0.21.1 and 0.18 (for improved backward compatibility). Substantial performance improvements were realized when cKDTree was fully Cythonized and again when it was rewritten in C++.

Fig. 3 — The benchmark generates a k-d tree from uniformly distributed points in an m-dimensional unit hypercube, then finds the nearest (Euclidean) neighbor in the tree for each of 1,000 query points. Each marker in the figure indicates the execution time of the benchmark for a commit in the master branch of SciPy.

Project organization and community

Governance

SciPy adopted an official governance document (https://docs.scipy.org/doc/scipy/reference/dev/governance/governance.html) on August 3, 2017. A steering council, currently composed of 18 members, oversees daily development of the project by contributing code and reviewing contributions from the community. Council members have commit rights to the project repository, but they are expected to merge changes only when there are no substantive community objections. The chair of the steering council, Ralf Gommers, is responsible for initiating biannual technical reviews of project direction and summarizing any private council activities to the broader community. The project’s benevolent dictator for life, Pauli Virtanen, has overruling authority on any matter, but is expected to act in good faith and only exercise this authority when the steering council cannot reach agreement.

SciPy’s official code of conduct was approved on October 24, 2017. In summary, there are five specific guidelines: be open to everyone participating in our community; be empathetic and patient in resolving conflicts; be collaborative, as we depend on each other to build the library; be inquisitive, as early identification of issues can prevent serious consequences; and be careful with wording. The code of conduct specifies how breaches can be reported to a code of conduct committee and outlines procedures for the committee’s response. Our diversity statement “welcomes and encourages participation by everyone.”

Maintainers and contributors

The SciPy project has ~100 unique contributors for every 6-month release cycle. Anyone with the interest and skills can become a contributor; the SciPy contributor guide (https://scipy.github.io/devdocs/dev/contributor/contributor_toc.html) provides guidance on how to do that. In addition, the project currently has 15 active (volunteer) maintainers: people who review the contributions of others and do everything else needed to ensure that the software and the project move forward. Maintainers are critical to the health of the project⁹³; their skills and efforts largely determine how fast the project progresses, and they enable input from the much larger group of contributors. Anyone can become a maintainer, too, as they are selected on a rolling basis from contributors with a substantial history of high-quality contributions.

Funding

The development cost of SciPy is estimated in excess of 10 million dollars by Open Hub (https://www.openhub.net/p/scipy/estimated_cost). Yet the project is largely unfunded, having been developed predominantly by graduate students, faculty and members of industry in their free time. Small amounts of funding have been applied with success: some meetings were sponsored by universities and industry, Google’s Summer of Code program supported infrastructure and algorithm work, and teaching grant funds were used early on to develop documentation. However, funding from national agencies, foundations and industry has not been commensurate with the enormous stack of important software that relies on SciPy. More diverse spending to support planning, development, management and infrastructure would help SciPy remain a healthy underpinning of international scientific and industrial endeavors.

Downstream projects

The scientific Python ecosystem includes many examples of domain-specific software libraries building on top of SciPy features and then returning to the base SciPy library to suggest and even implement improvements. For example, there are common contributors to the SciPy and Astropy core libraries⁹⁴, and what works well for one of the codebases, infrastructures or communities is often transferred in some form to the other. At the codebase level, the binned_statistic functionality is one such cross-project contribution: it was initially developed in an Astropy-affiliated package and then placed in SciPy afterward. In this perspective, SciPy serves as a catalyst for cross-fertilization throughout the Python scientific computing community.

Discussion

SciPy has a strong developer community and a massive user base. GitHub traffic metrics report roughly 20,000 unique visitors to the source website between 14 May 2018 and 27 May 2018 (near the time of writing), with 721 unique copies (‘clones’) of the codebase over that time period. The developer community at that time consisted of 610 unique contributors of source code, with more than 19,000 commits accepted into the codebase (GitHub page data).

From the user side, there were 13,096,468 downloads of SciPy from the Python Packaging Index (PyPI)⁹⁵ and 5,776,017 via the default channel of the conda (https://github.com/ContinuumIO/anaconda-package-data) package manager during the year 2017. These numbers establish a lower bound on the total number of downloads by users given that PyPI and conda are only two of several popular methods for installing SciPy. The SciPy website (http://www.scipy.org/), which has been the default citation in the absence of a peer-reviewed paper, has been cited over 3,000 times (https://scholar.google.com/scholar?cites=2086009121748039507). Some of the most prominent uses of or demonstrations of credibility for SciPy include the LIGO-Virgo scientific collaboration that lead to the observation of gravitational waves⁹⁶, the fact that SciPy is shipped directly with macOS and in the Intel distribution for Python⁹⁷, and that SciPy is used by 47% of all machine learning projects on GitHub (https://github.blog/2019-01-24-the-state-of-the-octoverse-machine-learning/).

Nevertheless, SciPy continually strives to improve. The SciPy Roadmap (https://docs.scipy.org/doc/scipy-1.0.0/reference/roadmap.html, https://scipy.github.io/devdocs/roadmap.html), summarized in Table 2, is a continually updated document maintained by the community that describes some of the major directions for improvement for the project, as well as specific limitations and matters that require assistance moving forward. In addition to the items on the roadmap, we are still working to increase the number of SciPy usage tutorials beyond our current 15 section offering. Also, the low-level Cython code in our library (which interacts with C-level code and exposes it for Python usage) could use some measure of modernization, including migration to typed memoryviews to handle NumPy arrays.

Table 2.

Summary of SciPy Roadmap items following 1.0 release

SciPy subpackage	Summary of change
optimize	A few more high-quality global optimizers
fftpack	Reduce overlap with NumPy equivalent
linalg	Reduce overlap with NumPy equivalent
interpolate	New spline fitting and arithmetic routines
interpolate	New transparent tensor-product splines
interpolate	New non-uniform rational B-splines
interpolate	Mesh refinement and coarsening of B-splines and tensor products
signal	Migrate spline functionality to interpolate
signal	Second order sections update to match capabilities in other routines
linalg	Support a more recent version of LAPACK
ndimage	Clarify usage of the ‘data point’ coordinate model, and add additional wrapping modes
sparse	Incorporate sparse arrays from Sparse package¹¹⁸
sparse.linalg	Add PROPACK wrappers for faster SVD
spatial	Add support for (quaternion) rotation matrices
special	Precision improvements for hypergeometric, parabolic cylinder and spheroidal wave functions

Open in a new tab

A problem faced by many open-source projects is attracting and retaining developers. Although it is normal for some individuals to contribute to a project for a while and then move on, too much turnover can result in the loss of institutional memory, leading to mistakes of the past being repeated, APIs of new code becoming inconsistent with the old code and a drifting project scope. We are fortunate that the SciPy project continues to attract enthusiastic and competent new developers while maintaining the involvement of a small but dedicated old guard. There are contributors who were present in the early years of the project who still contribute to discussions of bug reports and reviews of new code contributions. Our benevolent dictator for life has been with the project for more than 10 years and is still actively contributing code, and the head of our steering council, who also acts as a general manager, is approaching his eleventh anniversary. An additional half dozen or so active developers have been contributing steadily for five or more years. The combination of a committed old guard and a host of new contributors ensures that SciPy will continue to grow while maintaining a high level of quality.

A final important challenge to address is the accommodation of GPU and distributed computing without disrupting our conventional and heavily used algorithm/API infrastructure. Although the exact approach we will adopt across the entire library to leverage these emerging technologies remains unclear, and was not a priority at the 1.0 release point, we now have a concrete implementation of a subpackage that allows for the experimental use of multiple backends, such as GPU-tractable data structures, in the new scipy.fft. This will be described in detail in a future report.

Reporting Summary

Further information on research design is available in the Nature Research Reporting Summary linked to this article.

Supplementary information

Reporting Summary^{(135.5KB, pdf)}

Acknowledgements

We thank everyone who has contributed to SciPy 1.0, from those who have posted one comment about an issue through those who have made several small patches and beyond.

Author contributions

P.V. and R.G. led the development of SciPy for over 10 years. T.E.O., E.J. and P.P. created SciPy. T.R. and M.H. composed the manuscript with input from others. Other named authors are SciPy core developers. All authors have contributed significant code, documentation and/or expertise to the SciPy project. All authors reviewed the manuscript.

Data availability

Raw data for Fig. 2 are available at https://github.com/tylerjereddy/scipy-cov-track, and raw data for Fig. 3 are available at https://github.com/scipy/scipy-articles/tree/master/scipy-1.0/supporting_info/asv_bench/cKDTree.

Code availability

All SciPy library source code is available in the SciPy GitHub repository, https://github.com/scipy/scipy.

Competing interests

The following statements indicate industry affiliations for authors in the main author list, but not for authors in the SciPy 1.0 Contributor group beyond that. These affiliations may have since changed. R.G. was employed by Quansight LLC. T.E.O., E.J. and R.K. were employed by Enthought, Inc. T.E.O. and I.H. were employed by Anaconda Inc. N.M. was employed by WayRay LLC. E.W.M. was employed by Bruker Biospin Corp. F.P. and P.v.M. were employed by Google LLC.

Footnotes

Peer review information Rita Strack was the primary editor on this article and managed its editorial process and peer review in collaboration with the rest of the editorial team.

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A list of members and affiliations appears at the end of the paper.

Change history

2/24/2020

A Correction to this paper has been published: 10.1038/s41592-020-0772-5

Contributor Information

Ralf Gommers, Email: scipy.articles@gmail.com.

Matt Haberland, Email: scipy.articles@gmail.com.

Tyler Reddy, Email: scipy.articles@gmail.com.

SciPy 1.0 Contributors:

Aditya Vijaykumar, Alessandro Pietro Bardelli, Alex Rothberg, Andreas Hilboll, Andreas Kloeckner, Anthony Scopatz, Antony Lee, Ariel Rokem, C. Nathan Woods, Chad Fulton, Charles Masson, Christian Häggström, Clark Fitzgerald, David A. Nicholson, David R. Hagen, Dmitrii V. Pasechnik, Emanuele Olivetti, Eric Martin, Eric Wieser, Fabrice Silva, Felix Lenders, Florian Wilhelm, G. Young, Gavin A. Price, Gert-Ludwig Ingold, Gregory E. Allen, Gregory R. Lee, Hervé Audren, Irvin Probst, Jörg P. Dietrich, Jacob Silterra, James T Webber, Janko Slavič, Joel Nothman, Johannes Buchner, Johannes Kulick, Johannes L. Schönberger, José Vinícius de Miranda Cardoso, Joscha Reimer, Joseph Harrington, Juan Luis Cano Rodríguez, Juan Nunez-Iglesias, Justin Kuczynski, Kevin Tritz, Martin Thoma, Matthew Newville, Matthias Kümmerer, Maximilian Bolingbroke, Michael Tartre, Mikhail Pak, Nathaniel J. Smith, Nikolai Nowaczyk, Nikolay Shebanov, Oleksandr Pavlyk, Per A. Brodtkorb, Perry Lee, Robert T. McGibbon, Roman Feldbauer, Sam Lewis, Sam Tygier, Scott Sievert, Sebastiano Vigna, Stefan Peterson, Surhud More, Tadeusz Pudlik, Takuya Oshima, Thomas J. Pingel, Thomas P. Robitaille, Thomas Spura, Thouis R. Jones, Tim Cera, Tim Leslie, Tiziano Zito, Tom Krauss, Utkarsh Upadhyay, Yaroslav O. Halchenko, and Yoshiki Vázquez-Baeza

Supplementary information

Supplementary information is available for this paper at 10.1038/s41592-019-0686-2.

References

1.Oliphant, T.E. Guide to NumPy 1st edn (Trelgol Publishing USA, 2006).
2.van der Walt S, Colbert SC, Varoquaux G. The NumPy array: a structure for efficient numerical computation. Comput. Sci. Eng. 2011;13:22–30. [Google Scholar]
3.Pedregosa F, et al. Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 2011;12:2825–2830. [Google Scholar]
4.van der Walt S, et al. scikit-image: image processing in Python. Peer J. 2014;2:e453. doi: 10.7717/peerj.453. [DOI] [PMC free article] [PubMed] [Google Scholar]
5.Nitz, A. et al. gwastro/pycbc: PyCBC v1.13.2 release, 10.5281/zenodo.1596771 (27 November 2018).
6.Vallisneri M, Kanner J, Williams R, Weinstein A, Stephens B. The LIGO Open Science Center. J. Phys. Conf. Ser. 2015;610:012021. [Google Scholar]
7.Abbott BP, et al. GW150914: First results from the search for binary black hole coalescence with Advanced LIGO. Phys. Rev. D. 2016;93:122003. doi: 10.1103/PhysRevD.93.122003. [DOI] [PMC free article] [PubMed] [Google Scholar]
8.Abbott BP, et al. GW170817: observation of gravitational waves from a binary neutron star inspiral. Phys. Rev. Lett. 2017;119:161101. doi: 10.1103/PhysRevLett.119.161101. [DOI] [PubMed] [Google Scholar]
9.The Event Horizon Telescope Collaboration. et al. First M87 event horizon telescope results. III. Data processing and calibration. Astrophys. J. Lett. 2019;875:L3. [Google Scholar]
10.Blanton, K. At Mathworks, support + fun = success: CEO Jack Little believes in power of his workers–and their ideas. The Boston Globe, J5 (20 April 1997).
11.Howell, D. Jack Dangermond’s digital mapping lays it all out. Investor’s Business Daily (14 August 2009).
12.Port, O. Simple solutions. BusinessWeek, 24–24 (3 October 2005).
13.van Rossum, G. Python/C API Reference Manual, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.211.6702&rep=rep1&type=pdf (2001).
14.Hugunin, J. The matrix object proposal (very long), https://mail.python.org/pipermail/matrix-sig/1995-August/000002.html (18 August 1995).
15.Hugunin, J. Extending Python for numerical computation, http://hugunin.net/papers/hugunin95numpy.html (1995).
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).
17.Oliphant, T. E. Some Python modules. Web Archive, https://web.archive.org/web/19990125091242/http://oliphant.netpedia.net:80/ (25 January 1999).
18.Oliphant, T. E. Modules to enhance Numerical Python. Web Archive, https://web.archive.org/web/20001206213500/http://oliphant.netpedia.net:80/ (6 December 2000).
19.Peterson P. F2PY: a tool for connecting Fortran and Python programs. Int. J. Comput. Sci. Eng. 2009;4:296–305. [Google Scholar]
20.Strangman, G. Python modules. Web Archive, https://web.archive.org/web/20001022231108/http://www.nmr.mgh.harvard.edu/Neural_Systems_Group/gary/python.html (2000).
21.SciPy Developers. SciPy.org. Web Archive, https://web.archive.org/web/20010309040805/http://scipy.org:80/ (2001).
22.Vaught, T. N. SciPy Developer mailing list now online, https://mail.python.org/pipermail/scipy-dev/2001-June/000000.html (2001).
23.Jones, E. ANN: SciPy 0.10–scientific computing with Python, https://mail.python.org/pipermail/python-list/2001-August/106419.html (2001).
24.Vaught, T.N. Reference documentation and Tutorial documentation are now available for download as tarballs. Web Archivehttps://web.archive.org/web/20021013204556/http://www.scipy.org:80/scipy/site_content/site_news/docs_released1 (2002).
25.Vaught, T. N. [ANN] SciPy ‘02 - Python for Scientific Computing Workshop, https://mail.python.org/pipermail/numpy-discussion/2002-June/001511.html (2002).
26.Ascher, D., Dubois, P. F., Hinsen, K., Hugunin, J. & Oliphant, T. E. An open source project: Numerical Python, 10.5281/zenodo.3599566 (2001).
27.Greenfield, P. How Python slithered Into astronomy. Presentation, https://conference.scipy.org/scipy2011/slides/greenfield_keynote_astronomy.pdf (2011).
28.Greenfield, P., Miller, J.T., Hsu, J.T. & White, R.L. numarray: a new scientific array package for Python. PyCon DC (2003).
29.NumPy Developers. v1.0, https://github.com/numpy/numpy/releases/tag/v1.0 (25 October 2006).
30.Millman, K. J. & Pérez, F. Developing open-source scientific practice. in Implementing Reproducible Research (CRC Press) 149–183 (2014).
31.Brandl, G. & the Sphinx team. Sphinx - Python Documentation Generator, http://www.sphinx-doc.org/en/master/ (2007).
32.Virtanen, P. et al. pydocweb: a tool for collaboratively documenting Python modules via the web. Web Archive, https://code.google.com/archive/p/pydocweb/ (2008).
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).
35.Harrington, J. & Goldsmith, D. Progress report: NumPy and SciPy documentation in 2009. In Proceedings of the 8th Python in Science Conference (eds Varoquaux, G., van der Walt, S. & Millman, K. J.) 84–87 (2009).
36.Pérez, F., Langtangen, H. P. & LeVeque, R. Python for scientific computing. In SIAM Conference on Computational Science and Engineering,42 (5) (2009).
37.Dubois PF. Python: batteries included. Comput. Sci. Eng. 2007;9:7–9. [Google Scholar]
38.Millman KJ, Aivazis M. Python for scientists and engineers. Comput. Sci. Eng. 2011;13:9–12. [Google Scholar]
39.Pérez F, Granger BE, Hunter JD. Python: an ecosystem for scientific computing. Comput. Sci. Eng. 2011;13:13–21. [Google Scholar]
40.Behnel S, et al. Cython: the best of both worlds. Comput. Sci. Eng. 2011;13:31–39. [Google Scholar]
41.Ramachandran P, Varoquaux G. Mayavi: 3D visualization of scientific data. Comput. Sci. Eng. 2011;13:40–51. [Google Scholar]
42.Muller E, et al. Python in neuroscience. Front. Neuroinform. 2015;9:11. doi: 10.3389/fninf.2015.00011. [DOI] [PMC free article] [PubMed] [Google Scholar]
43.GitHub. Network dependents - scipy/scipy, https://github.com/scipy/scipy/network/dependents (2019).
44.Boisvert RF, Howe SE, Kahaner DK. The guide to available mathematical software problem classification system. Commun. Stat. Simul. Comput. 1991;20:811–842. [Google Scholar]
45.Seabold, S. & Perktold, J. Statsmodels: econometric and statistical modeling with Python. In Proceedings of the 9th Python in Science Conference 57–61 (2010).
46.Salvatier J, Wiecki TV, Fonnesbeck C. Probabilistic programming in Python using PyMC3. PeerJ Comput. Sci. 2016;2:e55. doi: 10.7717/peerj-cs.1516. [DOI] [PMC free article] [PubMed] [Google Scholar]
47.Foreman-Mackey D, Hogg DW, Lang D, Goodman J. emcee: the MCMC hammer. Publ. Astron. Soc. Pac. 2013;125:306–312. [Google Scholar]
48.Meurer A, et al. SymPy: symbolic computing in Python. PeerJ Comput. Sci. 2017;3:e103. [Google Scholar]
49.Hagberg, A. A., Schult, D. A. & Swart, P. J. Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference. (eds G. Varoquaux, G., Vaught, T. & Millman, K. J.) 11–15 (2008).
50.Koelbel, C.H. & Zosel, M.E. The High Performance FORTRAN Handbook (MIT Press, 1993).
51.Piessens, R., de Doncker-Kapenga, E., Uberhuber, C.W. & Kahaner, D.K. QUADPACK: A Subroutine Package for Automatic Integration (Springer, 1983).
52.Hindmarsh, A.C. ODEPACK, a systematized collection of ODE solvers. Scientific Computing 55–64 (1983).
53.Dierckx, P. Curve and Surface Fitting with Splines (Oxford Univ. Press, 1993).
54.Boggs, P.T., Byrd, R.H., Rogers, J.E. & Schnabel, R.B. User’s Reference Guide for ODRPACK Version 2.01: Software for Weight Orthogonal Distance Regression (U.S. Department of Commerce, National Institute of Standards and Technology, 1992).
55.Moré. Jorge J., Garbow, B. S. & Hillstrom, K. E. User guide for MINPACK-1. Report ANL-80–74 (Argonne National Laboratory, 1980).
56.Swarztrauber, P. N. Vectorizing the FFTs. In Parallel Computations (ed. Rodrigue, G.) 51–83 (Academic, 1982).
57.Swarztrauber PN. FFT algorithms for vector computers. Parallel Comput. 1984;1:45–63. [Google Scholar]
58.Lehoucq, R.B., Sorensen, D.C. & Yang, C. ARPACK users’ guide: solution of large scale eigenvalue problems with implicitly restarted Arnoldi methods. (Rice University, 1997).
59.Amos DE. Algorithm 644: A portable package for Bessel functions of a complex argument and nonnegative order. ACM Trans. Math. Softw. 1986;12:265–273. [Google Scholar]
60.Brown, B., Lovato, J. & Russell, K. CDFLIB, https://people.sc.fsu.edu/~jburkardt/f_src/cdflib/cdflib.html (accessed 6 July 2018).
61.Kernighan, B. W. & Ritchie, D. M. The C Programming Language 2nd edn (Prentice Hall Professional Technical Reference, 1988).
62.Lenders F, Kirches C, Potschka A. trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem. Optim. Methods Softw. 2018;33:420–449. [Google Scholar]
63.Li, X.S. et al. SuperLU Users’ Guide. Report LBNL-44289 (Lawrence Berkeley National Laboratory, 1999).
64.Li XS. An overview of SuperLU: algorithms, implementation, and user interface. ACM Trans. Math. Softw. 2005;31:302–325. [Google Scholar]
65.Barber CB, Dobkin DP, Huhdanpaa H. The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 1996;22:469–483. [Google Scholar]
66.Lam, S. K., Pitrou, A. & Seibert, S. Numba: A LLVM-based Python JIT compiler. In Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC 7:1–7:6 (ACM, 2015).
67.Bolz, C. F., Cuni, A., Fijalkowski, M. & Rigo, A. Tracing the meta-level: PyPy’s tracing JIT compiler. In Proceedings of the 4th Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems 18–25 (ACM, 2009).
68.VanderPlas, J. Benchmarking nearest neighbor searches in Python, https://jakevdp.github.io/blog/2013/04/29/benchmarking-nearest-neighbor-searches-in-python/ (19 April 2013).
69.Maneewongvatana, S. & Mount, D. M. Analysis of approximate nearest neighbor searching with clustered point sets. Preprint at https://arxiv.org/pdf/cs/9901013.pdf (1999).
70.Molden, S. ENH: Enhancements to spatial.cKDTree, https://github.com/scipy/scipy/pull/4374/ (7 January 2015).
71.Aspnas, M., Signell, A. & Westerholm, J. Efficient assembly of sparse matrices using hashing. In Applied Parallel Computing. State of the Art in Scientific Computing (eds Kagstrom, B. et al.) 900–907 (Springer, 2007).
72.Cormen, T. H., Stein, C., Rivest, R. L. & Leiserson, C. E. Introduction to Algorithms 2nd edn (McGraw-Hill Higher Education, 2001).
73.Moore A. W. et al. Fast algorithms and efficient statistics: N-point correlation functions. In Mining the Sky. ESO Astrophysics Symposia (European Southern Observatory) (eds Banday, A. J., Zaroubi, S. & Bartelmann, M.) 71–82 (Springer, 2001).
74.Feng, Y. ENH: Faster count_neighour in cKDTree / + weighted input data https://github.com/scipy/scipy/pull/5647 (2015).
75.Martin AM, Giovanelli R, Haynes MP, Guzzo L. The clustering characteristics of HI-selected galaxies from the 40% ALFALFA survey. Astrophys. J. 2012;750:38. [Google Scholar]
76.Anderson, E. et al. LAPACK Users’ Guide 3rd edn (Society for Industrial and Applied Mathematics, 1999).
77.Henriksen, I. Circumventing the linker: using SciPy’s BLAS and LAPACK within Cython. In Proceedings of the 14th Python in Science Conference(SciPy 2015) (eds Huff, K. & Bergstra, J.) 49–52 (2015).
78.Andersen, E. D. & Andersen, K. D. (2000) The Mosek interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In High Performance Optimization 197–232 (Springer, 2000).
79.The NETLIB LP test problem set, http://www.numerical.rl.ac.uk/cute/netlib.html (2019).
80.Andersen ED, Andersen KD. Presolving in linear programming. Math. Program. 1995;71:221–245. [Google Scholar]
81.Wormington M, Panaccione C, Matney Kevin M, Bowen DK. Characterization of structures from X-ray scattering data using genetic algorithms. Philos. Trans. R. Soc. Lond. A. 1999;357:2827–2848. [Google Scholar]
82.Storn R, Price K. Differential evolution — a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997;11:341–359. [Google Scholar]
83.Griffiths TL, Steyvers M. Finding scientific topics. Proc. Natl Acad. Sci. USA. 2004;101(Suppl. 1):5228–5235. doi: 10.1073/pnas.0307752101. [DOI] [PMC free article] [PubMed] [Google Scholar]
84.Dierckx, P. Curve and Surface Fitting with Splines (Oxford Univ. Press, 1993).
85.Virtanen, P. ENH: interpolate: rewrite ppform evaluation in Cython, https://github.com/scipy/scipy/pull/2885 (2013).
86.Burovski, E. add b-splines, https://github.com/scipy/scipy/pull/3174 (27 December 2013).
87.de Boor, C. A Practical Guide to Splines (Springer, 1978).
88.Mayorov, N. ENH: CubicSpline interpolator, https://github.com/scipy/scipy/pull/5653 (2 January 2016).
89.Fritsch FN, Carlson RE. Monotone piecewise cubic interpolation. SIAM J. Numer. Anal. 1980;17:238–246. [Google Scholar]
90.Akima H. A new method of interpolation and smooth curve fitting based on local procedures. J. Assoc. Comput. Mach. 1970;17:589–602. [Google Scholar]
91.Beck, K. Test-driven Development: By Example (Addison-Wesley, 2003).
92.Silver A. Collaborative software development made easy. Nature. 2017;550:143–144. doi: 10.1038/550143a. [DOI] [PubMed] [Google Scholar]
93.Eghbal, N. Roads and Bridges: The Unseen Labor Behind Our Digital Infrastructure (Ford Foundation, 2016).
94.The Astropy Collaboration. et al. The Astropy Project: building an open-science project and status of the v2.0 core package. Astron. J. 2018;156:123. [Google Scholar]
95.Lev, O., Dufresne, J., Kasim, R., Skinn, B. & Wilk, J. pypinfo: view PyPI download statistics with ease, https://github.com/ofek/pypinfo (2018).
96.Abbott BP, et al. Observation of gravitational waves from a binary black hole merger. Phys. Rev. Lett. 2016;116:061102. doi: 10.1103/PhysRevLett.116.061102. [DOI] [PubMed] [Google Scholar]
97.David Liu. The Intel distribution for Python, https://software.intel.com/en-us/articles/intel-optimized-packages-for-the-intel-distribution-for-python (25 August 2017, updated 30 October 2017, accessed 25 July 2018).
98.Nelder JA, Mead R. A simplex method for function minimization. Comput. J. 1965;7:308–313. [Google Scholar]
99.Wright, M. H. Direct search methods: once scorned, now respectable. Pitman Research Notes in Mathematics Series 191–208 (1996).
100.Powell MJD. An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 1964;7:155–162. [Google Scholar]
101.Powell, M. J. D. A direct search optimization method that models the objective and constraint functions by linear interpolation. In Advances in Optimization and Numerical Analysis (eds Gomez, S. & Hennart, J. P.) 51–67 (Springer, 1994).
102.Powell MJD. Direct search algorithms for optimization calculations. Acta Numerica. 1998;7:287–336. [Google Scholar]
103.Powell MJD. A view of algorithms for optimization without derivatives. Math. Today Bull. Inst. Math. Appl. 2007;43:170–174. [Google Scholar]
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. [Google Scholar]
105.Nocedal, J. & Wright, S. Numerical Optimization 2nd edn (Springer Science & Business Media, 2006).
106.Byrd RH, Lu P, Nocedal J, Zhu C. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 1995;16:1190–1208. [Google Scholar]
107.Zhu C, Byrd RH, Lu P, Nocedal J. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 1997;23:550–560. [Google Scholar]
108.Schittkowski K. On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function. Mathematische Operationsforschung und Statistik. Ser. Optim. 1983;14:197–216. [Google Scholar]
109.Schittkowski K. The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. Part 2: an efficient implementation with linear least squares subproblems. Numer. Math. 1982;38:115–127. [Google Scholar]
110.Schittkowski K. The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. Part 1: convergence analysis. Numer. Math. 1982;38:83–114. [Google Scholar]
111.Kraft, D. A software package for sequential quadratic programming. Report DFVLR-FR 88–28 (Deutsche Forschungs- und Versuchsanstalt für Luft- und Raumfahrt, 1988).
112.Nash SG. Newton-type minimization via the Lanczos method. SIAM J. Numer. Anal. 1984;21:770–788. [Google Scholar]
113.Powell, M. J. D. A new algorithm for unconstrained optimization. Nonlinear Programming 31–65 (1970).
114.Steihaug T. The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 1983;20:626–637. [Google Scholar]
115.Conn, A.R., Gould, N.I.M. & Toint, P.L. Trust Region Methods (SIAM, 2000).
116.Moré JJ, Sorensen DC. Computing a trust region step. SIAM J. Sci.Statist. Comput. 1983;4:553–572. [Google Scholar]
117.Gould NIM, Lucidi S, Roma M, Toint PL. Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 1999;9:504–525. [Google Scholar]
118.Abbasi, H. Sparse: a more modern sparse array library. In Proceedings of the 17th Python in Science Conference (eds Akici, F. et al.) 27–30 (2018).
119.Mohr PJ, Newell DB, Taylor BN. CODATA recommended values of the fundamental physical constants: 2014. J. Phys. Chem. Ref. Data. 2016;45:043102. doi: 10.1063/5.0064853. [DOI] [PMC free article] [PubMed] [Google Scholar]
120.Boisvert, R. F., Pozo, R., Remington, K., Barrett, R. F. & Dongarra, J. J. Matrix Market: a web resource for test matrix collections. In Quality of Numerical Software 125–137 (Springer, 1997).
121.Rew R, Davis G. NetCDF: an interface for scientific data access. IEEE Comput. Graph. Appl. 1990;10:76–82. [Google Scholar]
122.Duff, I.S., Grimes, R.G. & Lewis, J.G. Users’ guide for the Harwell-Boeing sparse matrix collection (release I), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.8922 (1992).

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Reporting Summary^{(135.5KB, pdf)}

Data Availability Statement

All SciPy library source code is available in the SciPy GitHub repository, https://github.com/scipy/scipy.

[CR1] 1.Oliphant, T.E. Guide to NumPy 1st edn (Trelgol Publishing USA, 2006).

[CR2] 2.van der Walt S, Colbert SC, Varoquaux G. The NumPy array: a structure for efficient numerical computation. Comput. Sci. Eng. 2011;13:22–30. [Google Scholar]

[CR3] 3.Pedregosa F, et al. Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 2011;12:2825–2830. [Google Scholar]

[CR4] 4.van der Walt S, et al. scikit-image: image processing in Python. Peer J. 2014;2:e453. doi: 10.7717/peerj.453. [DOI] [PMC free article] [PubMed] [Google Scholar]

[CR5] 5.Nitz, A. et al. gwastro/pycbc: PyCBC v1.13.2 release, 10.5281/zenodo.1596771 (27 November 2018).

[CR6] 6.Vallisneri M, Kanner J, Williams R, Weinstein A, Stephens B. The LIGO Open Science Center. J. Phys. Conf. Ser. 2015;610:012021. [Google Scholar]

[CR7] 7.Abbott BP, et al. GW150914: First results from the search for binary black hole coalescence with Advanced LIGO. Phys. Rev. D. 2016;93:122003. doi: 10.1103/PhysRevD.93.122003. [DOI] [PMC free article] [PubMed] [Google Scholar]

[CR8] 8.Abbott BP, et al. GW170817: observation of gravitational waves from a binary neutron star inspiral. Phys. Rev. Lett. 2017;119:161101. doi: 10.1103/PhysRevLett.119.161101. [DOI] [PubMed] [Google Scholar]

[CR9] 9.The Event Horizon Telescope Collaboration. et al. First M87 event horizon telescope results. III. Data processing and calibration. Astrophys. J. Lett. 2019;875:L3. [Google Scholar]

[CR10] 10.Blanton, K. At Mathworks, support + fun = success: CEO Jack Little believes in power of his workers–and their ideas. The Boston Globe, J5 (20 April 1997).

[CR11] 11.Howell, D. Jack Dangermond’s digital mapping lays it all out. Investor’s Business Daily (14 August 2009).

[CR12] 12.Port, O. Simple solutions. BusinessWeek, 24–24 (3 October 2005).

[CR13] 13.van Rossum, G. Python/C API Reference Manual, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.211.6702&rep=rep1&type=pdf (2001).

[CR14] 14.Hugunin, J. The matrix object proposal (very long), https://mail.python.org/pipermail/matrix-sig/1995-August/000002.html (18 August 1995).

[CR15] 15.Hugunin, J. Extending Python for numerical computation, http://hugunin.net/papers/hugunin95numpy.html (1995).

[CR16] 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).

[CR17] 17.Oliphant, T. E. Some Python modules. Web Archive, https://web.archive.org/web/19990125091242/http://oliphant.netpedia.net:80/ (25 January 1999).

[CR18] 18.Oliphant, T. E. Modules to enhance Numerical Python. Web Archive, https://web.archive.org/web/20001206213500/http://oliphant.netpedia.net:80/ (6 December 2000).

[CR19] 19.Peterson P. F2PY: a tool for connecting Fortran and Python programs. Int. J. Comput. Sci. Eng. 2009;4:296–305. [Google Scholar]

[CR20] 20.Strangman, G. Python modules. Web Archive, https://web.archive.org/web/20001022231108/http://www.nmr.mgh.harvard.edu/Neural_Systems_Group/gary/python.html (2000).

[CR21] 21.SciPy Developers. SciPy.org. Web Archive, https://web.archive.org/web/20010309040805/http://scipy.org:80/ (2001).

[CR22] 22.Vaught, T. N. SciPy Developer mailing list now online, https://mail.python.org/pipermail/scipy-dev/2001-June/000000.html (2001).

[CR23] 23.Jones, E. ANN: SciPy 0.10–scientific computing with Python, https://mail.python.org/pipermail/python-list/2001-August/106419.html (2001).

[CR24] 24.Vaught, T.N. Reference documentation and Tutorial documentation are now available for download as tarballs. Web Archivehttps://web.archive.org/web/20021013204556/http://www.scipy.org:80/scipy/site_content/site_news/docs_released1 (2002).

[CR25] 25.Vaught, T. N. [ANN] SciPy ‘02 - Python for Scientific Computing Workshop, https://mail.python.org/pipermail/numpy-discussion/2002-June/001511.html (2002).

[CR26] 26.Ascher, D., Dubois, P. F., Hinsen, K., Hugunin, J. & Oliphant, T. E. An open source project: Numerical Python, 10.5281/zenodo.3599566 (2001).

[CR27] 27.Greenfield, P. How Python slithered Into astronomy. Presentation, https://conference.scipy.org/scipy2011/slides/greenfield_keynote_astronomy.pdf (2011).

[CR28] 28.Greenfield, P., Miller, J.T., Hsu, J.T. & White, R.L. numarray: a new scientific array package for Python. PyCon DC (2003).

[CR29] 29.NumPy Developers. v1.0, https://github.com/numpy/numpy/releases/tag/v1.0 (25 October 2006).

[CR30] 30.Millman, K. J. & Pérez, F. Developing open-source scientific practice. in Implementing Reproducible Research (CRC Press) 149–183 (2014).

[CR31] 31.Brandl, G. & the Sphinx team. Sphinx - Python Documentation Generator, http://www.sphinx-doc.org/en/master/ (2007).

[CR32] 32.Virtanen, P. et al. pydocweb: a tool for collaboratively documenting Python modules via the web. Web Archive, https://code.google.com/archive/p/pydocweb/ (2008).

[CR33] 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).

[CR34] 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).

[CR35] 35.Harrington, J. & Goldsmith, D. Progress report: NumPy and SciPy documentation in 2009. In Proceedings of the 8th Python in Science Conference (eds Varoquaux, G., van der Walt, S. & Millman, K. J.) 84–87 (2009).

[CR36] 36.Pérez, F., Langtangen, H. P. & LeVeque, R. Python for scientific computing. In SIAM Conference on Computational Science and Engineering,42 (5) (2009).

[CR37] 37.Dubois PF. Python: batteries included. Comput. Sci. Eng. 2007;9:7–9. [Google Scholar]

[CR38] 38.Millman KJ, Aivazis M. Python for scientists and engineers. Comput. Sci. Eng. 2011;13:9–12. [Google Scholar]

[CR39] 39.Pérez F, Granger BE, Hunter JD. Python: an ecosystem for scientific computing. Comput. Sci. Eng. 2011;13:13–21. [Google Scholar]

[CR40] 40.Behnel S, et al. Cython: the best of both worlds. Comput. Sci. Eng. 2011;13:31–39. [Google Scholar]

[CR41] 41.Ramachandran P, Varoquaux G. Mayavi: 3D visualization of scientific data. Comput. Sci. Eng. 2011;13:40–51. [Google Scholar]

[CR42] 42.Muller E, et al. Python in neuroscience. Front. Neuroinform. 2015;9:11. doi: 10.3389/fninf.2015.00011. [DOI] [PMC free article] [PubMed] [Google Scholar]

[CR43] 43.GitHub. Network dependents - scipy/scipy, https://github.com/scipy/scipy/network/dependents (2019).

[CR44] 44.Boisvert RF, Howe SE, Kahaner DK. The guide to available mathematical software problem classification system. Commun. Stat. Simul. Comput. 1991;20:811–842. [Google Scholar]

[CR45] 45.Seabold, S. & Perktold, J. Statsmodels: econometric and statistical modeling with Python. In Proceedings of the 9th Python in Science Conference 57–61 (2010).

[CR46] 46.Salvatier J, Wiecki TV, Fonnesbeck C. Probabilistic programming in Python using PyMC3. PeerJ Comput. Sci. 2016;2:e55. doi: 10.7717/peerj-cs.1516. [DOI] [PMC free article] [PubMed] [Google Scholar]

[CR47] 47.Foreman-Mackey D, Hogg DW, Lang D, Goodman J. emcee: the MCMC hammer. Publ. Astron. Soc. Pac. 2013;125:306–312. [Google Scholar]

[CR48] 48.Meurer A, et al. SymPy: symbolic computing in Python. PeerJ Comput. Sci. 2017;3:e103. [Google Scholar]

[CR49] 49.Hagberg, A. A., Schult, D. A. & Swart, P. J. Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference. (eds G. Varoquaux, G., Vaught, T. & Millman, K. J.) 11–15 (2008).

[CR50] 50.Koelbel, C.H. & Zosel, M.E. The High Performance FORTRAN Handbook (MIT Press, 1993).

[CR51] 51.Piessens, R., de Doncker-Kapenga, E., Uberhuber, C.W. & Kahaner, D.K. QUADPACK: A Subroutine Package for Automatic Integration (Springer, 1983).

[CR52] 52.Hindmarsh, A.C. ODEPACK, a systematized collection of ODE solvers. Scientific Computing 55–64 (1983).

[CR53] 53.Dierckx, P. Curve and Surface Fitting with Splines (Oxford Univ. Press, 1993).

[CR54] 54.Boggs, P.T., Byrd, R.H., Rogers, J.E. & Schnabel, R.B. User’s Reference Guide for ODRPACK Version 2.01: Software for Weight Orthogonal Distance Regression (U.S. Department of Commerce, National Institute of Standards and Technology, 1992).

[CR55] 55.Moré. Jorge J., Garbow, B. S. & Hillstrom, K. E. User guide for MINPACK-1. Report ANL-80–74 (Argonne National Laboratory, 1980).

[CR56] 56.Swarztrauber, P. N. Vectorizing the FFTs. In Parallel Computations (ed. Rodrigue, G.) 51–83 (Academic, 1982).

[CR57] 57.Swarztrauber PN. FFT algorithms for vector computers. Parallel Comput. 1984;1:45–63. [Google Scholar]

[CR58] 58.Lehoucq, R.B., Sorensen, D.C. & Yang, C. ARPACK users’ guide: solution of large scale eigenvalue problems with implicitly restarted Arnoldi methods. (Rice University, 1997).

[CR59] 59.Amos DE. Algorithm 644: A portable package for Bessel functions of a complex argument and nonnegative order. ACM Trans. Math. Softw. 1986;12:265–273. [Google Scholar]

[CR60] 60.Brown, B., Lovato, J. & Russell, K. CDFLIB, https://people.sc.fsu.edu/~jburkardt/f_src/cdflib/cdflib.html (accessed 6 July 2018).

[CR61] 61.Kernighan, B. W. & Ritchie, D. M. The C Programming Language 2nd edn (Prentice Hall Professional Technical Reference, 1988).

[CR62] 62.Lenders F, Kirches C, Potschka A. trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem. Optim. Methods Softw. 2018;33:420–449. [Google Scholar]

[CR63] 63.Li, X.S. et al. SuperLU Users’ Guide. Report LBNL-44289 (Lawrence Berkeley National Laboratory, 1999).

[CR64] 64.Li XS. An overview of SuperLU: algorithms, implementation, and user interface. ACM Trans. Math. Softw. 2005;31:302–325. [Google Scholar]

[CR65] 65.Barber CB, Dobkin DP, Huhdanpaa H. The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 1996;22:469–483. [Google Scholar]

[CR66] 66.Lam, S. K., Pitrou, A. & Seibert, S. Numba: A LLVM-based Python JIT compiler. In Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC 7:1–7:6 (ACM, 2015).

[CR67] 67.Bolz, C. F., Cuni, A., Fijalkowski, M. & Rigo, A. Tracing the meta-level: PyPy’s tracing JIT compiler. In Proceedings of the 4th Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems 18–25 (ACM, 2009).

[CR68] 68.VanderPlas, J. Benchmarking nearest neighbor searches in Python, https://jakevdp.github.io/blog/2013/04/29/benchmarking-nearest-neighbor-searches-in-python/ (19 April 2013).

[CR69] 69.Maneewongvatana, S. & Mount, D. M. Analysis of approximate nearest neighbor searching with clustered point sets. Preprint at https://arxiv.org/pdf/cs/9901013.pdf (1999).

[CR70] 70.Molden, S. ENH: Enhancements to spatial.cKDTree, https://github.com/scipy/scipy/pull/4374/ (7 January 2015).

[CR71] 71.Aspnas, M., Signell, A. & Westerholm, J. Efficient assembly of sparse matrices using hashing. In Applied Parallel Computing. State of the Art in Scientific Computing (eds Kagstrom, B. et al.) 900–907 (Springer, 2007).

[CR72] 72.Cormen, T. H., Stein, C., Rivest, R. L. & Leiserson, C. E. Introduction to Algorithms 2nd edn (McGraw-Hill Higher Education, 2001).

[CR73] 73.Moore A. W. et al. Fast algorithms and efficient statistics: N-point correlation functions. In Mining the Sky. ESO Astrophysics Symposia (European Southern Observatory) (eds Banday, A. J., Zaroubi, S. & Bartelmann, M.) 71–82 (Springer, 2001).

[CR74] 74.Feng, Y. ENH: Faster count_neighour in cKDTree / + weighted input data https://github.com/scipy/scipy/pull/5647 (2015).

[CR75] 75.Martin AM, Giovanelli R, Haynes MP, Guzzo L. The clustering characteristics of HI-selected galaxies from the 40% ALFALFA survey. Astrophys. J. 2012;750:38. [Google Scholar]

[CR76] 76.Anderson, E. et al. LAPACK Users’ Guide 3rd edn (Society for Industrial and Applied Mathematics, 1999).

[CR77] 77.Henriksen, I. Circumventing the linker: using SciPy’s BLAS and LAPACK within Cython. In Proceedings of the 14th Python in Science Conference(SciPy 2015) (eds Huff, K. & Bergstra, J.) 49–52 (2015).

[CR78] 78.Andersen, E. D. & Andersen, K. D. (2000) The Mosek interior point optimizer for linear programming: an implementation of the homogeneous algorithm. In High Performance Optimization 197–232 (Springer, 2000).

[CR79] 79.The NETLIB LP test problem set, http://www.numerical.rl.ac.uk/cute/netlib.html (2019).

[CR80] 80.Andersen ED, Andersen KD. Presolving in linear programming. Math. Program. 1995;71:221–245. [Google Scholar]

[CR81] 81.Wormington M, Panaccione C, Matney Kevin M, Bowen DK. Characterization of structures from X-ray scattering data using genetic algorithms. Philos. Trans. R. Soc. Lond. A. 1999;357:2827–2848. [Google Scholar]

[CR82] 82.Storn R, Price K. Differential evolution — a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997;11:341–359. [Google Scholar]

[CR83] 83.Griffiths TL, Steyvers M. Finding scientific topics. Proc. Natl Acad. Sci. USA. 2004;101(Suppl. 1):5228–5235. doi: 10.1073/pnas.0307752101. [DOI] [PMC free article] [PubMed] [Google Scholar]

[CR84] 84.Dierckx, P. Curve and Surface Fitting with Splines (Oxford Univ. Press, 1993).

[CR85] 85.Virtanen, P. ENH: interpolate: rewrite ppform evaluation in Cython, https://github.com/scipy/scipy/pull/2885 (2013).

[CR86] 86.Burovski, E. add b-splines, https://github.com/scipy/scipy/pull/3174 (27 December 2013).

[CR87] 87.de Boor, C. A Practical Guide to Splines (Springer, 1978).

[CR88] 88.Mayorov, N. ENH: CubicSpline interpolator, https://github.com/scipy/scipy/pull/5653 (2 January 2016).

[CR89] 89.Fritsch FN, Carlson RE. Monotone piecewise cubic interpolation. SIAM J. Numer. Anal. 1980;17:238–246. [Google Scholar]

[CR90] 90.Akima H. A new method of interpolation and smooth curve fitting based on local procedures. J. Assoc. Comput. Mach. 1970;17:589–602. [Google Scholar]

[CR91] 91.Beck, K. Test-driven Development: By Example (Addison-Wesley, 2003).

[CR92] 92.Silver A. Collaborative software development made easy. Nature. 2017;550:143–144. doi: 10.1038/550143a. [DOI] [PubMed] [Google Scholar]

[CR93] 93.Eghbal, N. Roads and Bridges: The Unseen Labor Behind Our Digital Infrastructure (Ford Foundation, 2016).

[CR94] 94.The Astropy Collaboration. et al. The Astropy Project: building an open-science project and status of the v2.0 core package. Astron. J. 2018;156:123. [Google Scholar]

[CR95] 95.Lev, O., Dufresne, J., Kasim, R., Skinn, B. & Wilk, J. pypinfo: view PyPI download statistics with ease, https://github.com/ofek/pypinfo (2018).

[CR96] 96.Abbott BP, et al. Observation of gravitational waves from a binary black hole merger. Phys. Rev. Lett. 2016;116:061102. doi: 10.1103/PhysRevLett.116.061102. [DOI] [PubMed] [Google Scholar]

[CR97] 97.David Liu. The Intel distribution for Python, https://software.intel.com/en-us/articles/intel-optimized-packages-for-the-intel-distribution-for-python (25 August 2017, updated 30 October 2017, accessed 25 July 2018).

[CR98] 98.Nelder JA, Mead R. A simplex method for function minimization. Comput. J. 1965;7:308–313. [Google Scholar]

[CR99] 99.Wright, M. H. Direct search methods: once scorned, now respectable. Pitman Research Notes in Mathematics Series 191–208 (1996).

[CR100] 100.Powell MJD. An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 1964;7:155–162. [Google Scholar]

[CR101] 101.Powell, M. J. D. A direct search optimization method that models the objective and constraint functions by linear interpolation. In Advances in Optimization and Numerical Analysis (eds Gomez, S. & Hennart, J. P.) 51–67 (Springer, 1994).

[CR102] 102.Powell MJD. Direct search algorithms for optimization calculations. Acta Numerica. 1998;7:287–336. [Google Scholar]

[CR103] 103.Powell MJD. A view of algorithms for optimization without derivatives. Math. Today Bull. Inst. Math. Appl. 2007;43:170–174. [Google Scholar]

[CR104] 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. [Google Scholar]

[CR105] 105.Nocedal, J. & Wright, S. Numerical Optimization 2nd edn (Springer Science & Business Media, 2006).

[CR106] 106.Byrd RH, Lu P, Nocedal J, Zhu C. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 1995;16:1190–1208. [Google Scholar]

[CR107] 107.Zhu C, Byrd RH, Lu P, Nocedal J. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 1997;23:550–560. [Google Scholar]

[CR108] 108.Schittkowski K. On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function. Mathematische Operationsforschung und Statistik. Ser. Optim. 1983;14:197–216. [Google Scholar]

[CR109] 109.Schittkowski K. The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. Part 2: an efficient implementation with linear least squares subproblems. Numer. Math. 1982;38:115–127. [Google Scholar]

[CR110] 110.Schittkowski K. The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. Part 1: convergence analysis. Numer. Math. 1982;38:83–114. [Google Scholar]

[CR111] 111.Kraft, D. A software package for sequential quadratic programming. Report DFVLR-FR 88–28 (Deutsche Forschungs- und Versuchsanstalt für Luft- und Raumfahrt, 1988).

[CR112] 112.Nash SG. Newton-type minimization via the Lanczos method. SIAM J. Numer. Anal. 1984;21:770–788. [Google Scholar]

[CR113] 113.Powell, M. J. D. A new algorithm for unconstrained optimization. Nonlinear Programming 31–65 (1970).

[CR114] 114.Steihaug T. The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 1983;20:626–637. [Google Scholar]

[CR115] 115.Conn, A.R., Gould, N.I.M. & Toint, P.L. Trust Region Methods (SIAM, 2000).

[CR116] 116.Moré JJ, Sorensen DC. Computing a trust region step. SIAM J. Sci.Statist. Comput. 1983;4:553–572. [Google Scholar]

[CR117] 117.Gould NIM, Lucidi S, Roma M, Toint PL. Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 1999;9:504–525. [Google Scholar]

[CR118] 118.Abbasi, H. Sparse: a more modern sparse array library. In Proceedings of the 17th Python in Science Conference (eds Akici, F. et al.) 27–30 (2018).

[CR119] 119.Mohr PJ, Newell DB, Taylor BN. CODATA recommended values of the fundamental physical constants: 2014. J. Phys. Chem. Ref. Data. 2016;45:043102. doi: 10.1063/5.0064853. [DOI] [PMC free article] [PubMed] [Google Scholar]

[CR120] 120.Boisvert, R. F., Pozo, R., Remington, K., Barrett, R. F. & Dongarra, J. J. Matrix Market: a web resource for test matrix collections. In Quality of Numerical Software 125–137 (Springer, 1997).

[CR121] 121.Rew R, Davis G. NetCDF: an interface for scientific data access. IEEE Comput. Graph. Appl. 1990;10:76–82. [Google Scholar]

[CR122] 122.Duff, I.S., Grimes, R.G. & Lewis, J.G. Users’ guide for the Harwell-Boeing sparse matrix collection (release I), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.8922 (1992).

PERMALINK

SciPy 1.0: fundamental algorithms for scientific computing in Python

Pauli Virtanen

Ralf Gommers

Travis E Oliphant

Matt Haberland

Tyler Reddy

David Cournapeau

Evgeni Burovski

Pearu Peterson

Warren Weckesser

Jonathan Bright

Stéfan J van der Walt

Matthew Brett

Joshua Wilson

K Jarrod Millman

Nikolay Mayorov

Andrew R J Nelson

Eric Jones

Robert Kern

Eric Larson

C J Carey

İlhan Polat

Yu Feng

Eric W Moore

Jake VanderPlas

Denis Laxalde

Josef Perktold

Robert Cimrman

Ian Henriksen

E A Quintero

Charles R Harris

Anne M Archibald

Antônio H Ribeiro

Fabian Pedregosa

Paul van Mulbregt

Abstract

Main

Background

SciPy begins

SciPy matures

SciPy today

Fig. 1. Major milestones from SciPy’s initial release in 2001 to the release of SciPy 1.0 in 2017.

Box 1 Excerpt from the SciPy 0.1 release announcement (typos corrected), posted 20 August 2001 on the Python-list mailing list.

Box 2 Package organization.

Architecture and implementation choices

Project scope

Language choices

API and ABI evolution

Key technical improvements

Data structures

Sparse matrices

cKDTree

Unified bindings to compiled code

LowLevelCallable

Cython bindings for BLAS, LAPACK and special

Numerical optimization

Linear optimization

Nonlinear optimization: local minimization

Table 1.

Nonlinear optimization: global minimization

Statistical distributions

Polynomial interpolators

Test and benchmark suite

Test suite

Fig. 2.

Benchmark suite

Fig. 3. Results of the scipy.spatial.cKDTree.query benchmark from the introduction of cKDTree to the release of SciPy 1.0.

Project organization and community

Governance

Maintainers and contributors

Funding

Downstream projects

Discussion

Table 2.

Reporting Summary

Supplementary information

Acknowledgements

Author contributions

Data availability