250325 - METNUMER - Numerical Methods



Similar documents
SICSB - Information Systems and Communications for Health Services

AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS

Numerical Analysis An Introduction

Numerical Analysis Introduction. Student Audience. Prerequisites. Technology.

Syllabus for MTH 311 Numerical Analysis

Numerical Methods for Engineers

ACMSM - Computer Applications in Solids Mechanics

AIGI - Smart Airport and Facility Management

PSEAEREE - Electronic System Design Applied to Renewable Energy and Energy Efficiency

ET - Electronics for Telecommunications

GEEN - Energy Management

MTH 437/537 Introduction to Numerical Analysis I Fall 2015

Numerical Analysis. Professor Donna Calhoun. Fall 2013 Math 465/565. Office : MG241A Office Hours : Wednesday 10:00-12:00 and 1:00-3:00

Machine Design and Manufacturing Technologies

DFINA1 - Financial Management I: Investment

Computer programming course in the Department of Physics, University of Calcutta

GEET-I6O32 - Ict Business Management

IES - Introduction to Software Engineering

Mean value theorem, Taylors Theorem, Maxima and Minima.

Project Management

Bachelor's Thesis

FOPR-I1O23 - Fundamentals of Programming

240EO035 - Information Systems

Learning outcomes. Knowledge and understanding. Competence and skills

Flight Mechanics

240ST Operations Management in the Supply Chain

Numerical Methods. Numerical Methods. for Engineers. for Engineers. Steven C. Chapra Raymond P. Canale. Chapra Canale. Sixth Edition.

240EO016 - Process Automation

GPS - Software Project Management

PI - Internet Protocols

IMIT - Innovation Management and International Trade

MATHEMATICS (MATH) 3. Provides experiences that enable graduates to find employment in sciencerelated

Energy and Construction

Environmental Science and Technology

AND - Non-Destructive Testing

Fluid Mechanics

WSE - Writing Skills for Engineering

HIDHID - Hydraulics and Hydrology

COURSE DESCRIPTOR Signal Processing II Signalbehandling II 7.5 ECTS credit points (7,5 högskolepoäng)

NUMERICAL ANALYSIS PROGRAMS

240IOI21 - Operations Management

ME 7103: Theoretical Vibrations Course Notebook

DIRRH - Human Resource Management

4.3 Lagrange Approximation

BACHELOR S DEGREE IN BUSINESS ADMINISTRATION FIRST YEAR PROFESSORS, GROUPS AND TIMETABLES

AC : MATHEMATICAL MODELING AND SIMULATION US- ING LABVIEW AND LABVIEW MATHSCRIPT

Program description for the Master s Degree Program in Mathematics and Finance

Arithmetic and Algebra of Matrices

Applied Computational Economics and Finance

CS 2750 Machine Learning. Lecture 1. Machine Learning. CS 2750 Machine Learning.

240EO026 - Technical Entrepreneurship

MICRO - General and Ocular Microbiology

4.5 Chebyshev Polynomials

240EI032 - Human Resources Management

Universidad de Alcalá

Machine Learning and Data Mining. Regression Problem. (adapted from) Prof. Alexander Ihler

DSAP - Digital Speech and Audio Processing

Teaching Plan. Financial Statement Analysis

ATV - Lifetime Data Analysis

ALGEBRAIC EIGENVALUE PROBLEM

Mathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours

PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION

Prentice Hall Connected Mathematics 2, 7th Grade Units 2009

E7 Spring 2013 Syllabus

NEURAL NETWORKS A Comprehensive Foundation

240EI532 - Human Resources

Bachelor Degree in Business Administration Academic year 2015/16

GEC320 COURSE COMPACT. Four hours per week for 15 weeks (60 hours)

ITSM - Information Technology Service Management

(Quasi-)Newton methods

EIGE - Economics and Business Administration

SYLLABUS. OFFICE AND HOURS: Karnoutsos 536 (Access through K506) M 12, T 1, R 10, 12, 2 or by appointment. I am available by at all times.

BMAC - Basic Mathematics for Algebraic Coding Theory with Applications to Cryptography

COURSE SYLLABUS. Brazosport College. Math 1314 College Algebra. Office: J.227. Phone:

Piecewise Cubic Splines

TXC - Computer Network Technology

240AU312 - Rapid Prototyping

COMPC2 - Cost Accounting II

Numerical Recipes in C++

Principles of Scientific Computing Nonlinear Equations and Optimization

Transcription:

Coordinating unit: 250 - ETSECCPB - Barcelona School of Civil Engineering Teaching unit: 751 - ECA - Department of Civil and Environmental Engineering Academic year: Degree: 2015 BACHELOR'S DEGREE IN GEOLOGICAL ENGINEERING (Syllabus 2010). (Teaching unit Compulsory) ECTS credits: 6 Teaching languages: Catalan, Spanish Teaching staff Coordinator: Others: JOSE SARRATE RAMOS JESUS CORRAL LOPEZ, JOSE SARRATE RAMOS Opening hours Timetable: Office hours will be announced at the beginning of the course. Degree competences to which the subject contributes Specific: 4050. Basic knowledge of computer use and programming, operating systems, databases and software as applied to engineering Transversal: 592. EFFICIENT ORAL AND WRITTEN COMMUNICATION - Level 2. Using strategies for preparing and giving oral presentations. Writing texts and documents whose content is coherent, well structured and free of spelling and grammatical errors. 595. TEAMWORK - Level 2. Contributing to the consolidation of a team by planning targets and working efficiently to favor communication, task assignment and cohesion. 599. EFFECTIVE USE OF INFORMATI0N RESOURCES - Level 3. Planning and using the information necessary for an academic assignment (a final thesis, for example) based on a critical appraisal of the information resources used. 602. SELF-DIRECTED LEARNING - Level 3. Applying the knowledge gained in completing a task according to its relevance and importance. Deciding how to carry out a task, the amount of time to be devoted to it and the most suitable information sources. 584. THIRD LANGUAGE. Learning a third language, preferably English, to a degree of oral and written fluency that fits in with the future needs of the graduates of each course. Teaching methodology The course consists of 3.6 hours per week of classroom activity (large size group). The 1.8 hours in the large size groups are devoted to theoretical lectures, in which the teacher presents the basic concepts and topics of the subject, shows examples and solves exercises. The rest of weekly hours devoted to laboratory practice. Support material in the form of a detailed teaching plan is provided using the virtual campus ATENEA: content, program of learning and assessment activities conducted and literature. Learning objectives of the subject 1 / 7

Students will acquire an understanding of the basic concepts of numerical methods, such as interpolation, integration and the solution of systems of equations. They will also learn how these concepts apply to basic and applied technological problems. Upon completion of the course, students will be able to: 1. Use standard software to solve basic problems; 2. Use numerical analysis software to conduct sensitivity analyses of problems involving the solution of ordinary differential equations; 3. Use numerical techniques to solve engineering problems. Numbers, algorithms and error analysis; Determination of zeros of functions; Solution of systems of equations using direct methods and basic iterative methods; Solution of nonlinear systems of equations; Eigenvalue problems: Approximation and interpolation; Numerical quadrature; Computers and programming, operating systems, databases and engineering software Study load Total learning time: 150h Theory classes: 26h 17.33% Practical classes: 8h 5.33% Laboratory classes: 26h 17.33% Guided activities: 6h 4.00% Self study: 84h 56.00% 2 / 7

Content Introduction to Programming in Matlab Learning time: 28h 47m Laboratory classes: 12h Self study : 16h 47m Description of the Matlab programming environment. Constants and variables. Arithmetic Operators. Intrinsic functions of Matlab. Basic I/O functionst. Matlab files. Definition of vectors. Arithmetic Operators and functions with vectors. Curve plotting. Definition of arrays. Arithmetic Operators and functions with arrays. Surface plotting. Defining functions in a file of Matlab. Using functions. Conditional Structures: If block. Relational operators. Structures of repetition: while and do blocks. Statements break and return. Solving engineering problems with the computer To know the Matlab environment. Being able to draw curves and surfaces using Matlab To know the basics of structured programming To know the flow control statements Being able to develop applications in Matlab Error propagation Learning time: 9h 36m Theory classes: 2h Laboratory classes: 2h Self study : 5h 36m Introduction. Computer representation of integers and real numbers. Rounding error and truncation error. Number of significant digits. Error propagation. Case studies that show the problems generated by the propagation of rounding error. To know the representation of integers and real numbers in the computer. Understand the concept and definitions of the error. To know that it can increase with the arithmetic operations 3 / 7

Roots of nonlinear functions Learning time: 19h 12m Theory classes: 4h Laboratory classes: 2h Self study : 11h 12m Motivation. General approach. Bisection method. Practical convergence criteria. Order of convergence. Newton's method. Analysis of the order of convergence. Modified methods: the secant method and the Whittaker method. Root finding techniques for solving problems in engineering Solving root finding problems Understand how iterative methods work and their requirements To know the basic properties of Newton methods Applying the knowledge acquired on iterative methods for zeros of functions to solve problems. Solving systems of linear equations Learning time: 38h 24m Theory classes: 10h Laboratory classes: 4h Self study : 22h 24m Motivation. Classification of the methods. Solving trivial systems. Introduction to elimination methods. Properties and algorithm of the Gauss method. Other methods. Introduction to decomposition methods. Classification. Properties and algorithm of the Crout method. Properties ans algorithm of the Cholesky method Applying linear system methods to solve engineering problems Introduction to iterative methods. Condition number. Algorithms and properties of stationary methods. Practical convergence criteria. Introduction. Equivalence with the minimization problem. Steepest descent method. Algorithm and properties of the conjugate gradient method. Solving problems on methods for systems of linear equations. Know the classification of methods for solving systems of linear equations. To know the properties of the elimination methods. To know the properties of the decomposition methods. Understand how iterative methods can be used to solve a linear system and their requirements To demonstrate knowledge and understanding of the conjugate gradient method and how to implement it. Applying the knowledge about methods for systems of linear equations to solve problems. 4 / 7

Approximation and interpolation Learning time: 24h Theory classes: 6h Laboratory classes: 2h Self study : 14h Introduction to interpolation. General approach. Fundamental theorem of interpolation. Lagrange interpolation. Introduction to sectional interpolation. General approach. Spline C0. Splines C1. Limitations of the interpolation with splines. Motivation. General approach. Normal equations. Linear regression. Using orthogonal polynomials. Application of interpolation and approximation techniques to solve engineering problems Solving problems on approximation and interpolation. Learn the criteria and the types of functional approximation and learn the properties and how to use the Lagrange interpolation. To know and use the polynomial sectional interpolation. Understand and know the basic properties of least squares problem. Applying the knowledge acquired on interpolation and approximation methods to solve problems. Numerical integration Learning time: 24h Theory classes: 4h Laboratory classes: 4h Self study : 14h Introduction to numerical integration. General approach. Classification. Newton-Cotes rule. Composite rules. Introduction to Gaussian integration. Problem statement. Orthogonal polynomials. Gaussian quadratures. Applying numerical integration techniques to solve engineering problems. Solving problems on numerical integration. To know the classification of numerical integration methods. To understand the basics of Newton-Cotes quadratures. To know the advantages and disadvantages of composite quadratures. To understand the basics of Gauss quadratures. To know the convergence of studied quadratures Applying the knowledge acquired on integration methods to solve problems. 5 / 7

Qualification system The final grade of the course are obtained from the group assessment test (practical projects) and from the individual assessment tests (programming tees, exams,...). During the course students will carry out several practical projects. At its completion the students will work in groups and will apply the acquired knowledge to solve engineering problems. During the course there will be three individual assessment tests: a programming test and two exams. The programming test will consist on several exercises that students must solve using the computer. The exams will consist of a part with questions on concepts associated with learning objectives in terms of subject knowledge and understanding, and a set of application exercises. The grade for the group assessment test or practical projects (GT) is the average grade for all practical projects. The grade for individual assessment tests (IT) is the weighted average grade of the programming test and the exams, according to: IT = 0.16 PT + 0.28 Ex1 + 0.28 Ex2 + + 0.28 Ex3 where PT = Grade corresponding to the programming test EX1 = Grade corresponding to the first exam Ex2 = Grade corresponding to the second exam Ex3 = Grade corresponding to the third exam The final grade for the course (FG) is calculated according to the expression: FG = GT ^ (1 / 4) * IT ^ (3 / 4) Criteria for re-evaluation qualification and eligibility: Students that failed ordinary evaluation and have been regularly attending tests throughout the course will have the option to perform a re-evaluation test during the period specified in the academic calendar. The highest mark for the subject in the case of attending the evaluation exam will be five. In the case of justified absences to the regular evaluation tests that prevent the assessment of some parts of the contents of the subject, with prior approval of the Head of Studies, students may get evaluated by the re-evaluation test of the contents that have not been previously examined as well as the contents whose tests students have failed. The limitation on the maximum mark shall not apply to the parts assessed for the first time. Regulations for carrying out activities It is mandatory to pass this subject to submit all the reports corresponding to practical projects on due time. Failure to perform an exam in the scheduled period will result in a mark of zero in that exam 6 / 7

Bibliography Basic: Recktenwald, G.W. Numerical methods with MATLAB: implementations and applications. Upper Saddle River: Prentice Hall, 2000. ISBN 0201308606. Mathews, J.H.; Fink, K.D. Métodos numéricos con MATLAB. 3a ed. Madrid: Prentice Hall, 2000. ISBN 8483221810. Kincaid, D.; Cheney, W. Análisis numérico: las matemáticas del cálculo científico. Argentina: Addison-Wesley Iberoamericana, 1994. ISBN 0201601303. Huerta, A.; Sarrate, J.; Rodríguez-Ferran, A.. Métodos numéricos: introducción, aplicaciones y programación. Barcelona: Edicions UPC, 2001. ISBN 8483015226. Isaacson, E.; Keller, H.B. Analysis of numerical methods. New York: Dover, 1994. ISBN 0486680290. Complementary: Nakamura S.. Análisis numérico y visualización gráfica con Matlab. Mexico: Prentice Hall, 1997. Burden R.L., FairesJ.D,. Análisis Numérico. Mexico: International Thompson Editores, 1998. Ralston, A.; and Rabinovitz, P.. A First Course in Numerical Analysis. New York: Mc Graw-Hill, 1978. Hoffman, J.D.. Numerical methods for engineers and scientifists. New York: McGraw Hill, 2001. Hildebrand, F.B.. Introduction to numerical analysis. Mineola, New York: Dover Publications, 1987. 7 / 7