Scribd
Upload
8 views

syllabus_Spring_2025_Prof_irina

CSc 301 is a course focused on numerical issues in scientific programming, covering topics such as roundoff error, numerical differentiation, and integration using Python. Prerequisites include calculus, linear algebra, probability, and algorithms, with a required textbook by Michael T. Heath. The course includes various assessments, including quizzes, homework, and exams, while emphasizing academic integrity and individual homework submissions.

Uploaded by

saadia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

syllabus_Spring_2025_Prof_irina

CSc 301 is a course focused on numerical issues in scientific programming, covering topics such as roundoff error, numerical differentiation, and integration using Python. Prerequisites include calculus, linear algebra, probability, and algorithms, with a required textbook by Michael T. Heath. The course includes various assessments, including quizzes, homework, and exams, while emphasizing academic integrity and individual homework submissions.

Uploaded by

saadia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CSc 301: Numerical Issues in Scientific Programming

Prof. Irina Gladkova


Office: NAC 8/212
[email protected]
Hours: Tu/Th 12:45–1:45 pm

Course Description:
Numerical issues: roundoff error, truncation error, overflow and underflow errors. Numerical differentiation
and integration; solution of simultaneous equations; Approximation, curve fitting. A thorough introduction
to scientific programming, using Python language. There will be substantial homework assignments aimed
at reinforcing the material covered in class.

Prerequisite(s):
Calculus (Math 20300), Linear algebra (Math 34600), Probability (CSc 21700), Algorithms (CSc 22000).

Required textbook:
Michael T. Heath, Scientific Computing, An Introductory Survey, Revised 2nd edition, SIAM 2018,
ISBN: 9781611975574 (http://heath.cs.illinois.edu/scicomp/)
Supplementary (online) textbook:
https://pythonnumericalmethods.berkeley.edu/notebooks/Index.html

Grades:
Pop quizzes (10%), 5 homework assignments (30%), Test 1 (15%), Test 2 (15%), Final Exam (30%).

Course objectives:
• Learn about the effects of round-off, truncation, overflow and underflow errors on numerical
computations;
• Learn how to select/construct an appropriate algorithm/method for given problem;
• Learn to estimate the magnitude of an error, determine an appropriate step size or the
number of iterations required;
• Learn to provide adequate checks on accuracy of the solution and make allowance for
corrective action in cases of non-convergence.

Homework rules:
• Never hand programs that do something different tat what is asked in the homework.
• You are welcome to discuss and work in groups, but the final submission of your homework
must be written by you.
• Homework assignments will be posted on BrightSpace 2 weeks prior to the due date.
• Homework must be submitted via BrightSpace before the indicated due date/time. Late
submissions will not be graded.

Academic Integrity:
CUNY policy on academic integrity can be found here. According to the policy, Academic Dishonesty is
prohibited in The City University of New York and is punishable by penalties, including failing grades,
suspension and expulsion.

1
Topics (Chapters/Sections in the book):

Chapter 1. Scientific Computing


1.2 Approximations in Scientific Computation
1.3 Computer Arithmetic
1.4 Mathematical Software

Chapter 2. Systems of Linear Equations


2.1 Linear Systems
2.2 Existence and Uniqueness
2.3 Sensitivity and Conditioning
2.4 Solving Linear Systems
2.5 Special Types of Linear Systems
2.7 Software for Linear Systems

Chapter 5. Nonlinear Equations


5.1 Nonlinear Equations
5.2 Existence and Uniqueness
5.3 Sensitivity and Conditioning
5.4 Convergence Rates and Stopping Criteria
5.5 Nonlinear Equations in One Dimension
5.6 Systems of Nonlinear Equations
5.7 Software for Nonlinear Equations

Chapter 6. Optimization
6.1 Optimization Problems
6.2 Existence and Uniqueness
6.3 Sensitivity and Conditioning
6.4 Optimization in One Dimension
6.8 Software for Optimization

Chapter 3. Linear Least Squares


3.1 Linear Least Squares Problems
3.2 Existence and Uniqueness
3.3 Sensitivity and Conditioning
3.4 Problem Transformations
3.8 Software for Linear Least Squares

Chapter 7. Interpolation
7.1 Interpolation
7.2 Existence, Uniqueness and Conditioning
7.3 Polynomial Interpolation
7.4 Piecewise Polynomial Interpolation
7.5 Software for Interpolation

Chapter 8. Numerical Integration and Differentiation


8.1 Integration
8.2 Existence, Uniqueness and Conditioning
8.3 Numerical Quadrature
8.6 Numerical Differentiation
8.8 Software for Integration and Differentiation

You might also like