Read our cookies policy and privacy statement for more information.
×Davis, California•
Numerical analysis; random number generation; computer experiments and resampling techniques (bootstrap, cross-validation); numerical optimization; matrix decompositions and linear algebra computations; algorithms (Markov chain monte carlo, expectation-maximization); algorithm design and efficiency; parallel and distributed computing.
Units: 4.0
Hours: Lecture—3 hour(s); Laboratory—1 hour(s).