CompSciFall2014

From Predictive Chemistry
Revision as of 13:51, 2 October 2014 by David M. Rogers (talk | contribs)

Jump to: navigation, search

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, Oct. 17, 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
  • Assignments:
    • Weekly Homework (60%)
    • Midterm Project (20%)
      • Topic by Friday, Sept. 19
      • due Friday, Oct. 17, 2014
    • Final Project (20%)
      • Topic by Friday, Nov. 14
      • due Friday, Dec. 5, 2014

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

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
  • Local PyBulls Meetings

Interactive Interpreters:

  • CodeWars Recommended for building experience with practice problems.
  • Exercism A command-line client with a similar learn-through-challenge philosophy.
  • repl.it A read-eval-print loop for several computer languages.
  • [1] Documentation with an online evaluator for C++ code.

Topics

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

Notes & Homework