MATH 270B
Mathematical Aspects of Scientific Computing: Computational Linear Algebra
Description: Lecture, three hours. Requisites: courses 115A, 151A, 151B, Program in Computing 10A. Direct, fast, and iterative algorithms, overdetermined systems; singular value decomposition, regularization, sparse systems, algebraic eigenvalue problem. S/U or letter grading.
Units: 4.0
Units: 4.0
1 of 1
Most Helpful Review
Winter 2020 - Great professor, easy class as a PhD course. Deanna is extremely patient, helpful, and funny. Her lectures are clear, but the content is a bit easy, so that she sometimes ended class 20-30mins early. Quizzes are not hard, but you have to spend some time preparing for it. No curve course, strict grading scheme.
Winter 2020 - Great professor, easy class as a PhD course. Deanna is extremely patient, helpful, and funny. Her lectures are clear, but the content is a bit easy, so that she sometimes ended class 20-30mins early. Quizzes are not hard, but you have to spend some time preparing for it. No curve course, strict grading scheme.
AD
1 of 1
