搜尋結果
CS 371 is intended for students interested in the computational aspects that one would encounter in solving various mathematical and scientific problems. Students are expected to be interested in
3.2 Gaussian Elimination 1.Definition 3.1 upper-trianglar if a ij= 0,∀i>j lower-triangular if a ij= 0∀i<j 2.Inversion Property L i can be obtained from M i by swapping the signs of the off-diagonal elements 3.Combination Property L= Q n=1 i=1 L i 4.Definition 3.2 L is
2014年5月23日 · Explain the principles of floating point number systems and the concepts of chopping, rounding, machine precision, and error of floating point arithmetic. Analyze stability and conditioning of numerical problems. Solve nonlinear equations using iterative methods and analyze convergence of various methods.
CS 279 and CS 371 cover the same general topical areas, but whereas CS 279 is a foundational lecture-based course, CS 371 is devoted primarily to reading, presentation, discussion, and critique of papers describing important recent research developments.
Course Notes: CS 371 Course Notes are available from Campus Copy in MC 2018 (approx. $15). Required Text: R.L. Burden and J.D. Faires, Numerical Analysis , 8th Edition, Brooks/Cole, 200 5.
- MC 4045
- MWF 1:30-2:20 pm
Professor Yuying Li describes CS 370 (Numerical Computation), CS 371 (Introduction to Computational Mathematics), CS 473 (Medical Image Processing), CS 475 (Computational Linear Algebra), and CS...
- 14 分鐘
- 5.5K
- uwaterloo
Assignment Marking. The assignments will consist of programming problems and analytic work. Note: Most of the marks for the programming problems will be given for algorithm descriptions (i.e. pseudo-code) and explanation of the results/output. Simply handing in "raw code" and bare output will get very few marks.
