CompSciFall2014

Introduction to Scientific Computing

Course Info
 * Course Numbers CHM 4932/6938, CRN: 94314
 * Credit Hours: 3
 * Meeting Dates: Aug. 25 - Dec. 3, 2014
 * No Class Sept. 1 and Nov. 28
 * Meeting Times: Mon. and Wed., 12:30-13:45 in SCA 222
 * Lab Session & Office Hours: Fri. 12:30-13:45 in SCA 222

Overview
Mathematical models in the natural sciences take many shapes and forms. The moment they become more complicated than tracking a few variables over time, we have to put away our Excel spreadsheets and make use of a solid foundation in computational science. The course establishes this foundation by introducing data structures and algorithms used in everyday scientific computing using examples in the python scripting language. By the end of the Semester, students will be able to navigate the Linux command-line to go from a mathematical model to a numerical solution. Best practices for working with computer code and visualizing data will also be covered.

Textbooks

 * Beginning Python, Hetland, 2005 (eBook avail. from USF Library)
 * Python Algorithms, Hetland, 2010 (eBook avail. from USF Library)
 * The Architecture of Open Source Applications

Other (possibly useful) materials:
 * Chapters 7&8 of Modelling and Simulation, Birta and Arbez, Springer 2007 (eBook avail. from USF Library).
 * Chapters 4-6 of Models and Algorithms for Intelligent Data Analysis, Runkler, Springer 2012 (eBook avail. from USF Library).
 * Guide to Scientific Computing in C++, Francis and Whiteley, Springer, 2012. (eBook avail. from USF Library)
 * Extra info. On the basics:
 * Chapters 3 and 7 of Mathematics in Computing, Regan, Springer 2013. (eBook avail. from USF Library)
 * Instant feedback graphical programming with Khan Academy

Topics

 * 1) Languages
 * 2) * bash (shell)
 * 3) * python (scripting)
 * 4) * stack & register-based machine languages: overview of C and Fortran syntax & compiling with gcc, ‘thread safety’
 * 5) * Shared libraries & language inter-operability (FFI)
 * 6) Algorithms
 * 7) * Horner’s algorithm for polynomials
 * 8) * Newton’s root finding algo.
 * 9) * Overview of general optimization algo-s (example: linear & nonlin. least-squares)
 * 10) * Numerical integration (scripted, plus gnu ODE)
 * 11) * Communication (how HTTP get/put works)
 * 12) Data Structures
 * 13) * Linked Lists
 * 14) * Trees (file system hierarchies)
 * 15) * Graphs
 * 16) * Arrays (dense & sparse) example: vectors & rotations / transpositions, densities and difference operators
 * 17) Presentation & visualization
 * 18) * Flat CSV files (and excel)
 * 19) * Working with binary data
 * 20) * Python matplotlib (2D images)
 * 21) * Binning histograms & weighted averages
 * 22) Best Practices
 * 23) * High-level code design (modularity, interface specifications, unit testing, etc.)
 * 24) * Code audit: open-source libraries, ex. Gnu Scientific Library, qsort in libc, Boost
 * 25) * Source code versioning (example: git or mercurial)
 * 26) * gdb & execution profiling
 * 27) * documentation
 * 28) * Makefiles

Notes & Homework

 * CompSciWeek1