Not available at this time

Not available at this time

Not available at this time

Not available at this time

Techniques of calculus in two and three dimensions. Vectors, partial derivatives, multiple integrals, line integrals. Prerequisite: MATH 132, or 136. Students expected to have and use a Texas Instruments 89 Titanium Graphing Calculator. Honors section available. (Gen.Ed. R2)

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Linear equations and inequalities, matrices, linear programming with applications to business, probability and discrete random variables. Prerequisite: working knowledge of high school algebra and plane geometry. (Gen.Ed. R2)

[Note: Because this course presupposes knowledge of basic math skills, it will satisfy the R1 requirement upon successful completion.]

Inverse and implicit functions theorems, rank of a map. Regular and critical values. Sard's theorem. Differentiable manifolds, submanifolds, embeddings, immersions and diffeomorphisms. Tangent space and bundle, differential of a map. Partitions of unity, orientation, transversality embed-dings in Rn. Vector fields, local flows. Lie bracket, Frobenius theorem. Lie groups, matrix Lie groups, left invariant vector fields, tensor fields, differential form, integration, closed and exact forms. DeRham's cohomology, vector bundles, connections, curvature.

One-semester review of manipulative algebra, introduction to functions, some topics in analytic geometry, and that portion of trigonometry needed for calculus. Prerequisite: MATH 011 or Placement Exam Part A score above 15. Students with a weak background should take the two-semester sequence MATH 101-102. (Gen.Ed. R1)

Presentation of the classical finite difference methods for the solution of the prototype linear partial differential equations of elliptic, hyperbolic, and parabolic type in one and two dimensions. Finite element methods developed for two dimensional elliptic equations. Major topics include consistency, convergence and stability, error bounds, and efficiency of algorithm. Prerequisites: Math 651, familiarity with partial differential equations.

Calculus of several variables, Jacobians, implicit functions, inverse functions; multiple integrals, line and surface integrals, divergence theorem, Stokes' theorem. Prerequisites: MATH 233 and MATH 235 or 236.