Iterative methods for linear and nonlinear systems of equations including Jacobi, G-S, SOR, CG, multigrid, fixed point methods, Newton quasi-Newton, updating, gradient methods. Crosslisted with CSE 6644.
Develops the probability basis requisite in modern statistical theories and stochastic processes. Topics of this course include measure and integration foundations of probability, distribution functions, convergence concepts, laws of large numbers and central limit theory. (1st of two courses)
Classical introduction to probability theory including expectation, notions of convergence, laws of large numbers, independence, large deviations, conditional expectation, martingales, and Markov chains.
The three course series MATH 6579, 6580, and 6221 is designed to provide a high level mathematical background for engineers and scientists.
Note that MATH 6221 is not equivalent to MATH 6421, and does not provide any credit towards completion of that course.
Discrete time Markov chains, Poisson processes and renewal processes. Transient and limiting behavior. Average cost and utility measures of systems. Algorithm for computing performance measures. Modeling of inventories, and flows in manufacturing and computer networks. (Also listed as ISyE 6761)