MAPA INSTITUTE OF TECHNOLOGY School of EE-ECE-COE

VISION Mapa shall be an international center of excellence in technology education by: providing instructions that are current in content and state-of-the art in delivery; engaging in cutting-edge research; and responding to the big local and global technological challenges of the times MISSION a) The mission of Mapa Institute of Technology is to disseminate, generate, preserve and apply scientific, engineering, architectural and IT knowledge. b) The Institute shall, using the most effective means, provide its students with professional and advanced scientific and engineering, architectural and information technology education through rigorous and up-to-date academic programs with ample opportunities for the exercise of creativity and the experience of discovery. c) It shall implement curricula that, while being steeped in technologies, shall also be rich in the humanities, languages and social sciences that will inculcate ethics. d) The Institute shall advance and preserve knowledge by undertaking research and reporting on the results of such inquiries. e) The Institute, singly or in collaboration with others, shall bring to bear the world's vast store of knowledge in science, engineering and other realms on the problems of the industry and the community in order to make the Philippines and the world a better place. PROGRAM EDUCATIONAL OBJECTIVES MISSION b c addressed by DLHS d e

a 1. To equip graduates with a broad foundation of basic engineering concepts and fundamentals of Electronics Engineering. 2. To develop in graduates the capability to apply learned concepts in engineering design and to implement them as a practicing engineers. 3. To inculcate in graduates the importance of lifelong learning. 4. To develop in graduates an appreciation of technology and determine its application in the advancement of society.

COURSE SYLLABUS

1. Course Code 2. Course Title 3. Pre-requisite 4. Co-requisite

: : : :

ECE60 Numerical Methods with Computing MATH24 None : 3 units

5. Credit/ Class Schedule 6. Course Description

: This course covers the concepts of numerical analysis and computer software tools dealing with engineering problems. It includes techniques in finding the roots of an equation, solving systems of linear and non-linear equations, eigenvalue problems, polynomial approximation and interpolation, ordinary and partial differential equations. The Monte-Carlo method, simulations, error propagation and analysis, the methods of least squares and goodness-of-fit tests, are also discussed
Date Effective: Date Revised: Prepared by: Approved by:

Course Title:

Numerical Methods with Computing

April 2009

January 2009

D. Castro

FSCaluyo

Page 1 of 7

7. Program Outcomes and Relationship to Program Educational Objectives

Program Outcomes An ability to apply knowledge of mathematics, science, and engineering An ability to design and conduct experiments, as well (b) as to analyze and interpret data An ability to design a system, component, or process (c) to meet desired needs (a) (d) An ability to function on multi-disciplinary teams (e) (f) (g) (h) (i) An ability to identify, formulate, and solve engineering problems An understanding of professional and ethical responsibility An ability to communicate effectively The broad education necessary to understand the impact of engineering solutions in a global and societal context A recognition of the need for, and an ability to engage in life-long learning An ability to use the techniques, skills, and modern engineering tools necessary for engineering practice. Program Educational Objectives 1 2 3 4

(j) A knowledge of contemporary issues (k)

8. Course Objectives and Relationship to Program Outcomes:

Course Objectives The students should be able to: 1. To know the applications of numerical analysis and understand its theoretical concepts to effectively solve engineering problems 2. Learn to use available computer software tools in attaining fast and more accurate results 3. To learn to analyze and choose the best method for discipline related problems in a team oriented environment a b Program Outcomes c d e f g h i j k

9. Course Coverage

METHODOLOGY & WEEK DAY TOPIC STRATEGY EVALUATION TOOLS 1 1 Orientation; Mission, Vision, DECIR, Lecture Grading System 2 Introduction Lecture, assigned Quizzes, board work, readings oral recitation, Mathematical Background computer based Computer Modeling and structure assignments Approximation and Round-off and Truncation errors
Course Title: Date Effective: Date Revised: Prepared by: Approved by:

Numerical Methods with Computing

April 2009

January 2009

D. Castro

FSCaluyo

Page 2 of 7

Taylor Series 3 Non-linear / Transcendental Functions Graphical Bracketing Method - Bisection 2 1 Bracketing Method - Regula-Falsi (False position Method) Examples 2 3 Additional Problems Non-Bracketing / Open Methods Fixed-point (MOSS) Newton Raphson 3 1 Non-Bracketing / Open Methods > Secant Method 2 3 4 1 Additional Problems / SW Quiz #1 Roots of polynomial > Muellers method > Bairstows Method 2 Additional Problems / SW Lecture, assigned readings Lecture, assigned readings Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Lecture, assigned readings Lecture, assigned readings Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Lecture, assigned readings Lecture, assigned readings Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments

System of Linear Equations > Gauss Jordan > Gauss LU Decomposition

> Gauss Seidel method > Gauss Jacobi method

Lecture, assigned readings

Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments

Additional Problems / SW

Lecture, assigned readings

Quiz #2

Lecture, assigned readings

Curve Fitting / Interpolation > Least-square Regression > Linear / Polynomial Regression

Interpolation > Divided difference > Lagrange interpolating Polynomial

Lecture, assigned readings

Quizzes, board work, oral recitation, computer based assignments

Approved by:

Course Title:

Date Effective:

Date Revised:

Prepared by:

Numerical Methods with Computing

April 2009

January 2009

D. Castro

FSCaluyo

Page 3 of 7

Additional Problems / SW

Lecture, assigned readings

Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Quizzes, board work, oral recitation, computer based assignments Final Exam

Quiz #3

Lecture, assigned readings

Integration > Trapezoidal Rule > Simpsons 1/3 Rule > Simpsons 3/8 Rule

Lecture, assigned readings

> Multiple Applications of integration techniques

Lecture, assigned readings

Additional Problems / SW

Lecture, assigned readings

Differentiation High Accuracy Diff Formula

Lecture, assigned readings

Richardsons extrapolation Additional Problems / SW

Lecture, assigned readings

Quiz # 4

Lecture, assigned readings

Ordinary Differential Equations (ODE) > Runge-kutta > Euler

Lecture, assigned readings

Additional Problems / SW

Lecture, assigned readings

10

Boundary Value / Eigen Value Engineering Problem Case Study

Lecture, assigned readings

Open day / Review

Lecture, assigned readings

3 11

Quiz #5 FINAL EXAM

Course Title:

Date Effective:

Date Revised:

Prepared by:

Approved by:

Numerical Methods with Computing

April 2009

January 2009

D. Castro

FSCaluyo

Page 4 of 7

10. Course Outcomes and Relationship to Course Objectives/ Program Outcomes

Course Outcomes A student completing this course should at the minimum be able to: 1. Gain a fundamental understanding of the importance of computers and role of approximations and errors in the implementation and development of numerical methods (a,b,e,i,k) 2. Solve for roots of nonlinear equations using both bracketing and open methods (bisection, regula-falsi, false-position, fixed-point, Newton raphson, and secant) (a,b,e,i,k) 3. Understand the difference between bracketing and open methods for root location (a,b,e,k) 4. Know why bracketing methods always converge, whereas open methods may sometimes diverge (a,b,e,k) 5. Know the method for solving a polynomial and ability to deal with complex roots. (a,b,e,k) 6. Solve linear algebraic equations using elimination, LU Decomposition and iterative Jacobi/Seidel technique. (a,b,e,k) 7. Develop a working knowledge on computer algorithm to solve linear algebraic equations (gauss elimination and gaussseidel). (a,b,e,k) 8. Understand the fundamental difference between regression and Interpolation (a,b,e,h,k) 9. Learn the least-square method, divided difference, and Lagrange interpolating polynomial and to asses their
Course Title: Date Effective:

Course Objectives 1 2 3

Program Outcomes a b c d e f g h i j k

Date Revised:

Prepared by:

Approved by:

Numerical Methods with Computing

April 2009

January 2009

D. Castro

FSCaluyo

Page 5 of 7

reliability to fit curves to a given data set (a,e) 10. Understand the derivation of Newton-Cotes formula; understand trapezoidal rule and Simpsons rule. (a,e,k 11. Demonstrate an understanding of numerical integration, differentiation and its application (a,e,k) 12. Know the relationship of Eulers method to the Taylor series expansion and the insight it provides regarding the error of the method (a,e) 13. Know the general form of Runge-Kutta methods and apply them to systems of equations (a,e,k) 14. Demonstrate an understanding of the numerical methods to solve ordinary differential equations. (a,e,k)

11. Contribution of Course to Meeting the Professional Component:

Engineering topics 90% General education component 10 %

12. Textbook

None :

13. Course Evaluation

The minimum requirement for a passing grade is 60% final grade average from the following: Quizzes / Machine Problem / Assignments Final Examination TOTAL 70 % 30 % 100 %

Aside from academic deficiency, other grounds for a failing grade are: Cheating during examinations More than 20 % of the total number of meetings missed in a quartermester Failure to take the final examination with no valid excuse.

14. Other References

Applied Numerical Analysis by Curtis F. Gerald and Patrick O. Wheatley 7th ed.,Greg Tobin, Pearson Addison Wesley 2004. An introduction to numerical methods and analysis by Epperson, James F., 2002
Course Title: Date Effective: Date Revised: Prepared by: Approved by:

Numerical Methods with Computing

April 2009

January 2009

D. Castro

FSCaluyo

Page 6 of 7

15. Course Materials Made Available:

Course goals and instructional objectives Course schedule for lectures and exams End of course self-assessment report

16. Committee Members:

Daniel M. Castro dmcastro@mapua.edu.ph Ramon G. Garcia rggarcia@mapua.edu.ph Carlos C. Hortinela IV cchortinela@mapua.edu.ph 247-5000 local 2300

Course Title:

Date Effective:

Date Revised:

Prepared by:

Approved by:

Numerical Methods with Computing

April 2009

January 2009

D. Castro

FSCaluyo

Page 7 of 7