CS321. Introduction to Numerical Methods

Similar documents
CS321. Numerical Analysis

Chapter Simpson s 1/3 Rule of Integration. ( x)

Chapter 12-b Integral Calculus - Extra

12 Iterative Methods. Linear Systems: Gauss-Seidel Nonlinear Systems Case Study: Chemical Reactions

DATA FITTING. Intensive Computation 2013/2014. Annalisa Massini

Mathematically, integration is just finding the area under a curve from one point to another. It is b

Chapter Gauss-Seidel Method

ITERATIVE METHODS FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS

Numerical Differentiation and Integration

i+1 by A and imposes Ax

CHAPTER 6 CURVE FITTINGS

CURVE FITTING LEAST SQUARES METHOD

UNIVERSITI KEBANGSAAN MALAYSIA PEPERIKSAAN AKHIR SEMESTER I SESI AKADEMIK 2007/2008 IJAZAH SARJANAMUDA DENGAN KEPUJIAN NOVEMBER 2007 MASA : 3 JAM

МИНИСТЕРСТВО ОБРАЗОВАНИЯ И НАУКИ РОССИЙСКОЙ ФЕДЕРАЦИИ. Численные методы. Учебно-методическое пособие

Lecture 3-4 Solutions of System of Linear Equations

Numerical differentiation (Finite difference)

Advanced Algorithmic Problem Solving Le 3 Arithmetic. Fredrik Heintz Dept of Computer and Information Science Linköping University

In Calculus I you learned an approximation method using a Riemann sum. Recall that the Riemann sum is

Differential Entropy 吳家麟教授

INTRODUCTION ( ) 1. Errors

Regression. By Jugal Kalita Based on Chapter 17 of Chapra and Canale, Numerical Methods for Engineers

The z-transform. LTI System description. Prof. Siripong Potisuk

FORMULAE FOR FINITE DIFFERENCE APPROXIMATIONS, QUADRATURE AND LINEAR MULTISTEP METHODS

Chapter 2 Intro to Math Techniques for Quantum Mechanics

Numerical Analysis Third Class Chemical Engineering Department University of Technology Assoc. Prof. Dr. Zaidoon Mohsin shakor

Outline. Finite Difference Grids. Numerical Analysis. Finite Difference Grids II. Finite Difference Grids III

3/20/2013. Splines There are cases where polynomial interpolation is bad overshoot oscillations. Examplef x. Interpolation at -4,-3,-2,-1,0,1,2,3,4

ICS141: Discrete Mathematics for Computer Science I

Computer Programming

Spectrum Estimation by Several Interpolation Methods

Computational Modelling

Calculating the Values of Multiple Integrals by Replacing the Integrands Interpolation by Interpolation Polynomial

Numerical Analysis Topic 4: Least Squares Curve Fitting

INTERPOLATION(2) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek

Integration by Parts for D K

Sequences and summations

Level-2 BLAS. Matrix-Vector operations with O(n 2 ) operations (sequentially) BLAS-Notation: S --- single precision G E general matrix M V --- vector

CS537. Numerical Analysis

Rendering Equation. Linear equation Spatial homogeneous Both ray tracing and radiosity can be considered special case of this general eq.

Objective of curve fitting is to represent a set of discrete data by a function (curve). Consider a set of discrete data as given in table.

Chapter 5. Curve fitting

SOLVING SYSTEMS OF EQUATIONS, DIRECT METHODS

Area and the Definite Integral. Area under Curve. The Partition. y f (x) We want to find the area under f (x) on [ a, b ]

MTH 146 Class 7 Notes

Chapter Unary Matrix Operations

A Technique for Constructing Odd-order Magic Squares Using Basic Latin Squares

Chapter 3 Supplemental Text Material

PubH 7405: REGRESSION ANALYSIS REGRESSION IN MATRIX TERMS

The Derivation of Implicit Second Derivative Method for Solving Second-Order Stiff Ordinary Differential Equations Odes.

ME 501A Seminar in Engineering Analysis Page 1

MATLAB PROGRAM FOR THE NUMERICAL SOLUTION OF DUHAMEL CONVOLUTION INTEGRAL

Chapter Runge-Kutta 2nd Order Method for Ordinary Differential Equations

The definite Riemann integral

Chapter 2 Solving Linear Equation

Chapter 2 Intro to Math Techniques for Quantum Mechanics

Introduction to Numerical Differentiation and Interpolation March 10, !=1 1!=1 2!=2 3!=6 4!=24 5!= 120

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)

Chapter Simpson s 1/3 Rule of Integration. ( x)

4. Runge-Kutta Formula For Differential Equations

General Method for Calculating Chemical Equilibrium Composition

Autar Kaw Benjamin Rigsby. Transforming Numerical Methods Education for STEM Undergraduates

CHAPTER 5 Vectors and Vector Space

An Extended Mixture Inverse Gaussian Distribution

POWERS OF COMPLEX PERSYMMETRIC ANTI-TRIDIAGONAL MATRICES WITH CONSTANT ANTI-DIAGONALS

4 Round-Off and Truncation Errors

Introduction to mathematical Statistics

Chapter Linear Regression

More Regression Lecture Notes CE 311K - McKinney Introduction to Computer Methods Department of Civil Engineering The University of Texas at Austin

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

4. Runge-Kutta Formula For Differential Equations. A. Euler Formula B. Runge-Kutta Formula C. An Example for Fourth-Order Runge-Kutta Formula

Topic 6b Finite Difference Approximations

Mathematics HL and further mathematics HL formula booklet

Numerical Differentiation

Basic Concepts in Numerical Analysis November 6, 2017

Homework Assignment Number Eight Solutions

Modeling uncertainty using probabilities

CS321. Numerical Analysis

Numerical Differentiation

MATH2999 Directed Studies in Mathematics Matrix Theory and Its Applications

Introduction to Numerical Integration Part II

CS473-Algorithms I. Lecture 3. Solving Recurrences. Cevdet Aykanat - Bilkent University Computer Engineering Department

BC Calculus Review Sheet

Some Unbiased Classes of Estimators of Finite Population Mean

Systems of second order ordinary differential equations

this is the indefinite integral Since integration is the reverse of differentiation we can check the previous by [ ]

4 Linear Homogeneous Recurrence Relation 4-1 Fibonacci Rabbits. 组合数学 Combinatorics

CHAPTER 4 RADICAL EXPRESSIONS

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University Revised by Prof. Jang, CAU

SUM PROPERTIES FOR THE K-LUCAS NUMBERS WITH ARITHMETIC INDEXES

Mathematics HL and further mathematics HL formula booklet

Analytical Approach for the Solution of Thermodynamic Identities with Relativistic General Equation of State in a Mixture of Gases

Complex Variables. Chapter 19 Series and Residues. March 26, 2013 Lecturer: Shih-Yuan Chen

Section 6.3: Geometric Sequences

Available online through

Random variables and sampling theory

PROGRESSIONS AND SERIES

CS321. Numerical Analysis and Computing

Given a table of data poins of an unknown or complicated function f : we want to find a (simpler) function p s.t. px (

MATRIX AND VECTOR NORMS

Module 2: Introduction to Numerical Analysis

Transcription:

CS Itroducto to Numercl Metods Lecture Revew Proessor Ju Zg Deprtmet o Computer Scece Uversty o Ketucky Legto, KY 6 6 Mrc 7,

Number Coverso A geerl umber sould be coverted teger prt d rctol prt seprtely Covert teger umber rom bse β < to bsed 67 7 6 7 6 95 Covert rctol umber rom bse β < to bsed.76 7 99 5.976 6 6 7

Repeted Dvso To covert bse teger umber to bse β < umber, we c use repeted dvso lgortm 576 / / / 5 / 5 remder remder remder remder 5 5 So we ve 576. 5. It c be urter coverted to bry umber usg te bry octl tble 576. 5.. Note tt te rst dgt you obt s te rst dgt et to te rd pot

Iteger Frcto Splt Te teger rcto splt process s used to covert rctol bse umber to bse β umber. Multply te rctol umber by β;. Tke te teger prt s te rst et dgt;. Repet te process o te remg rctol prt..7.7..976.95.9.7..976.95.9. Hece, we ve.7.

Normlzed Scetc Notto We wrte umber te ormlzed scetc otto orm s Oly mce umbers c be represeted ectly computer To store lotg pot umber usg bts Sg o q eeds bt Iteger m eeds bts Number q eeds bts 7.59.759 m q Sgle precso IEEE stdrd lotg pot c7. 5

Represetto Errors 6 Te reltve error correct roudg s Te ut roudo error s Flotg pot represetto Note tt Avod loss o sgct dgts rtolzto Tylor epsos or commoly used uctos l l y y t

Root Fdg Algortms Bsecto metod, Newto s metod, d sect metod Bsecto metod s slow, but s gurteed to d root Coose two tl pots wt deret sgs, compute te mddle pot d determe two ew pots bsed o te sg o te mddle pot Number o bsecto steps or some tolerce b log b log log 7

Newto s Metod ' Newto s metod coverges qudrtclly, wle te bsecto does lerly Newto s metod eeds te rst dervtve vlue t ec terto Itl pot must be sucetly close to te soluto pot Newto s metod c be used to solve system o ler equtos d oler equtos [ ' Were k s te Jcob mtr k k k k ]

Sect Metod 9 Sect metod tres to tke dvtge o Newto s metod, but does ot compute te dervtve vlues Te dervtve vlue s ppromted by Te sect metod geertes tertes Covergece rte s betwee tt o Newto s metod d bsecto metod, oly oe uctol evluto s eeded t ec terto Need two tl pots to strt wt, my use bsecto metod to geerte te rst terte '

Iterpolto Gve set o ccurte dt, d polyoml ucto o degree ot ger t tt represets tese dt d possble te mssg dt For Lgrge orm, d te crdl uctos Te Lgrge polyoml s Te crdl ucto s costructed s j j l j l p, l j j j j

Newto Form Costruct te polyoml step by step wt Note tt terpolto polyomls costructed by Lgrge or Newto orm re te sme. I ct, tere s oly oe uque polyoml o degree ot ger t to terpolte dt set o + Tere re my ger order polyomls tt my stsy te terpolto codtos, too y p or k k k c p p k k k k k k k p y c

Dvded Derece ], [ ],, [ ],,, [ ],, [ ], [ ] [ p

Dervtve Appromto Sded O ppromto o rst dervtve Hger order ppromtos Tylor epsos Subtrctg tese two equtos, we ve '! '''! "! '! '''! "! ' 5! '''! ' 5 5

d Order Appromto Ater droppg te ger order terms, we ve secod order ppromto ormul s Te ledg tructed terms o ppromto sceme s Hece te ppromto s o O. Te ppromto error goes to s st s. Te ect tructo error s ''' 6 ''' ''' 6 ' 5! '''! ' 5

5 Rcrdso Etrpolto Rcrdso etrpolto estmtes te vlue o ψ rom some computed vlues o ψ er Multply te d equto by d subtrct t rom te st equto Hece c be computed s ccurte s O 6 6 6 6 ' ' 6 6 6 5 ' 6 6 6 5 '

Iterpolto Polyoml We c ppromte te ucto by polyoml p o order, suc tt p To compute, we use te ppromto p Hger order polyomls re voded becuse o oscllto Let p terpolte t two pots, d Te rst dervtve o p s p, p', ' 6

7 Trpezod Rule Te tervl [,b] s rst dvded to subtervls [, + ],. Te bsc trpezod rule or te subtervl [, + ] s Te totl re uder te curve s For uorm spcg = b /, te composte trpezod rule s d ; b A P T d ; P T

Smpso s Rule Smpso s rule s tree pot umercl tegrto rule usg te mddle pot o te tervl wt deret wegts or ec pot d Te error term o ts ppromto s 9 For some pot ξ, +. Ts sould be compred to te error term o te smple trpezod rule O Smpso s metod c be used dptvely to ree te spcg te subtervl tt yelds lrge error 5 Strtegy d crtero or dptto: usg Smpso s metod o te wole tervl d te o te two l tervls

Guss Elmto How to perorm Guss elmto o gve ler system, wy te ïve Guss elmto s ot robust Wt c we do to mke Guss elmto more robust to solve rbtrry ler system Wt s te order o te log operto cout Guss elmto / Wt s trdgol system, wt codto s sucet to gurtee tt tere s o pvotg eeded or solvg trdgol system Wt s te dvtges d dsdvtges o tertve metods versus Guss elmto drect metod, wt re te tertve metod we studed, wt type o ler systems tt tertve metods my be dvtgeous 9

Sple Appromtos Wy we eed sple ppromtos Wt re te codtos or vrous degrees o sple, eed to be ble to very tese codtos How c we sy tt sple ppromto s better t polyoml terpolto Wt s turl sple, ow my rbtrry codtos re speced geerl cubc sple order to obt turl sple S t = S t = Gve set o polyomls deed o seprte tervls, gure out cert costts to mke up cubc or gve sple

Lest Squres Dt re ccurte, polyoml terpolto does ot mke sese Try to mmze te totl error lest squres sese Tke te prtl dervtves d set tem to zero to obt orml equtos. Guss elmto my be used to solve te orml equtos Lest squres curve ttg my ot pss troug y o te gve dt pots, but t s supposed to represet te true tred o te dt How to coose bss uctos to mke computto eser Wt re te specl polyomls we studed tt c be used s bss ucto or good curve ttg