Difference between revisions of "Isc3313 syllabus"

(Created page with "{{DISPLAYTITLE:<span style="display: none">{{FULLPAGENAME}}</span>}} InstructorPeter Beerli Associate professor Department of Scientific Computing Office: 150-T Dirac Scien...")
 
Line 1: Line 1:
 
{{DISPLAYTITLE:<span style="display: none">{{FULLPAGENAME}}</span>}}
 
{{DISPLAYTITLE:<span style="display: none">{{FULLPAGENAME}}</span>}}
 
   
 
   
InstructorPeter Beerli
+
=Instructor=
Associate professor
+
Peter Beerli<br>
Department of Scientific Computing
+
Associate professor<br>
 +
Department of Scientific Computing<br>
  
Office: 150-T Dirac Science Library
+
Office: 150-T Dirac Science Library<br>
Phone: (850) 645 1324
+
Phone: (850) 645 1324<br>
Email: beerli at fsu dot edu
+
Email: beerli at fsu dot edu<br>
Web: http://people.scs.fsu.edu/~beerli
+
Web: http://people.scs.fsu.edu/~beerli<br>
Web: http://www.peterbeerli.com
+
Web: http://www.peterbeerli.com<br>
  
Class hours: Monday, Wednesday, Friday 9:05-9:55 in DSL 152.
+
Class hours: Monday, Wednesday, Friday 9:05-9:55 in DSL 152.<br>
Office hours: 2:00-3:00 Monday, 2:00-3:00 Friday (this is tentativ). You are welcome to talk to me at any other times, but I may not have always time to answer in depths.
+
Office hours: Not set yet. You are welcome to talk to me at any other times, but I may not have always time to answer in depths.
  
 
Teaching assistant: Cameron Berkley
 
Teaching assistant: Cameron Berkley
Line 20: Line 21:
  
 
=Content=
 
=Content=
I.Components of Scientific Computing
+
I.Components of Scientific Computing<br>
  
II.A simple example - Using a Monte Carlo approach to approximate problems
+
II.A simple example - Using a Monte Carlo approach to approximate problems<br>
1.UNIX basics
+
1.UNIX basics<br>
2.Netbeans IDE: an integrated development environment for Java programming
+
2.Netbeans IDE: an integrated development environment for C++ programming<br>
3.Introduction to Java
+
3.Introduction to C++<br>
4.Algorithm development
+
4.Algorithm development<br>
5.Program testing and documentation
+
5.Program testing and documentation<br>
6.Visualization and analysis of results
+
6.Visualization and analysis of results<br>
  
III. Solving a non-linear equations
+
III. Solving a non-linear equations<br>
1.Description of problem and some simple algorithms
+
1.Description of problem and some simple algorithms<br>
2.Iterative methods, required accuracy of result
+
2.Iterative methods, required accuracy of result<br>
3.Implementation of the Bisection method
+
3.Implementation of the Bisection method<br>
4.Program testing and documentation
+
4.Program testing and documentation<br>
  
IV.Object oriented programming concepts in detail
+
IV.Object oriented programming concepts in detail<br>
     using the non-linear equation problem and implementing more methods
+
     using the non-linear equation problem and implementing more methods<br>
1.Encapsulation
+
1.Encapsulation<br>
2.Inheritance
+
2.Inheritance<br>
3.Polymorphism
+
3.Polymorphism<br>
4.Abstract classes and datatypes
+
4.Abstract classes and datatypes<br>
  
V. Operations on vectors and matrices
+
V. Operations on vectors and matrices<br>
1.Development of general functionality that is usable in many places
+
1.Development of general functionality that is usable in many places<br>
2.Vector and Matrix operations
+
2.Vector and Matrix operations<br>
3.Vector norms
+
3.Vector norms<br>
4.Concurrency and parallel processing of such calculations using JAVA
+
4.Concurrency and parallel processing of such calculations using C++<br>
  
VI. Polynomial interpolation of data
+
VI. Polynomial interpolation of data<br>
1.Description of problems and (biological) applications
+
1.Description of problems and (biological) applications<br>
2.Algorithms: Lagrangian interpolation in detail
+
2.Algorithms: Lagrangian interpolation in detail<br>
3.Implementation to fit a set of data
+
3.Implementation to fit a set of data<br>
4.Piecewise interpolation
+
4.Piecewise interpolation<br>
5.Implementation and visualization of of piecewise interpolation
+
5.Implementation and visualization of of piecewise interpolation<br>
  
VII.Solving ordinary differential equations systems
+
VII.Solving ordinary differential equations systems<br>
1.Description of problem: Lotka-Volterra Predator-Prey system
+
1.Description of problem: Lotka-Volterra Predator-Prey system<br>
2.Algorithms
+
2.Algorithms<br>
3.How to use functions from other libraries
+
3.How to use functions from other libraries<br>
4.How to assess correctness of program
+
4.How to assess correctness of program<br>
5.Visualization of results
+
5.Visualization of results<br>
  
VIII. Markov chain Monte Carlo Integration
+
VIII. Markov chain Monte Carlo Integration<br>
1.Description of method
+
1.Description of method<br>
2.Example application
+
2.Example application<br>
3.Implementation  
+
3.Implementation <br>
4.Testing and visualization of results
+
4.Testing and visualization of results<br>
  
IX.Capstone project
+
IX.Capstone project<br>
  
 
=Grading Policy=
 
=Grading Policy=

Revision as of 21:23, 2 January 2014


Instructor

Peter Beerli
Associate professor
Department of Scientific Computing

Office: 150-T Dirac Science Library
Phone: (850) 645 1324
Email: beerli at fsu dot edu
Web: http://people.scs.fsu.edu/~beerli
Web: http://www.peterbeerli.com

Class hours: Monday, Wednesday, Friday 9:05-9:55 in DSL 152.
Office hours: Not set yet. You are welcome to talk to me at any other times, but I may not have always time to answer in depths.

Teaching assistant: Cameron Berkley

Class website

enter through my personal website http://people.scs.fsu.edu/~beerli/classes/

Content

I.Components of Scientific Computing

II.A simple example - Using a Monte Carlo approach to approximate problems
1.UNIX basics
2.Netbeans IDE: an integrated development environment for C++ programming
3.Introduction to C++
4.Algorithm development
5.Program testing and documentation
6.Visualization and analysis of results

III. Solving a non-linear equations
1.Description of problem and some simple algorithms
2.Iterative methods, required accuracy of result
3.Implementation of the Bisection method
4.Program testing and documentation

IV.Object oriented programming concepts in detail

    using the non-linear equation problem and implementing more methods

1.Encapsulation
2.Inheritance
3.Polymorphism
4.Abstract classes and datatypes

V. Operations on vectors and matrices
1.Development of general functionality that is usable in many places
2.Vector and Matrix operations
3.Vector norms
4.Concurrency and parallel processing of such calculations using C++

VI. Polynomial interpolation of data
1.Description of problems and (biological) applications
2.Algorithms: Lagrangian interpolation in detail
3.Implementation to fit a set of data
4.Piecewise interpolation
5.Implementation and visualization of of piecewise interpolation

VII.Solving ordinary differential equations systems
1.Description of problem: Lotka-Volterra Predator-Prey system
2.Algorithms
3.How to use functions from other libraries
4.How to assess correctness of program
5.Visualization of results

VIII. Markov chain Monte Carlo Integration
1.Description of method
2.Example application
3.Implementation
4.Testing and visualization of results

IX.Capstone project

Grading Policy

The student’s grade for the course will be based upon classwork/quizzes, assignments, and a final capstone project. This work is weighted as follows:

  • Classwork/Quizzes - 10%
  • Assignments 50%
  • Capstone Project - 40%


Assignment/Project Submission

Each assignment or project must be submitted as PDF documents and computer code in a single tar file via email to the TA.

University Attendance Policy

Excused absences include documented illness, deaths in the family and other documented crises, call to active military duty or jury duty, religious holy days, and official University activities. These absences will be accommodated in a way that does not arbitrarily penalize students who have a valid excuse. Consideration will also be given to students whose dependent children experience serious illness.

Academic Honor Policy

The Florida State University Academic Honor Policy outlines the University’s expectations for the integrity of students’ academic work, the procedures for resolving alleged violations of those expectations, and the rights and responsibilities of students and faculty members throughout the process. Students are responsible for reading the Academic Honor Policy and for living up to their pledge to “. . . be honest and truthful and . . . [to] strive for personal and institutional integrity at Florida State University.” (Florida State University Academic Honor Policy, found at http://dof.fsu.edu/honorpolicy.htm.)

Americans With Disabilities Act

Students with disabilities needing academic accommodation should: (1) register with and provide documentation to the Student Disability Resource Center; and (2) bring a letter to the instructor indicating the need for accommodation and what type. This should be done during the first week of class.

This syllabus and other class materials are available in alternative format upon request. For more information about services available to FSU students with disabilities, contact the: Student Disability Resource Center 874 Traditions Way 108 Student Services Building Florida State University Tallahassee, FL 32306-4167 (850) 644-9566 (voice) (850) 644-8504 (TDD) sdrc@admin.fsu.edu http://www.disabilitycenter.fsu.edu/

Syllabus Change Policy

Except for changes that substantially affect implementation of the evaluation (grading) statement, this syllabus is a guide for the course and is subject to change with advance notice.