Kansas State, MATH 655

Excerpt: ... MATH 655 Elementary Numerical Analysis I Required of CS Catalog Description: (3) I, II, S. Error analysis, root finding, interpolation, approximation of functions, numerical integration and differentiation, systems of linear equations. Prerequisites: MATH 221, a computer language, and either MATH 515 or 551. Textbook: Elementary Numerical Analysis , Kendall Atkinson, Weimin Han, 2004, 3rd Edition Course Objectives: Master basic numerical analysis and scientific computing. Now updated and revised, this significant revision features reorganized and rewritten content, as well as some new additional examples and problems. Sessions: Three 50 minute lecture/recitations/labs per week. Chapter Topics 1 The Taylor Polynomial The Error in Taylor's Polynomials 2 Floating-Point Numbers Errors Sources, Propagation 3 The Bisection Method Newton's Method Secant Method Fixed Point Iteration Ill-Behaved Rootfinding Problems 4 Polynomial Interpolation Divided Differences, Error Interpolation Using Spline Functions The Best Appr ...

Cal Poly Pomona, MAT 201

Excerpt: ... Mathematics 201 GENERAL COURSE INFORMATION Spring 2007 Section 01, 8-250, TTh 3:00pm-4:50pm Instructor: Professor Stephen Wirkus, swirkus@csupomona.edu (e-mail), 869-4513 (phone), 8-216 (office) All course info will be posted at my URL: www.csupomona.edu/swirkus Office Hours: Tues, 10:00am-11:00am, Wed, 10:00am-12:30noon, Thurs, 10:00am-11:30pm Prerequisites: Must have a C or better in MAT 116 Analytical Geometry and Calculus III. Textbook: Elementary Numerical Analysis by K.Atkinson & W.Han. Computer: Many of the homework assignments will involve the use of Matlab. Access to this program is essential to success in this course. It is available in the Math Computer Lab (8-147). (As a strictly optional alternative, you could purchase student versions of the programs for about $120 - www.mathworks.com for more information or at the Bronco Bookstore.) The handout "Appendix A" is intended to provide a crash course in both of these software packages. Both are written assuming no familiarity with the software. I ...

Dallas, CE 6305

Excerpt: ... system. 1.2 Non-Arithmetic Functions So much for the four arithmetic operations on integers. What about floating point and other functions, such as square-root, log, sin, etc? We shall study floating point systems, sticky bits, guard bits, and the IEEE standard in detail and we shall also consider the effects of round-off errors and use some elementary numerical analysis to study accuracy in floating point calculations. We shall also study methods for computing the transendental functions, both the digit-at-a-time system (Cordic) widely used in hand-held calculators, and the systems used in digital computers. There is a lot to study. I will try to make it interesting and provide you will challenging projects and home works that help you understand and demonstrate your knowledge of the material. Let's get started. ...

Oregon, MATH 352

Excerpt: ... Math 352, Elementary Numerical Analysis II, Winter 2008 Class Time: Instructor: E-Mail: Homepage: Oce: Oce Phone: Oce Hours: Textbook: MWF 2-2:50p.m. in 306 Deady Hall Dr. Marcin Bownik mbownik@uoregon.edu http:/www.uoregon.edu/~mbownik 334 Fenton 346-5622 11-12 Mon. Fri, 12-1 Wed., or by appointment W. Cheney, D. Kincaid, Numerical Mathematics and Computing, 5th edition 1. Background and Goals. This course introduces students to the subject of numerical analysis. Numerical analysis is the study of methods and algorithms for mathematical computation, with an emphasis on techniques for approximating solutions to numerical problems and managing the error. Topics include: Gauss elimination method, matrix factorization, interpolation and approximation by spline functions, numerical methods for solving dierential equations, and method of least squares. The course, which is the second of two in the sequence, covers most of chapters 712 of the textbook. 2. Mathematica. For the in-class computer demo ...

ASU, M 42302

Excerpt: ... Course: MAT 423 Instructor: C. Ringhofer Office: PSA 428 Phone: 965-3741, Electronic Mail: ringhofer@asu.edu Homepage: http:/math.la.asu.edu/~chris/ (for announcements and homework assignments) Time: TTH 4:40-5:55 Room: PSH 132 Description: This course will give an introduction to numerical analysis. Topics covered will be: Floating Point, Computer Arithmetic, Roundoff Error Stability, Convergence, Consistency Roots of Nonlinear Equations, Numerical Linear Algebra: Gaussian Elimination, Iterative Methods, Eigenvalues Elementary Optimization Book: Conte & deBoor: ' Elementary Numerical Analysis ' Grades, Homework etc: 1. There will be two non-comprehensive tests and NO final. The tests will take place in class and are worth 40% of the grade each. 2. There will be several assignments, involving programming. The use of MATLAB is highly recommended. The assignments will be worth 20% of the grade. 3. Homework problems from the book will be assigned. You do not have to ...

Arizona, MATH 475b

Excerpt: ... REFERENCES MATH 475A and 475B - Burden and Faires (elementary=e) Numerical Analysis - Atkinson (medium=m) Numerical Analysis - Asaithambi (e) Numerical Analysis - Nakamura (e) Numerical Analysis -Heath (e) Scientific Computing - Stoer and Bulirsch (advanced=a) Intro to Numerical Analysis - Varga (a) Matrix Iterative Analysis - Strickwerda (m) Finite Differences in PDE - Gear (m) Numerical Initial Value Problems in ODE's - Conte and de Boor (e) Elementary Numerical Analysis - Dahlquist and Bjork (m) Numerical Methods - Isaacson and Keller (m) Numerical Analysis - Smith (m) Numerical PDE's - Kincaid and Cheney (e) Numerical Analysis - Iserles (m) First Year Numerical Analysis - Press, et al. (e) Numerical Recipes ...

Iowa State, COM S 577

Excerpt: ... ijxk k=0 7 = 1 N 1 N N 1 f (xk )eij k=0 N 1 2k N = = j f (xk ) N k=0 k 1 zj . N References [1] S. D. Conte and C de Boor. Elementary Numerical Analysis : An Algorithmic Approach. McGraw-Hill, Inc., 3rd edition, 1980. [2] M. Erdmann. Lecture notes for 16-811 Mathematical Fundamentals for Robotics. The Robotics Institute, Carnegie Mellon University, 1998. [3] W. H. Press, et al. Numerical Recipes in C+: The Art of Scientic Computing. Cambridge University Press, 2nd edition, 2002. 8 ...

Iowa State, COM S 577

Excerpt: ... (L + D + U )x(i) + b. So x(i+1) = x(i) (L + D)1 Ax(i) b . Next, we overshoot by writing x(i+1) = x(i) w(L + D)1 Ax(i) b . This gives (i+1) xk (j) N j=1 akj xj = (i) xk w k1 j=1 akj xj bk akk , where (L + D)x = Ax(i) b. When does each method converge? And how fast if so? The answers are related to the eigenvalues of M 1 (M A). Suppose we dene the error term e(i) = x x(i) . Then M e(i+1) = (M A)e(i) and thus e(i+1) = Be(i) 9 where B = M 1 (M A) = I M 1 A. It follows from the above that e(i) = B i e(0) . That e(i) 0 if any only if B i 0, if and only if every eigenvalue of B satises | < 1. So the role of convergence is governed by the largest |, that is, the spectral radius of B. References [1] M. Erdmann. Lecture notes for 16-811 Mathematical Fundamentals for Robotics. The Robotics Institute, Carnegie Mellon University, 1998. [2] S. D. Conte and Carl de Boor. Elementary Numerical Analysis . McGraw-Hi ...

Washington, CSL 361

Excerpt: ... lier form. NOTATION D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 D15 D16 D17 D18 D19 DOCUMENTS Numerical Recipes In C+ Analysis And Design Of Algorithms Numerical And Scientific Algorithms Advanced Linear Algebra Linear Algebra Algorithms Digital Image Processing Image Architechture Introduction To Algorithms Topics In Algebra Computer Architechture Organization And Hierarchy Organization Psychology Programming Language Pragmatics Guide To C+ Programming Language Data Structures And Algorithms Linear Algebra Probability And Stochastic Processing Introduction To Probability Models Introduction To Processing And Statistical Applications Elementary Numerical Analysis And Algorithm Approach 9 We do not present the term document matrix here as its too large and doesn't convey any relevant information offhand. We shall explain query matching through 4 queries : 1. Digital Algebra 2. Probability 3. Linear Algebra 4. Psychology Lets consider each of these in detail. Query 1 : Digital Algebra First we show the p ...

Virginia Tech, WWW-RP 92

Excerpt: ... en J. Rock and Michael J. Wozny, Utilizing Topological Information to Increase Scan Vector Generation Efficiency, in: Solid Freeform Fabrication Symposium Proceedings, H.L. Marcus, J. J. Beaman, J.W. Barlow, D.L. Bourell, and R.H. Crawford (eds.), The University of Texas at Austin, Aug. 1991. 9. Stephen J. Rock and Michael J. Wozny, A Flexible File Format for Solid Freeform Fabrication, in: Solid Freeform Fabrication Symposium Proceedings, H.L. Marcus, J. J. Beaman, J.W. Barlow, D.L. Bourell, and R.H. Crawford (eds.), The University of Texas at Austin, Aug. 1991. 10. Kendall Atkinson, Elementary Numerical Analysis , John Wiley and Sons, Inc., 1985. 11. Daniel F. Stubbs and Neil W. Webre, Data Structures with Abstract Data Types and Pascal, Brooks/Cole Publishing Company, 1989. 12. Jan Helge Bhn, Personal Communication, June 30, 1992. 1. 2. 3. 9 KEYWORDS Solid Modeling, Facet Model, STL Format, Topology, Topology Generation, AVL Tree, Validity Checking, Bucket of Facets ...

Duke, MATH 133

Excerpt: ... rical Analysis, 2nd Edition, by K. E. Atkinson Elementary Numerical Analysis , by K. E. Atkinson Numerical Mathematics, by A. Quarteroni, R. Sacco, F. Saleri Other references: Numerical Solution of Stochastic Dierential Equations, by P.E. Kloeden, E. Platen Assignments Weekly problem sets will include theory, analysis and computational projects. A written solution and hardcopy of every code, input or output must be submitted for each problem. An electronic copy of our code must also be submitted to me via e-mail, in a unique zip or tar/gzip le. Requests for extensions on homework should be done before the due data; unexcused late assignments will be penalized. You are encouraged to discuss the homework problems with your classmates, but your nal submission must be entirely your own independent work (see the Duke Community Standard). Exams There will be a midterm and a nal. Grade to be based on weekly assignments and exams. ...

Maple Springs, SOCI 3690

Excerpt: ... In-class Test (worth 20%) The test will take place on March 10 and will involve answering 2 short questions (worth 5% each), and one longer essay question (worth 10%). Questions will cover the readings, lectures and visual contents of the entire cour ...

Illinois Tech, MATH 149

Excerpt: ... <STUDYGUIDES08C.TXT> {5-9-2008} Math 149 Spring 2008 Final Study Guide, Part III - Chapter 6 Concept Check, p. 378: 1,2,3,4,5 Exercises: 1-6, 7-11, 12-16 Chapter 9 Concept Check, p. 598: 1 Exercises: 1, 3a, 7 ...