Fall 2009

CSE 3802/ECE 3431 Sec 01
Class Web Page



 

Russell, Bertrand (1872-1970)
Calculus required continuity, and continuity was supposed to require the infinitely little; but nobody could discover what the infinitely little might be.

Bernoulli, Johann
But just as much as it is easy to find the differential of a given quantity, so it is difficult to find the integral of a given differential. Moreover, sometimes we cannot say with certainty whether the integral of a given quantity can be found or not.


                                       

 Quadrature

image



Welcome to the CSE 3802/ESE 3431 web page.   Please take a few minutes to click on each of the links below. They will provide you with important and useful information about this course.

Numerical analysis is a tool used by scientists and engineers everywhere to solve difficult problems which have no obvious closed form mathematical solution. Here we will learn several techniques for solving such problems. Both the strong and weak points of the various techniques will be examined.

Good luck and enjoy the class!

 

 

Course Information:

            

Evaluation:

            

 


Introduction

This course reinforces the theory and development of numerical algorithms for scientific computation with emphasis on speed, accuracy, and algorithm design strategy. Applications to the solution of problems in science and engineering are discussed, and assignments are organized to reinforce the discussions. Testing is required to investigate the reliability and efficiency of implemented designs. Experience is gained in the process by utilizing this testing feedback to improve the design strategy.

back to top


Course Description

Introduction to the numerical algorithms fundamental to scientific computation. Equation solving, function approximation, integration, difference and differential equations, special computer techniques. Emphasis is placed on efficient use of computers to optimize speed and accuracy in numerical computations. Extensive digital computer usage for algorithm verification.

back to top


Text

J.H.Mathews and K. Fink, Numerical Methods Using MATLAB, 4th ed., Prentice Hall, 2004.

back to top

Topics:

1. Errors in machine computation.

2. Mathematical preliminaries.

3. Solution of simultaneous linear equations, Ax = b.

4. Solution of nonlinear equations, solving the scalar equations, f(x) = 0, and     g(x)=x.

5. Polynomial root finding.

6. Approximation, polynomial interpolation techniques.

7. Least squares.

8. Integration.

9. Solving ordinary differential equations.

10. Function minimization.

Laboratory Projects:

Three or four major programming assignments requiring design of software to implement an application of particular topic above. A written report is required. Smaller programming assignments on the topics not covered by the major assignments may also be required. Algorithm comparison may be required between student programs and other algorithms determined by the instructor.

back to top


Course Schedule and Instructor Information

Course
Section
Time
Day
Room
Instructor
CSE 3802 /ECE 3431 001 6:30-9:30 PM Tu  CAST 204 John Roulier

Office Hours 

Tuesday 3:30-5:30 and by appointment in my office ITEB 359

back to top


Student Information

Academic Integrity

A fundamental tenet of all educational institutions is academic honesty; academic work depends upon respect for and acknowledgement of the research and ideas of others. Misrepresenting someone else's work as one's own is a serious offense in any academic setting and it will not be condoned.

Academic misconduct includes, but is not limited to, providing or receiving assistance in a manner not authorized by the instructor in the creation of work to be submitted for academic evaluation (e.g. papers, projects, and examinations); any attempt to influence improperly (e.g. bribery, threats)any member of the faculty, staff, or administration of the University in any matter pertaining to academics or research; presenting, as one's own,the ideas or words of another for academic evaluation; doing unauthorized academic work for which another person will receive credit or be evaluated; and presenting the same or substantially the same papers or projects in two or more courses without the explicit permission of the instructors involved.

A student who knowingly assists another student in committing an act of academic misconduct shall be equally accountable for the violation, and shall be subject to the sanctions and other remedies described in The Student Code.

Support Services

The Dean of Students Office provides student support services in a number of areas. The following websites and phone numbers can be used to access these services:

back to top


Grading

In this section your grade will be based on the following:

Exams

50%

Projects

50%

 

 

 

back to top


Exams and Projects
No make-ups on exams will be granted unless a case of an emergency occurs.

You will be notified about the content and date of exams to be given during the semester. In this section there will be two hour exams. The first hour exam will be given in late September. The second hour exam will be given in November before Thanksgiving recess. Details will be posted at a later time, and exams will be announced in class.

Project 1

Project1 example for debugging

Sample exam 1

If you need exam accomodations based on a documented disability, you need to speak with both the Center for Students with Disabilities and the course instructor within the first two weeks of the semester.

Final Exam

The Final Exam is scheduled on 12/15 from 6:00PM- 8:00PM. This exam will cover all the material discussed throughout the semester.

back to top

Final Exam Schedule

Subject
Class
Section
Date
Day
Time
Location
 CSE/ECE  3802/3431  001  December 15  Tuesday  6:00PM-8:00PM

 CAST 204

Emergency closing information

For more detailed information go to: http://www.registrar.uconn.edu/examinfo.html