CSC_349_HANDOUT#30

CSC_349_HANDOUT#30 - COMPUTER SCIENCE 349A Handout Number...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 COMPUTER SCIENCE 349A Handout Number 30 ROUNDOFF ERROR ANALYSIS FOR COMPOSITE NEWTON-COTES FORMULAS For simplicity consider the composite Simpson’s rule () + + + = = m j m j m j j b a f f f f h x d x f 1 2 1 2 1 1 2 0 4 2 3 , where f i = f ( x i ) and h = b a 2 m . When this formula is evaluated using floating- point arithmetic, there are two main sources of roundoff error : in the evaluation of the values i f , and in calculating the summations. For now, we'll consider only the effect on the computed approximation to f ( x ) dx a b of roundoff errors that occur in evaluating the values i f . Suppose ˜ f i denotes the computed approximation to i f (that is, ˜ f i is inexact due to roundoff error). Denote the roundoff error by e i = ˜ f i f i and suppose that ε i e for all i (that is, we are assuming that is the largest possible roundoff error when evaluating ) ( i x f regardless of the value of x i ).
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/10/2011 for the course CSC 349 taught by Professor Oadje during the Spring '11 term at University of Victoria.

Page1 / 2

CSC_349_HANDOUT#30 - COMPUTER SCIENCE 349A Handout Number...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online