Geen omschrijving

Valerio Maggio 93d2fc1a22 Updated README 6 jaren geleden
images 36c5fff526 added notebook checkpoints to ignore 6 jaren geleden
.gitignore 36c5fff526 added notebook checkpoints to ignore 6 jaren geleden
00_tutorial_intro.ipynb dfea57b256 fixed typos 6 jaren geleden
01_numpy_basics.ipynb 14877aba42 Numpy Basics 6 jaren geleden
02_numpy_indexing.ipynb 3c53f2ed8d Indexing and Slicing 6 jaren geleden
LICENSE 78acf3e93e Initial commit 10 jaren geleden
README.md 93d2fc1a22 Updated README 6 jaren geleden
requirements.txt 3276b230a9 Updated REquiemrens 6 jaren geleden

README.md

Never get in battle of bits without ammunitions

Title Credits: Gentle reference to homonymous talk presented at EuroPython 2013 in Florence by my friend riko (a.k.a. Enrico Franchi ).

Abstract

The numpy package takes a central role in Python scientific ecosystem. This is mainly because numpy code has been designed with high performance in mind.

This tutorial will provide materials for the most essential concepts to become confident with numpy and ndarray in (a matter of) 90 mins.

Outline

11:00 - 11:30 (30 mins) Numpy Basics

  • Introduction to NumPy Arrays
    • numpy internals schematics
    • Reshaping and Resizing
  • Numerical Data Types
    • Record Array

11:30 - 12:00 (30 mins) Indexing and Slicing

  • Indexing numpy arrays

    • fancy indexing
    • memory management
    • broadcasting
  • Slicing & Stacking

  • Vectorization

12:00 - 12:20 (20 mins) Bits of Data Science with NumPy

  • Serialisation & I/O
    • .mat files
  • Array and Matrix
    • Matlab compatibility
  • Memmap
  • Beyond Numpy

Python version

The minimum recommended version of Python to use for this tutorial is Python 3.5, although Python 2.7 should be fine, as well as previous versions of Python 3.

Py3.5+ is recommended due to a reference to the @ operator in the linear algebra notebook.

License and Sharing Material

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.