CVEN 302-501

1
CVEN 302-501

• Exam 1 Review

2

• Matlab .m files
• Programming FOR, WHILE, IF and FUNCTION
• Taylor Series
• Numerical Differentiation
• Error quantification
• Truncation error

3

• Root finding
• Convert equations to root-finding problems
• Bisection method
• Newton-Raphson method
• Secant method

4

• Linear Algebra
• Gauss elimination (naïve and with partial
  pivoting)
• LU-Decomposition
• Matrix inverse
• Matrix algebra (add, subtract, multiply)
• Cholesky decomposition
• Gauss-Seidel method

5

• Linear Regression
• Summation equations
• Linear models
• Matrix least squares
• Goodness of fit criteria

6

• Numerical integration
• Trapezoidal rule
• Simpsons rules
• Romberg integration

7

• Interpolation
• Initial value problems
• Eulers method
• Midpoint method
• Runge-Kutta methods

8

• Boundary value problems
• Finite difference methods
• Numerical grids
• Matrix solutions
• Eigenvalue problems
• Matrix determinant method
• Solve for eigenvalues/eigenfunctions
• Matlab methods

9

• Partial Differential Equations
• Classification
• Notation
• Implicit/explicit time stepping
• Stability

10
Ground rules

• Three sheets of notes, double sided
• Hand-held calculator
• Show all your work on work-out problems
• 1000 a.m. - 1200 p.m. in Zachry 127B
• Sit in alphabetical order by last name