Handout5 - 1 COMPUTER SCIENCE 349A Handout Number 5 Taylors...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: 1 COMPUTER SCIENCE 349A Handout Number 5 Taylors Theorem is the fundamental tool for deriving and analyzing numerical approximation formulas in this course. It states that any smooth function (one with a sufficient number of derivatives) can be approximated by a polynomial, and it includes an error (remainder) term that indicates how accurate the polynomial approximation is. Taylors Theorem also provides a means to estimate the value of a function ) ( x f at some point 1 + i x using the values of ) ( x f and its derivatives at some nearby point i x . Taylors Theorem (page 74) Let n and let a be any constant. If ) ( x f and its first 1 + n derivatives are continuous on some interval containing x and a , then n n n R a x n a f a x a f a x a f a x a f a f x f + + + + + + = ) ( ! ) ( ) ( ! 3 ) ( ) ( ! 2 ) ( ) )( ( ) ( ) ( ) ( 3 2 L where the remainder (or error) term is 1 ) 1 ( ) ( )! 1 ( ) ( + + + = n n n a x n f R and is some value between x and a . Note that n n n a x n a f a x a f a x a f a x a f a f x P ) ( !...
View Full Document

This note was uploaded on 02/08/2010 for the course CSC CSC 349A taught by Professor Olesky during the Spring '08 term at University of Victoria.

Page1 / 4

Handout5 - 1 COMPUTER SCIENCE 349A Handout Number 5 Taylors...

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