Difference between revisions of "Math 410: Intro to Numerical Methods"

From MathWiki
Jump to: navigation, search
(Minimal learning outcomes)
(Minimal learning outcomes)
Line 36: Line 36:
 
#* Cubic spline interpolation
 
#* Cubic spline interpolation
 
# Numerical differentiation
 
# Numerical differentiation
 +
#* Richardson's extrapolation
 
# Numerical integration
 
# Numerical integration
 +
#* Newton-Cotes formulas
 +
#* Composite integration
 +
#* Adaptive quadrature
 +
#* Gaussian quadrature
 +
#* Multiple integrals
 
# Numerical solution of linear systems
 
# Numerical solution of linear systems
 
+
#* Direct methods
 +
#** Gaussian elimination
 +
#*** Pivoting strategies
 +
#** Factorization methods
 +
#* Iterative methods
 +
#** Jacobi iteration
 +
#** Gauss-Seidel iteration
 +
#** Relaxation methods
 
</div>
 
</div>
  

Revision as of 14:33, 31 December 2009

Catalog Information

Title

Introduction to Numerical Methods.

(Credit Hours:Lecture Hours:Lab Hours)

(3:3:0)

Offered

F

Prerequisite

Math 314.

Description

Root finding, interpolation, curve fitting, numerical differentiation and integration, multiple integrals, direct solvers for linear systems, least squares, rational approximations, Fourier and other orthogonal methods.

Desired Learning Outcomes

Prerequisites

Minimal learning outcomes

  1. Numerical solution of equations of one variable
    • Bisection method
    • Fixed-point iteration
      • Newton's method
      • Error analysis
    • Polynomial equations
  2. Interpolation
    • Lagrange interpolation
    • Divided-difference methods
    • Hermite interpolation
    • Cubic spline interpolation
  3. Numerical differentiation
    • Richardson's extrapolation
  4. Numerical integration
    • Newton-Cotes formulas
    • Composite integration
    • Adaptive quadrature
    • Gaussian quadrature
    • Multiple integrals
  5. Numerical solution of linear systems
    • Direct methods
      • Gaussian elimination
        • Pivoting strategies
      • Factorization methods
    • Iterative methods
      • Jacobi iteration
      • Gauss-Seidel iteration
      • Relaxation methods

Additional topics

Courses for which this course is prerequisite