Mathematical principles of numerical analysis and their application to the study of particular methods; fixed-point iteration, Newton's method; normed vector spaces and operators, Schur decomposition, convergent matrices, minimization methods, conjugate gradient method; polynomial interpolation of Lagrange and Hermite; best approximation, Bernstein and Weierstrass Theorems, numerical quadrature. Only one of the following will satisfy the requirements for a degree: MATH 417 or MATH 437. Prerequisites: MATH 304, MATH 309, MATH 311, or MATH 323; MATH 308; grade of C or better in MATH 409; ability to program; junior or senior classification Credits 4. 3 Lecture Hours. 3 Lab Hours.
Mathematical principles of numerical analysis and their application to the study of particular methods; fixed-point iteration, Newton's method; normed vector spaces and operators, Schur decomposition, convergent matrices, minimization methods, conjugate gradient method; polynomial interpolation of Lagrange and Hermite; best approximation, Bernstein and Weierstrass Theorems, numerical quadrature. Only one of the following will satisfy the requirements for a degree: MATH 417 or MATH 437. Prerequisites: MATH 304, MATH 309, MATH 311, or MATH 323; MATH 308; grade of C or better in MATH 409; ability to program; junior or senior classification Credits 4. 3 Lecture Hours. 3 Lab Hours.
