MS213: Numerical Methods Computing Assignments with Matlab
|
|
- Brett Wilkinson
- 5 years ago
- Views:
Transcription
1 MS213: Numerical Methods Computing Assignments with Matlab SUBMISSION GUIDELINES & ASSIGNMENT ADVICE 1 Assignment Questions & Supplied Codes 1.1 The MS213 Numerical Methods assignments require students to solve 6 numerical problems using Matlab. The problems are related to 6 areas of the syllabus, namely (1) roots of a single nonlinear equation; (2) direct methods for linear systems; (3) iterative methods for linear systems; (4) numerical differentiation; (5) interpolation; and (6) numerical integration. 1.2 All problems require a small amount of Matlab programming but the typical requirement is for the student to piece together existing Matlab codes for problem-solving and comparison purposes. Emphasis should be placed on program design, and all numerical experiments should be carefully structured to allow for subsequent results analysis and meaningful comparisons. Marks will be awarded especially on the content and quality of presentation of a final report, detailing the major quantitative and qualitative results. 1.3 Matlab codes have been specially written for each of the 6 syllabus areas mentioned above. There are 5 methods available for solving nonlinear equations, 3 methods each for direct and iterative linear systems, a general purpose code for numerical differentiation (for derivatives of orders 1, 2 and 3), one method (two codes) for Newton polynomial interpolation, and 2 methods for numerical integration. All available codes are accompanied by sample scripts (with associated function files, where necesary) and will generate sample output when executed. The codes are available on Moodle (see the Matlab Assignments folder). 2 Submission Date Students are requested to submit the assignments by 1pm on Thursday of week 10 of Semester 1. Each of the 6 assignments is structured in the form of a tutorial question (requiring computational analysis) and it is intended that one question at a minimum should be tackled each week. 3 Submission Format 3.1 It is intended that the output for each question should require no more than a single A4 page so please consult with the Tutor or Lecturer if you are having difficulties in this regard. For the MS213 Computing Assignments overall, you are to submit at most 25 pages, 4 pages per question (three pages at most for the main code and any newly-created function and a single page for the output) together with a completed Assignment Cover Page which is available on Moodle (see the Matlab Assignments folder). 1
2 MS213: Numerical Mathematics Submission Guidelines You are requested to store the full code (which was used to generate the output presented) for each question on a CD using file names to make clear which question is being answered (see example below). MS213: NUMERICAL METHODS COMPUTING ASSIGNMENTS WITH MATLAB Assignment Question Numbers To be Completed by the Lecturer MS213 Student Name Student Name: In Block Capitals ID Number: Student ID Number DECLARATION: I, the undersigned, declare that the assignment material, which I hereby submit, is my own work. Any assistance received by way of borrowing from others has been cited and duly acknowledged within this submission. I make this declaration in the knowledge that a breach of the rules pertaining to project submission may carry serious consequences. SIGNATURE: DATE: 3.3 Please submit the duly-completed cover sheet, a correctly formatted print-out of the main code and output, and a CD containing all the codes used for the 8 assignment questions in a standard lightweight A4 display book having 20 polypropylene pockets: MS213 Student Name Student ID Number MS213: NUMERICALMETHODS COMPUTINGASSIGNMENTSWITHMATLAB AssignmentQuestionNumbers To be CompletedbytheLecturer Student Name: In Block Capitals ID Number: DECLARATION: I, the undersigned, declare that the assignment material, which I hereby submit, is my own work. Any assistance received by way of borrowing from others has been cited and duly acknowledged within this submission. I make this declaration in the knowledge that a breach of the rules pertaining to project submissionmaycarryseri- ous consequences. SIGNATURE: DATE: 3.4 The first comment statements of all files must contain your name, ID number, etc., as well as the question number, filename and date created. Output should be formatted in a similar manner. Submissions which do not conform to these guidelines will not be accepted. 3.5 Comment statements should also state the purpose of the program and guide the reader through its various steps. Every program that accepts input from the user and/or prints results must prompt the user to enter input and/or label the output.
3 MS213: Numerical Mathematics Submission Guidelines 3 % MS213: Matlab Computing Project % =============================== % % Student: Jack O Shea % ID Number: % Class Group: ACM2 % Module: MS213 % Question: Q.N % Date: 1/10/ Test your code carefully prior to submission. Always use the exact data supplied (if any) or the kind of data suggested (if any) to test the version of the code that you intend to submit. Send an to the Lecturer if you are unable to locate any required data files. 4 Grading & Academic Honesty 4.1 Failure to submit any of the assignment questions will result in a fail grade being awarded for that question and, as a consequence, this will undermine any decision to record an overall pass in the continuous assessment element of the module. To pass the overall module will require an award of pass in both the continuous assessment and examination elements of the module. 4.2 You are expected to consult with your Tutors for advice in solving the assigned problems. However, each student must submit his or her own individual solutions. A code of academic honesty is expected in this module. Students who are found to have submitted material which is in breach of this code will suffer the following two consequences: (a) a fail grade will be given for the assignment in question; and (b) a report of the incident will be filed with the Programme Board. Breaches of the code include the provision of assignment code segments to someone else, the receipt of assignment code segments from someone else, and plagiarism. 5 Advice on Assignment Questions Q.1 By way of illustration, suppose that we wish to find a root of f(x) = x 1 8 e2x 1 (which we will refer to as the Boltzmann problem) which is close to x = 2 (there is another root close to x = 0). A key requirement for the fixed-point method is to choose g(x) correctly and this depends on the location of the root. There are two obvious choices for g(x), namely Simple analysis shows that g 1 (x) = 1 8 e2x 1 and g 2 (x) = 1 (1 + log 8x) 2 g 1(x) = 1 4 e2x 1 < 1 for x < 1 (1 + log 4) and g 2(x) = 1 2x < 1 for x > 1 2
4 MS213: Numerical Mathematics Submission Guidelines 4 Therefore, we choose g(x) = g 2 (x) for the root near x = 2. As starting values, we use [a, b] = [1.5, 2.5] for the Bisection method and x 0 = 3 for all the other methods except the Secant method where we use x 0 = a and x 1 = b. In addition to the standard headings, the data output required has the following format: MS213 Project Sample Problem Q1 :: The Boltzmann Problem =============================== ===================== Method TOL ITER NFE Appr Root Error Bisection 1.0e e-005 Fixed Pt 1.0e e-005 Newton 1.0e e-014 Secant 1.0e e-008 Steffensen 1.0e e-012 Bisection 1.0e e-007 Fixed Pt 1.0e e-007 Newton 1.0e e-014 Secant 1.0e e-013 Steffensen 1.0e e-016 Bisection 1.0e e-009 Fixed Pt 1.0e e-009 Newton 1.0e e+000 Secant 1.0e e-016 Steffensen 1.0e e-016 As we do not know the true value of the root, we can substitute the result obtained from Matlab s fzero function using a very small tolerance, e.g : accurate_value = fzero(fx, (a+b)/2, optimset( Tolx, 1.0e-14)); In the actual assignment question, it is advisable to declare β as a global variable in order to loop through the 3 values in the same code run. Q.2 A key requirement in Question 2 is the need to compute the l norm of the error in the computed solution: x ˆx = max 1 i n x i ˆx i where x and ˆx denote the true and approximate solutions respectively. Suppose that x pp denotes the solution provided by the partial pivoting algorithm. Then, Matlab s norm function will compute the l norm of the error as follows: pp_error = norm(x_pp - xtrue, inf);
5 MS213: Numerical Mathematics Submission Guidelines 5 As an example of the output format, we ran the code when A was the Hilbert matrix of order n which is the n n matrix defined by a ij = (i + j 1) 1, 1 i, j n. It is often used for test purposes because of its ill-conditioned nature. If we define n b i = a ij, j=1 then the solution of the system of equations Ax = b is x = [1, 1,, 1] T. The corresponding output (for a different range of n) is then: Hilbert Matrix: L_inf Norm of the Error ================================================ n No Pivoting Partial Pivoting Scaled Pivoting e e e e e e e e e e e e e e e Q.3 As with question 2, you will also require the infinity error norm function. To illustrate the required output format, we used the code to solve an almost identical (but numerically easier) problem, defined by the equations: 33x 1 16x 2 = 17, 16x i x i 16x i+1 = 1, 2 i n 1, 16x n x n = 17. Under the same conditions as in the actual assignment question, namely 6 values of n (8, 16, 32, 64, 128 and 256), an accuracy requirement of 10 6, an upper limit of 2,000 on the number of iterations allowed and a zero initial guess, the following results were obtained: Iterative methods applied to the Sample Tridiagonal System Jacobi Gauss-Seidel SOR Method =========================================================== n Iter Error Iter Error Iter Error e e e e e e e e e e e e e e e e e e
6 MS213: Numerical Mathematics Submission Guidelines 6 For this problem, we used slightly different values of ω for the SOR method: n ω Q.4 The main issue for question 4 is the required output format. Using the sample function f(x) = sin(x) + cos(x), we ran the code for a slightly different range of h to produce the following: Centered Differencing Methods: f(x) = sin(x) + cos(x) ============================= ====================== x h 2nd Deriv. 3rd Deriv. f^(3)+f*f^(2)/ e e e e e e e e e e e e e e e The absolute errors in the respective approximations appear on the second line for each value of h. For this example, the optimum value of h occurs close to h = which 10 corresponds well with the results presented above. Q.5 The task in this question is to apply interpolation in two directions, namely (a) to find temperature values for the required new x-value at all the existing y-values; and (b) to use these new temperature values at the given y-values to find the temperature at the new y-value. As an illustration, we applied the code using a different set of temperature values: y x Suppose that we require the temperature at the three coordinate points: Then, the output might look as follows: (0.35, 1.45), (1.25, 2.25) and (1.75, 0.55).
7 MS213: Numerical Mathematics Submission Guidelines 7 Interpolated Values at the given x-value Temperature u(0.35, 1.45) u(1.25, 2.25) u(1.75, 0.55) The 6 data values alongside x = 0.35 represent the temperature values at (0.35, y) for y running from 0.00 to Taking these 6 y-values and the newly-found temperature values, we are then able to interpolate to find the temperature at the new value y = 1.45 to obtain u(0.35, 1.45) You should set up the code so that you can loop through the three cases in one run. Q.6 In order for the value of k to be visible (within the declaration of f(x)) to the numerical integrators, it is necessary to make this parameter global by declaring it as a global variable in both the main script and the function containing the definition of f(x). As mentioned in the assignment question statement, it will suffice to use Matlab s quad function as a replacement for the exact value of the integral. exact_value = quad(fcn, a, b, 1.0e-14); Also, a safe starting value to use for the backward recurrence is close to k = 30 but you should experiment with different starting values to observe accuracy. The suggested output format is as follows: -- Exact Trapezoidal Simpson Forward Backward k Integral Rule Error Rule Error Recurrence Recurrence e e : : JCarroll MS213: Numerical Methods Computing Assignments: Submission Guidelines JC 15/8/2013
Handout 2 - Root Finding using MATLAB
Handout 2 - Root Finding using MATLAB Middle East Technical University MATLAB has couple of built-in root finding functions. In this handout we ll have a look at fzero, roots and solve functions. It is
More informationThursday 1/8 1 * syllabus, Introduction * preview reading assgt., chapter 1 (modeling) * HW review chapters 1, 2, & 3
Topics and Syllabus Class # Text Reading I. NUMERICAL ANALYSIS CHAPRA AND CANALE A. INTRODUCTION AND MATLAB REVIEW :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::Week
More informationNUMERICAL METHODS, NM (4776) AS
NUMERICAL METHODS, NM (4776) AS Objectives To provide students with an understanding that many mathematical problems cannot be solved analytically but require numerical methods. To develop a repertoire
More informationCSE100 Principles of Programming with C++
1 Instructions You may work in pairs (that is, as a group of two) with a partner on this lab project if you wish or you may work alone. If you work with a partner, only submit one lab project with both
More informationIntroduction to Programming for Engineers Spring Final Examination. May 10, Questions, 170 minutes
Final Examination May 10, 2011 75 Questions, 170 minutes Notes: 1. Before you begin, please check that your exam has 28 pages (including this one). 2. Write your name and student ID number clearly on your
More informationCS 6210 Fall 2016 Bei Wang. Review Lecture What have we learnt in Scientific Computing?
CS 6210 Fall 2016 Bei Wang Review Lecture What have we learnt in Scientific Computing? Let s recall the scientific computing pipeline observed phenomenon mathematical model discretization solution algorithm
More informationCIS 302 Relational Database Systems
CIS 302 Relational Database Systems Fall 2008 Cedar Crest College Tony Marasco COURSE CONTENT In this course the student is provided with a solid and practical foundation for the design, implementation,
More informationAMSC/CMSC 460 Final Exam, Fall 2007
AMSC/CMSC 460 Final Exam, Fall 2007 Show all work. You may leave arithmetic expressions in any form that a calculator could evaluate. By putting your name on this paper, you agree to abide by the university
More informationPhiladelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008. Course Syllabus
Philadelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008 Course Syllabus Course Title: Advanced Databases Course Level: 4 Lecture Time: Course code:
More informationCS 241 Data Organization using C
CS 241 Data Organization using C Fall 2018 Instructor Name: Dr. Marie Vasek Contact: Private message me on the course Piazza page. Office: Farris 2120 Office Hours: Tuesday 2-4pm and Thursday 9:30-11am
More informationMATH 2221A Mathematics Laboratory II
MATH 2221A Mathematics Laboratory II Lab Assignment 1 Name: Class: Student ID.: In this assignment, you are asked to run MATLAB demos to see MATLAB at work. The color version of this assignment can be
More informationToday s class. Roots of equation Finish up incremental search Open methods. Numerical Methods, Fall 2011 Lecture 5. Prof. Jinbo Bi CSE, UConn
Today s class Roots of equation Finish up incremental search Open methods 1 False Position Method Although the interval [a,b] where the root becomes iteratively closer with the false position method, unlike
More information5.5 Newton s Approximation Method
498CHAPTER 5. USING DERIVATIVES TO ANALYZE FUNCTIONS; FURTHER APPLICATIONS 4 3 y = x 4 3 f(x) = x cosx y = cosx 3 3 x = cosx x cosx = 0 Figure 5.: Figure showing the existence of a solution of x = cos
More informationFall 2017: Numerical Methods I Assignment 1 (due Sep. 21, 2017)
MATH-GA 2010.001/CSCI-GA 2420.001, Georg Stadler (NYU Courant) Fall 2017: Numerical Methods I Assignment 1 (due Sep. 21, 2017) Objectives. This class is for you and you should try to get the most out of
More informationLecture VIII. Global Approximation Methods: I
Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29 Global function approximation Global methods: function
More informationStudent Website / Portal Guidelines
Student Website / Portal Guidelines Contents INTRODUCTION...3 CONNECTING TO THE BRADFIELD GROUP WEBSITE...3 STUDENTS HOMEPAGE...4 STUDENT ASSIGNMENTS...4 DOWNLOAD ASSIGNMENT BRIEF...5 REQUEST AN EXTENSION
More informationAM205: lecture 2. 1 These have been shifted to MD 323 for the rest of the semester.
AM205: lecture 2 Luna and Gary will hold a Python tutorial on Wednesday in 60 Oxford Street, Room 330 Assignment 1 will be posted this week Chris will hold office hours on Thursday (1:30pm 3:30pm, Pierce
More informationGood luck! First name Legi number Computer slabhg Points
Surname First name Legi number Computer slabhg... Note 1 2 4 5 Points Fill in the cover sheet. (Computer: write the number of the PC as printed on the table). Leave your Legi on the table. Switch off your
More informationMATH 2221 A Mathematics Laboratory II
MATH 2221 A Mathematics Laboratory II Lab Assignment 7 Name: Student ID.: In this assignment, you are asked to run MATLAB demos to see MATLAB at work. The color version of this assignment can be found
More informationNew Mexico Tech Hyd 510
Numerics Motivation Modeling process (JLW) To construct a model we assemble and synthesize data and other information to formulate a conceptual model of the situation. The model is conditioned on the science
More informationMS6021 Scientific Computing. MatLab and Python for Mathematical Modelling. Aimed at the absolute beginner.
MS6021 Scientific Computing MatLab and Python for Mathematical Modelling. Aimed at the absolute beginner. Natalia Kopteva Email: natalia.kopteva@ul.ie Web: http://www.staff.ul.ie/natalia/ Room: B2037 Office
More informationComputational Mathematics/Information Technology. Worksheet 2 Iteration and Excel
Computational Mathematics/Information Technology Worksheet 2 Iteration and Excel This sheet uses Excel and the method of iteration to solve the problem f(x) = 0. It introduces user functions and self referencing
More informationW4260: Modeling the Universe. Lecture 4
W4260: Modeling the Universe Lecture 4 Overview Input and output (I/O) Files Scope Global variables More on functions The art of programming Before starting Program structure/layout Comments Root finding
More informationMAT128A: Numerical Analysis Lecture One: Course Logistics and What is Numerical Analysis?
MAT128A: Numerical Analysis Lecture One: Course Logistics and What is Numerical Analysis? September 26, 2018 Lecture 1 September 26, 2018 1 / 19 Course Logistics My contact information: James Bremer Email:
More informationLECTURE 0: Introduction and Background
1 LECTURE 0: Introduction and Background September 10, 2012 1 Computational science The role of computational science has become increasingly significant during the last few decades. It has become the
More informationPostgraduate Diploma in Marketing
Postgraduate Diploma in Marketing Group Assignment June 2018 Developing Effective Communication (DEC) Examination /Assignment Registration 02nd April to 28th April 2018 Period Examination / Assignment
More informationJustify all your answers and write down all important steps. Unsupported answers will be disregarded.
Numerical Analysis FMN011 2017/05/30 The exam lasts 5 hours and has 15 questions. A minimum of 35 points out of the total 70 are required to get a passing grade. These points will be added to those you
More informationSECOND SEMESTER BCA : Syllabus Copy
BCA203T: DATA STRUCTURES SECOND SEMESTER BCA : Syllabus Copy Unit-I Introduction and Overview: Definition, Elementary data organization, Data Structures, data structures operations, Abstract data types,
More informationHomework 1 (a and b) Convex Sets and Convex Functions
Homework 1 (a and b) Convex Sets and Convex Functions CMU 10-725/36-725: Convex Optimization (Fall 2017) OUT: Sep 1 DUE: Prob 1-3 Sep 11, 5:00 PM; Prob 4 Sep 15, 5:00 PM START HERE: Instructions Collaboration
More information1 2 (3 + x 3) x 2 = 1 3 (3 + x 1 2x 3 ) 1. 3 ( 1 x 2) (3 + x(0) 3 ) = 1 2 (3 + 0) = 3. 2 (3 + x(0) 1 2x (0) ( ) = 1 ( 1 x(0) 2 ) = 1 3 ) = 1 3
6 Iterative Solvers Lab Objective: Many real-world problems of the form Ax = b have tens of thousands of parameters Solving such systems with Gaussian elimination or matrix factorizations could require
More informationComparison of different solvers for two-dimensional steady heat conduction equation ME 412 Project 2
Comparison of different solvers for two-dimensional steady heat conduction equation ME 412 Project 2 Jingwei Zhu March 19, 2014 Instructor: Surya Pratap Vanka 1 Project Description The purpose of this
More informationGeorge Mason University ECE 201: Introduction to Signal Analysis Spring 2017
Assigned: January 27, 2017 Due Date: Week of February 6, 2017 George Mason University ECE 201: Introduction to Signal Analysis Spring 2017 Laboratory Project #1 Due Date Your lab report must be submitted
More informationTHE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECH- NOLOGY ITERATIVE LINEAR SOLVERS
ITERATIVE LIEAR SOLVERS. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of iterative methods for solving linear least squares problems, to study the properties
More informationNew Rules of ME Ph.D. Qualifying Exams 1/8
New Rules of ME Ph.D. Qualifying Exams 1/8 Qualifying Examination The student must pass a Qualifying Examination before the Dissertation Director, the Interdisciplinary Committee, and the courses for the
More informationCS321 Introduction To Numerical Methods
CS3 Introduction To Numerical Methods Fuhua (Frank) Cheng Department of Computer Science University of Kentucky Lexington KY 456-46 - - Table of Contents Errors and Number Representations 3 Error Types
More informationCOURSE SYLLABUS FOR. COMP-297 Web Page Design: Adobe Dreamweaver
Coffeyville Community College COURSE SYLLABUS FOR COMP-297 Web Page Design: Adobe Dreamweaver Mrs. Darla Thornburg Spring 2018 Page 1 of 8 COURSE NUMBER: COURSE TITLE: CREDIT HOURS: INSTRUCTOR: OFFICE
More informationNumerical Methods Lecture 7 - Optimization
Numerical Methods Lecture 7 - Optimization Topics: numerical optimization - Newton again - Random search - Golden Section Search READING : text pgs. 331-349 Optimization - motivation What? Locating where
More informationEngineering Computing M1H Together Towards A Green Environment
Engineering Computing M1H321538 Module Induction Course Resources Lecture/Tutorial hours Course Syllabus Assessment Procedure Expectation from the Students General Terms and Conditions Course Resources
More informationConstrained Optimization with Calculus. Background Three Big Problems Setup and Vocabulary
Constrained Optimization with Calculus Background Three Big Problems Setup and Vocabulary Background Information In unit 3, you learned about linear programming, in which all constraints and the objective
More informationAn interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s.
Using Monte Carlo to Estimate π using Buffon s Needle Problem An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Here s the problem (in a simplified form). Suppose
More informationFIT3056 Secure and trusted software systems. Unit Guide. Semester 2, 2010
FIT3056 Secure and trusted software systems Unit Guide Semester 2, 2010 The information contained in this unit guide is correct at time of publication. The University has the right to change any of the
More informationTop bar items. Current folder should be shown. Command Window This has the the prompt >>
MA1710: Week 2 for, if, else, break Getting started in session 2 With the Windows 7 operating system that we have in our Labs start Matlab as you did last week by clicking the mouse pointer on Start (bottom
More informationUNIVERSITY OF CALIFORNIA COLLEGE OF ENGINEERING
UNIVERSITY OF CALIFORNIA COLLEGE OF ENGINEERING E7: INTRODUCTION TO COMPUTER PROGRAMMING FOR SCIENTISTS AND ENGINEERS Professor Raja Sengupta Spring 2010 Second Midterm Exam April 14, 2010 [30 points ~
More informationA Latex Template for Independent Work Reports Version 2016v3
Independent Work Report Fall, 2016 A Latex Template for Independent Work Reports Version 2016v3 Firstname Lastname Adviser: Firstname Lastname Abstract This document is intended to serve as a sample you
More informationIterative Methods for Linear Systems
Iterative Methods for Linear Systems 1 the method of Jacobi derivation of the formulas cost and convergence of the algorithm a Julia function 2 Gauss-Seidel Relaxation an iterative method for solving linear
More informationLINEARIZATION, NEWTON S METHOD BACKGROUND PREPARATIONS
LINEARIZATION, NEWTON S METHOD COMPUTER SESSION D3 BACKGROUND Question 1 PREPARATIONS The session is divided into two parts. The first part involves experimenting in the Mathematics Laboratory and the
More informationD2L QuickGuide: Dropbox Overview
Office of Distance Education Academic & Student Affairs, Colorado Mesa University D2L QuickGuide: Dropbox Overview The Dropbox tool allows you to set up assignments that students can turn in online. You
More informationWelcome to MTH 308 A/B!! Principles of Numerical Computation / Numerical Analysis and Scientific Computing
Welcome to MTH 308 A/B!! Principles of Numerical Computation / Numerical Analysis and Scientific Computing Contact Information Instructor : Office : 327, Faculty Building Phone : 7880 or 0512-259-7880
More informationStopping Criteria for Iterative Solution to Linear Systems of Equations
Stopping Criteria for Iterative Solution to Linear Systems of Equations Gerald Recktenwald Portland State University Mechanical Engineering Department gerry@me.pdx.edu Iterative Methods: High-level view
More informationINFS 2150 (Section A) Fall 2018
INFS 2150 (Section A) Fall 2018 Introduction to Web Development Class meets TUE & THU: 12:30am-1:45pm: in Wheatley 114 Instructor: Peter Y. Wu Office: Wheatley 309 Office Hours: Tuesday 9:00 am-12:00 noon;
More informationFondamenti di Informatica
Fondamenti di Informatica Scripts and Functions: examples lesson 9 2012/04/16 Prof. Emiliano Casalicchio emiliano.casalicchio@uniroma2.it Agenda Examples Bisection method Locating roots Secant methods
More information8 Piecewise Polynomial Interpolation
Applied Math Notes by R. J. LeVeque 8 Piecewise Polynomial Interpolation 8. Pitfalls of high order interpolation Suppose we know the value of a function at several points on an interval and we wish to
More informationCOMP229. Joanne Filotti
Course Outline School: Department: Program: Course Title: Course Code: School of Engineering Technology and Applied Science Information and Communication Engineering Technology Health Informatics Technology
More informationThe Bisection Method versus Newton s Method in Maple (Classic Version for Windows)
The Bisection Method versus (Classic Version for Windows) Author: Barbara Forrest Contact: baforres@uwaterloo.ca Copyrighted/NOT FOR RESALE version 1.1 Contents 1 Objectives for this Lab i 2 Approximate
More informationECE 204 Numerical Methods for Computer Engineers MIDTERM EXAMINATION /4:30-6:00
ECE 4 Numerical Methods for Computer Engineers ECE 4 Numerical Methods for Computer Engineers MIDTERM EXAMINATION --7/4:-6: The eamination is out of marks. Instructions: No aides. Write your name and student
More information4/2/2014 6:02:01 PM3/29/2014 9:17:13 PM Adapted from UbD Framework
Approximate Time Frame: 2-3 weeks Connections to Previous Learning: In previous units, students have worked with quadratic functions in various forms to determine their roots and vertices. They have used
More informationCPS352 Database Systems Syllabus Fall 2012
CPS352 Database Systems Syllabus Fall 2012 Professor: Simon Miner Fall Semester 2012 Contact: Simon.Miner@gordon.edu Thursday 6:00 9:00 pm KOSC 128 978-380- 2626 KOSC 243 Office Hours: Thursday 4:00 6:00
More informationAn Investigation into Iterative Methods for Solving Elliptic PDE s Andrew M Brown Computer Science/Maths Session (2000/2001)
An Investigation into Iterative Methods for Solving Elliptic PDE s Andrew M Brown Computer Science/Maths Session (000/001) Summary The objectives of this project were as follows: 1) Investigate iterative
More informationMath 180 Written Homework Solutions Assignment #1 Due Thursday, September 4th at the beginning of your discussion class.
Math 180 Written Homework Solutions Assignment #1 Due Thursday, September 4th at the beginning of your discussion class. Directions. You are welcome to work on the following problems with other MATH 180
More informationSAMPLE. ITS405: Intermediate Networking. Course Description and Outcomes. Participation & Attendance. Credit Hours: 3
ITS405: Intermediate Networking Credit Hours: 3 Contact Hours: This is a 3-credit course, offered in accelerated format. This means that 16 weeks of material is covered in 8 weeks. The exact number of
More informationMatlab and Octave: Quick Introduction and Examples 1 Basics
Matlab and Octave: Quick Introduction and Examples 1 Basics 1.1 Syntax and m-files There is a shell where commands can be written in. All commands must either be built-in commands, functions, names of
More informationA = [1, 6; 78, 9] Note: everything is case-sensitive, so a and A are different. One enters the above matrix as
1 Matlab Primer The purpose of these notes is a step-by-step guide to solving simple optimization and root-finding problems in Matlab To begin, the basic object in Matlab is an array; in two dimensions,
More informationThe Application of Numerical Approximation Methods upon Digital Images
American Journal of Signal Processing 217, 7(2): 39-43 DOI: 1.5923/j.ajsp.21772.1 The Application of Numerical Approximation Methods upon Digital Images Ali Jassim Mohamed Ali Department of Physics, College
More informationKing s Learning Institute
STUDENT GUIDANCE FOR SUBMITTING ASSIGNMENTS ONLINE King s Learning Institute Contents Faculty Policies Regarding the Online Submission of Work... 2 Attaching a Coversheet... 3 Uploading an Assignment...
More informationSolving Sparse Linear Systems. Forward and backward substitution for solving lower or upper triangular systems
AMSC 6 /CMSC 76 Advanced Linear Numerical Analysis Fall 7 Direct Solution of Sparse Linear Systems and Eigenproblems Dianne P. O Leary c 7 Solving Sparse Linear Systems Assumed background: Gauss elimination
More informationSYSTEMS OF NONLINEAR EQUATIONS
SYSTEMS OF NONLINEAR EQUATIONS Widely used in the mathematical modeling of real world phenomena. We introduce some numerical methods for their solution. For better intuition, we examine systems of two
More informationUpdated: 2/14/2017 Page 1 of 6
MASTER SYLLABUS 2017-2018 A. Academic Division: Business, Industry, and Technology B. Discipline: Engineering Technology C. Course Number and Title: ENGR1910 Engineering Programming D. Course Coordinator:
More informationSummer 2017 ECE 3056
Assignment 2 Due Dates: Part I C++ Program: 11:55 pm, Friday June 2 nd, 2017 Part II Homework Problems: Prior to the beginning of class, Thursday June 1 st, 2017 NOTE: for students in Atlanta, you are
More informationApproximate First and Second Derivatives
MTH229 Project 6 Exercises Approximate First and Second Derivatives NAME: SECTION: INSTRUCTOR: Exercise 1: Let f(x) = sin(x 2 ). We wish to find the derivative of f when x = π/4. a. Make a function m-file
More informationf xx + f yy = F (x, y)
Application of the 2D finite element method to Laplace (Poisson) equation; f xx + f yy = F (x, y) M. R. Hadizadeh Computer Club, Department of Physics and Astronomy, Ohio University 4 Nov. 2013 Domain
More informationFundamentals of Computer Science CSCI 136 Syllabus Fall 2018
Fundamentals of Computer Science CSCI 136 Syllabus Fall 2018 CSCI 136 Section 00 Instructor: Michael Cassens Office: SS 411 Office Hours: MWF 11:00-11:50 am or by appt Phone: (415) 787-0577 E-mail: michael.cassens@mso.umt.edu
More informationSAMPLE. ITS430 Network Enterprise Solutions. Course Description and Outcomes. Participation & Attendance. Credit Hours: 3
ITS430 Network Enterprise Solutions Credit Hours: 3 Contact Hours: This is a 3-credit course, offered in accelerated format. This means that 16 weeks of material is covered in 8 weeks. The exact number
More informationspecified or may be difficult to handle, we often have a tabulated data
Interpolation Introduction In many practical situations, for a function which either may not be explicitly specified or may be difficult to handle, we often have a tabulated data where and for In such
More informationInstructions for Exam Entry May 2012
Instructions for Exam Entry May 2012 It is important that you read these instructions carefully before you complete your exam entry online. You can enter online for the May 2012 exams from 1 February 2012.
More informationFAU. How do I. Post course content? Folders
How do I Post course content? Content is made up of folders, files, links, and assessments (this will be covered on page ## or see separate documentation). It is basically anything you want to share with
More informationAC : MATHEMATICAL MODELING AND SIMULATION US- ING LABVIEW AND LABVIEW MATHSCRIPT
AC 2012-4561: MATHEMATICAL MODELING AND SIMULATION US- ING LABVIEW AND LABVIEW MATHSCRIPT Dr. Nikunja Swain, South Carolina State University Nikunja Swain is a professor in the College of Science, Mathematics,
More informationIntroduction to numerical algorithms
Introduction to numerical algorithms Given an algebraic equation or formula, we may want to approximate the value, and while in calculus, we deal with equations or formulas that are well defined at each
More informationDepartment of Mathematical Sciences, FAU. Instructions:
Instructions: * This is a computer-based assignment (Total points: 8). Please write your code that runs in Python. (1) Submission: Your codes/programs must be submitted electronically by email to sbai@fau.edu
More informationMAT 4199C/5107 Second Homework Assignment Due 13 Feb by 1:00pm
Marks: LAST NAME: First name: Student number: MAT 4199C/5107 Second Homework Assignment Due 13 Feb. 2019 by 1:00pm Instructions: The question labelled (U) is for undergraduate students only, while question
More informationBlackboard Basics. Please see handout for information on how to get to the CUNY Portal and log in to Blackboard.
Blackboard is a course management platform that allows instructors to interact with students and put their classes on the Internet without having to be experts in HTML or web development. Using Blackboard
More informationKOMAR UNIVERSITY OF SCIENCE AND TECHNOLOGY (KUST)
Programming Concepts & Algorithms Course Syllabus Course Title Course Code Computer Department Pre-requisites Course Code Course Instructor Programming Concepts & Algorithms + lab CPE 405C Computer Department
More informationCS 450 Numerical Analysis. Chapter 7: Interpolation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationPhiladelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008. Course Syllabus
Philadelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008 Course Syllabus Course Title: Compiler Construction Course Level: 4 Lecture Time: Course
More informationAdvanced Client-Side Web Programming CSCI 491/595 Syllabus Fall 2018
Advanced Client-Side Web Programming CSCI 491/595 Syllabus Fall 2018 CSCI 491/595 Section 00 Instructor: Michael Cassens Office: SS 411 Office Hours: MWF 11:00-11:50 am or by appt Phone: (415) 787-0577
More informationPIC 10B Lecture 1 Winter 2014 Homework Assignment #2
PIC 10B Lecture 1 Winter 2014 Homework Assignment #2 Due Friday, January 24, 2014 by 6:00pm. Objectives: 1. To overload C++ operators. Introduction: A set is a collection of values of the same type. For
More informationUnit #11 : Integration by Parts, Average of a Function. Goals: Learning integration by parts. Computing the average value of a function.
Unit #11 : Integration by Parts, Average of a Function Goals: Learning integration by parts. Computing the average value of a function. Integration Method - By Parts - 1 Integration by Parts So far in
More informationCmpt 101 Lab 1 - Outline
Cmpt 101 Lab 1 - Outline Instructions: Work through this outline completely once directed to by your Lab Instructor and fill in the Lab 1 Worksheet as indicated. Contents PART 1: GETTING STARTED... 2 PART
More informationWhat is Multigrid? They have been extended to solve a wide variety of other problems, linear and nonlinear.
AMSC 600/CMSC 760 Fall 2007 Solution of Sparse Linear Systems Multigrid, Part 1 Dianne P. O Leary c 2006, 2007 What is Multigrid? Originally, multigrid algorithms were proposed as an iterative method to
More informationAssignment #2: False Position Method
University of Puerto Rico Mayaguez Campus Department of Electrical & Computer Engineering Assignment #2: False Position Method Osvaldo M. Cardona 841-08-0990 Diana Rivera Negrón 802-08-6908 Ricardo I.
More informationEE3315 Internet Technology EE3315 Internet Technology Overview Slide 1
EE3315 Internet Technology http://www.cityu.edu.hk/ug/current/course/ee3315.htm EE3315 Internet Technology Overview Slide 1 Course Aim This course aims to provide students with the knowledge of key protocols
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 20: Sparse Linear Systems; Direct Methods vs. Iterative Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 26
More informationPortfolio Report (for all weekly practicals)
Portfolio Report (for all weekly practicals) Getting Started Worth 15%, due in Week 13 6:00pm Fri 26 th Oct You ll learn, from this unit, using IT more effectively as a university student. For this purpose,
More informationAn Introduction to Numerical Analysis
Weimin Han AMCS & Dept of Math University of Iowa MATH:38 Example 1 Question: What is the area of the region between y = e x 2 and the x-axis for x 1? Answer: Z 1 e x 2 dx = : 1.9.8.7.6.5.4.3.2.1 1.5.5
More informationHomework Project #6. Math 365, Spring Due Wednesday April 27th
Name : Homework Project #6 Math 365, Spring 2016 Due Wednesday April 27th You may work with a partner on this assignment and turn in a single assignment for the both of you. 1. (Using fzero) Consider the
More information5. SUBMISSION OF WORK
5. SUBMISSION OF WORK You are required to hand in coursework by the dates specified by your tutors as detailed in the module outlines. For all deadlines for AM-coded modules, work must be submitted by
More informationCOURSE SYLLABUS ****************************************************************************** YEAR COURSE OFFERED: 2015
****************************************************************************** YEAR COURSE OFFERED: 2015 SEMESTER COURSE OFFERED: SPRING DEPARTMENT: COMPUTER SCIENCE COURSE NUMBER: 20019 Room and Time:
More informationSetting up a Turnitin Dropbox
Setting up a Turnitin Dropbox Turn editing on Add an activity or resource Choose Turnitin Assignment 2 General Turnitin Assignment Name the name that will appear on the homepage eg. Assignment 1 submission
More informationUsing Turnitin for electronic submission and marking of assignments: guidance paper for staff.
Using Turnitin for electronic submission and marking of assignments: guidance paper for staff. College of Nursing, Midwifery and Health Care June 2011 Catherine Lynch amended April 2012, February 2013,
More informationCSCE 441 Computer Graphics Fall 2018
CSCE 441 Computer Graphics Fall 2018 Meetings: Monday, Wednesday, Friday 9:10-10:00 a.m. Location: HRBB 113 Instructor: Dr. John Keyser Office: 527C, H.R. Bright Building Phone: 458-0167 Email: keyser@cse.tamu.edu
More informationN/A. Yes. Students are expected to review and understand all areas of the course outline.
Course Outline School: Department: Course Title: Eng. Tech. & Applied Science Information and Communication Engineering Technology (ICET) Adv. Web Application Developme Course Code: COMP 229 Course Hours/Credits:
More information