Outline Announcements –Add/drop today! –HWI due Friday Discrete Approximations Numerical Linear Algebra Solving ODE’s Solving PDE’s.

Slides:



Advertisements
Similar presentations
Roundoff and truncation errors
Advertisements

2009 Spring Errors & Source of Errors SpringBIL108E Errors in Computing Several causes for malfunction in computer systems. –Hardware fails –Critical.
Algebraic, transcendental (i.e., involving trigonometric and exponential functions), ordinary differential equations, or partial differential equations...
Topics covered: Floating point arithmetic CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
MATH 685/ CSI 700/ OR 682 Lecture Notes
Simultaneous Linear Equations
Solution of linear system of equations
Major: All Engineering Majors Author(s): Autar Kaw
Chapter 2, Linear Systems, Mainly LU Decomposition.
1cs542g-term Notes  Assignment 1 will be out later today (look on the web)
1cs542g-term Notes  Assignment 1 is out (questions?)
Total Recall Math, Part 2 Ordinary diff. equations First order ODE, one boundary/initial condition: Second order ODE.
ECIV 201 Computational Methods for Civil Engineers Richard P. Ray, Ph.D., P.E. Error Analysis.
Round-Off and Truncation Errors
Lecture 2: Numerical Differentiation. Derivative as a gradient
Linear Systems What is the Matrix?. Outline Announcements: –Homework III: due Wed. by 5, by Office Hours: Today & tomorrow, 11-1 –Ideas for Friday?
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 17 Solution of Systems of Equations.
Math for CSLecture 31 LU Decomposition Pivoting Diagonalization Gram-Shcmidt Orthogonalization Lecture 3.
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW II.
Math for CSLecture 31 LU Decomposition Pivoting Diagonalization Gram-Shcmidt Orthogonalization Lecture 3.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 10 LU Decomposition and Matrix.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 18 LU Decomposition and Matrix Inversion.
Representation and Conversion of Numeric Types 4 We have seen multiple data types that C provides for numbers: int and double 4 What differences are there.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM.
Major: All Engineering Majors Author(s): Autar Kaw
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 31.
Scientific Computing Linear Systems – LU Factorization.
Numerical Computations in Linear Algebra. Mathematically posed problems that are to be solved, or whose solution is to be confirmed on a digital computer.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
G AUSSIAN E LIMINATION Presented by: Max Le Max Le Justin Lavorgna Data Structures II: Algorithm Design & Analysis Algorithm Design & Analysis.
Binary Real Numbers. Introduction Computers must be able to represent real numbers (numbers w/ fractions) Two different ways:  Fixed-point  Floating-point.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
CISE301_Topic11 CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4:
EE 3561_Unit_1(c)Al-Dhaifallah EE 3561 : - Computational Methods in Electrical Engineering Unit 1: Introduction to Computational Methods and Taylor.
Round-off Errors.
Chemical Engineering Majors Author(s): Autar Kaw
Round-off Errors and Computer Arithmetic. The arithmetic performed by a calculator or computer is different from the arithmetic in algebra and calculus.
 6.2 Pivoting Strategies 1/17 Chapter 6 Direct Methods for Solving Linear Systems -- Pivoting Strategies Example: Solve the linear system using 4-digit.
MA/CS 375 Fall MA/CS 375 Fall 2002 Lecture 21.
Lecture 7 - Systems of Equations CVEN 302 June 17, 2002.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 3.
Direct Methods for Sparse Linear Systems Lecture 4 Alessandra Nardi Thanks to Prof. Jacob White, Suvranu De, Deepak Ramaswamy, Michal Rewienski, and Karen.
Direct Methods for Linear Systems Lecture 3 Alessandra Nardi Thanks to Prof. Jacob White, Suvranu De, Deepak Ramaswamy, Michal Rewienski, and Karen Veroy.
Linear Systems What is the Matrix?. Outline Announcements: –Homework III: due Today. by 5, by –Ideas for Friday? Linear Systems Basics Matlab and.
Numerical Analysis CC413 Propagation of Errors.
Gaussian Elimination Industrial Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for.
Gaussian Elimination Mechanical Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for.
10/7/2004Comp 120 Fall October 7 Read 5.1 through 5.3 Register! Questions? Chapter 4 – Floating Point.
Gaoal of Chapter 2 To develop direct or iterative methods to solve linear systems Useful Words upper/lower triangular; back/forward substitution; coefficient;
Gaussian Elimination Civil Engineering Majors Author(s): Autar Kaw Transforming Numerical Methods Education for STEM.
Unit #1 Linear Systems Fall Dr. Jehad Al Dallal.
Autar Kaw Benjamin Rigsby Transforming Numerical Methods Education for STEM Undergraduates.
Numerical Analysis CC413 Propagation of Errors. 2 In numerical methods, the calculations are not made with exact numbers. How do these inaccuracies propagate.
Module 2.2 Errors 03/08/2011. Sources of errors Data errors Modeling Implementation errors Absolute and relative errors Round off errors Overflow and.
Numerical Computation Lecture 6: Linear Systems – part II United International College.
PIVOTING The pivot or pivot element is the element of a matrix, or an array, which is selected first by an algorithm (e.g. Gaussian elimination, simplex.
Simultaneous Linear Equations
Spring Dr. Jehad Al Dallal
Linear Equations.
Linear Algebra Lecture 15.
Chapter 2 ERROR ANALYSIS
Chapter 10: Solving Linear Systems of Equations
Chapter 10 and Matrix Inversion LU Decomposition
© University of Liverpool
Programming #4 Computer Problems
Major: All Engineering Majors Author(s): Autar Kaw
Storing Negative Integers
Computer Organization
4.8 Pivoting Implementing Gaussian Elimination computationally can lead to problems Happens if the element used to create zeros is small relative to other.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Presentation transcript:

Outline Announcements –Add/drop today! –HWI due Friday Discrete Approximations Numerical Linear Algebra Solving ODE’s Solving PDE’s

Discrete Approximations The defining principle of numerical computing: Computers are finite This has several consequences: –Computers can only hold a finite amount of data (limited by memory) –Computers can represent integers exactly, but only over a finite range

Finite Memory Problem x C(x) Because we can only store a finite amount of data, continuous curves or surfaces must be approximated by storing values at a finite number of points This leads to discretization errors Can improve the approximation by –adding more points –tracking higher-order properties (e.g. splines)

Finite Precision Problem Computers only work with integers To represent a real number, we use two integers: –±m*b p m=“mantissa” b=base, set by the system p=exponent –Limited precision in both mantissa and exponent –Leads to roundoff errors

Finite Precision Problem Suppose we are working with base 10 numbers, and mantissa and exponent have 2 digits: –± xx 10 yy –smallest number: 1* * 1* = ??? --Underflow –largest number: 99* * 99*10 99 = ??? --Overflow –Only 99 numbers in each decade –Only 200*99-1=19,799 numbers!

Finite Precision Problem PrecisionBytesm(bits)epsp(bits)range Single4241e-7810 ±38 Double8531e ±308

Numerical Analysis The study of algorithms for mathematical problems concerned with –accuracy –stability –performance

Numerical Analysis Three big areas (i.e. physics) –Linear algebra –ODE’s/PDE’s –Optimization problems Other topics –Computational geometry –Numerical integration

Numerical Linear Algebra Linear Algebra ODE Optim Comp Geom. Num. Integr.

Numerical Linear Algebra Linear Systems Matrix Factorizations Eigenproblems

Solving Linear Systems

Gaussian Elimination This procedure is known as “Gaussian Elimination” for j=1:m-1 1. Divide row j by its jth entry 2. Subtract row j from rows j+1 through m

Gaussian Elimination GE is also known as “LU factorization” –A=LU where L is lower triangular, U is upper triangular –Ax=b –LUx=b –Solve Ly=b for y, then Ux=y for x

Big number-small number –difference is less then EPS –round to –could lead to large errors Solution: pivot rows A Problem with GE

Bigger ∆t means we can get solution in fewer steps, but If ∆t is too big, then solution will be inaccurate ODE/PDE Either

ODE/PDE

ODE/PDE Solutions involve a trade-off between –simple computation/small ∆t –expensive computation/big ∆t includes implicit methods, which involve solving linear systems

Principal Components Example: Temperature in NW Atlantic

Principal Components

Rgn 1Rgn 2…Rgn 8 C= Cov=1/(m-1)*C T *C

Principal Components