Fall 2019~2020 **AMSC/CMSC 460** (Numerical methods) University of Maryland, College Park

Lecture: Section 0201: TuTh 11:00am-12:15pm, Room: EGR0135

1 Section 0401: TuTh 3:30pm-4:45pm, Room: EGR0135

Email: rshu@cscamm.umd.edu

Office: 4150 CSIC building

Office hours: 2:15pm-3:15pm Tuesday, and by appointment

Syllabus (updated on September 3): fall2019_amsc460_shu_syllabus

**Exam solutions: **midterm1_soln (for 11:00 section), midterm1_b_soln (for 3:30 section)

midterm2_soln (for 11:00 section), midterm2_b_soln (for 3:30 section)

**Homework**: problems from textbook

HW1 (due Thursday, September 5):

sec 1.2: 5(a)(b). (ignore things about relative errors)

sec 2.1: 3, 18. (you could use my codes, but you are suggested to write your own. Intermediate values of p_n should be shown in your report.)

HW2 (due Thursday, September 12):

sec 2.2: 5, 12, 19 (for 12, you could use a code with TOL much smaller than 10^{-4}. Ignore the last sentence in the problem.)

sec 2.3: 6(a) (write your own codes. Show every value of p_n in your report.)

HW3 (due Thursday, September 19):

sec 2.3: 11(b)

sec 2.4: 10 (this result means, if you know the multiplicity of the root you want to find, then you can achieve second-order convergence without computing f”(x) (like in the modified Newton’s method))

sec 3.1: 1(a)(c)

HW4 (due Thursday, September 26):

sec 3.1: 3(a)(c) (only for degree-2 case)

sec 3.2: 1(a) (you are suggested to write a code because this is a nice practice of coding)

sec 3.3: 1(a), 23

HW5 (due Thursday, October 10):

sec 6.2: 1(a)(d), 3(a)(d) (you are suggested to write your own code, as practice)

sec 6.6: 2 (only the ‘strictly diagonally dominant’ part)

HW6 (due Thursday, October 17):

sec 6.5: 2(a), 6(a)(d)

sec 6.6: 3(a)(b), 12(c)

HW7 (due Thursday, October 24):

sec 8.1: 3

sec 8.2: 1(a)(c), 11

HW8 (due Thursday, October 31):

sec 4.1: 1, 5(a)(c), 28

sec 4.2: 8

HW9 (due Thursday, November 7):

sec 4.3: 1(c), 3(c), 5(c), 7(c), 23

sec 4.7: 1(a)

HW10 (due Thursday, November 21):

sec 5.2: 1(a), 3(a), 6(a)

sec 5.3: 6(d)

HW11 (due Thursday, December 5):

sec 5.4: 1(a), 5(a), 13(a)

sec 5.6: 4(a) (only 4-th order A-B method), 17

Some suggested problems for later sections:

sec 5.9: 1(a), 3(a) (both using midpoint and modified Euler methods)

sec 5.11: 10

**Lecture notes**: (date_chapter_section)

20190827_1_2 (codes: teaching_code_20190827.m)

20190829_1_3_2_1 (codes: teaching_code_20190829.m) codes updated. Also, in the ‘fail case’, using ‘return’ instead of ‘exit’ seems more reasonable.

20190905_2_3 (codes: teaching_code_20190905.m)

20190910_2_3_2_4 (codes: teaching_code_20190910.m)

20190917_3_1_3_2 (codes: teaching_code_20190917.m)

20191003_6_2 (codes: teaching_code_20191003.m)

20191015_8_1 (codes: teaching_code_20191015.m)

20191022_4_1 (codes: teaching_code_20191022.m)

20191105_4_4 (codes: teaching_code_20191105.m)

20191114_5_3 (codes: teaching_code_20191114.m)

20191126_5_9 (codes: teaching_code_20191126.m)

20191205_5_11 (codes: teaching_code_20191205.m)

———————————————————————————————————————–

Previous teaching:

At University of Maryland, College Park, as instructor:

Spring 2018~2019 Math 136 (calculus for life sciences)

Fall 2018~2019 Math 141 (calculus 2)

At University of Wisconsin-Madison, as teaching assistant:

Fall 2017~2018 Math 234 (calculus 3)

Fall 2016~2017 Math 222 (calculus 2)

Fall 2015~2016 Math 234 (calculus 3)

Spring 2014~2015 Math 221 (calculus 1)

Fall 2014~2015 Math 221 (calculus 1)