Taylor Series and Applications - (8.7)(8.8) b n!x # c" n for x # c " R.!x # c" # f %%!c" 2! T!x"! 1 # x # x2 2! # x3. 3! n!

Size: px
Start display at page:

Download "Taylor Series and Applications - (8.7)(8.8) b n!x # c" n for x # c " R.!x # c" # f %%!c" 2! T!x"! 1 # x # x2 2! # x3. 3! n!"

Transcription

1 Taylor Series ad Applicatios - (8.7)(8.8). Taylor ad Maclauri Series: For a give fuctio f!x, how ca we fid its power series represetatio? If f has a power series represetatio at a umber a, that is, if the! b! f!!c This power series is called the Taylor series of f!x at c. Maclauri series. b x # c for x # c R or f!x!! f!!c!x # c. Whe c!, the power series is also called. Taylor s Theorem: Suppose that f has! # derivatives o c # R, c # R for some R $. The for x i c # R, c # R, f!x! P x # R x where P x! f!c # f %!c!!x # c # f %%!c!!x # c #...# f!!c R x! f!#!z! #!!x # c# for some z betwee x ad c.!x # c Example Fid the Taylor series represetatio of f!x at x! ad its iterval of covergece. a.f!x! e x b.f!x! six c.f!x! lx # a. f!x! e x. Set the table:... f!!x e x e x e x e x... e x f!!... b!!...! T!x! # x # x! # x! Fid the iterval of covergece I: use the Ratio Test: R! lim b #! lim & b &! #! So, I!!#,#. Therefore, b. f!x! six. Set the table: e x! # x # x! # x! #...# x #...! lim & #! # R! x #...# #...!! x, for # x. a. e #x b. e x # # x x

2 5... f!!x six cos!x # six # cos!x six cos!x... f!! #... b #!!... T!x! x #! x # x5 #...!!!#! x# #! Iterval of covergece I : R! lim b # & b use the Ratio Test:! lim &!# #! x#! #! #!!# x #! lim &! #! # x!, for all x.# I! #,. Therefore, six! x #! x # x5 #...!!!# x#, for # x.! #! a. si!x b. si x x c. f!x! lx #. Set the table:... f!!x lx #! x#!x # # #!x # #!#!#!x # #!#!!x #... f!! #!#!#!#!... b #!!!#!#... b!, b! #, b!!#,..., b!!# # T!x! x # x # x #...#!# # x #...!!!# # x Fid the iterval of covergece: use the Ratio Test: R! lim b #! lim & b &!# #!## The Taylor series coverges for x. Check two edpoits. Whe x!,!!# # x!! Whe x! #,!!# # x!!!# # So, the iterval of covergece: $#,.! lim &!# #!#! #! #!. harmoic series diverges. alteratig harmoic series coverges. Example Fid thetaylor series represetatio of f!x! Set the table: # x at a! ad the radius of covergece.

3 f!!x f!! c!x # /!!x # #/ #!x # #/ # # #!x # #5/ # #!#!!#!! 5! 5 # # # 5!x # #7/!#!!!5!#!!!5 7! 7 c!!# #!!...! # #.!!##!!...! # # T!x! # x #!#! x #!#!!! 5 x #!#!!!5 x #...! 7 #!# #!!...! # x #... # Fid the iterval of covergece: use the ratio test: lim & c # c!!...! #! #! lim & #! #!! #! lim &! #! # R!. So, the Taylor series coverges for x #. R!. #!!...! # Kow power series represetatios: O page 9: # x!! x! # x # x #... for x e x!! six!! cos!x!! x! # x # x!!# x#!# x # x!# x# l # x!!!# ta #!x!! #... for - $x! #!! x # x! # x5 #... for - $x!! # x! # x #... for - $x!! x # x # x #! x # x # x5 5 #... for # x $ #... for # $ x $ Example Use the kow power series represetatios for e x, six, cos!x, ta #!x ad lx to fid the Taylor Series for e #x/, six, cos!x, l # x, ta # x at a! ad iterval of covergece.

4 e #x /!! six!! # x!#!x #!x cos!x!!!#! l # x!! ta # x!!!# x, for # x! #!!!!# # x #! #!!# #!#x, for # x!!!#! x!!!!#! x, for # x!!!!# # x! # x # x # 8x #..., # x! #! x # x!!!# #, for # $ x $ # # $ x $. Applicatios: Example Express si. as the limit of a sereis. Approximate it by a Taylor polyomial of degree 5 ad estimate the approximatio error. Estimate the umber of terms eeded i a Taylor polyomial to guaratee a accuracy of # Recall:! 5. six!!!#! x# #!!! si.!!!#!. #! #!, for # x! #!!# x# %. #!.! #!.5 R. $.7!. 987 ' 7! #. 5! 8. ' #8! ' # Example Express l.9 as the limit of a sereis. Approximate it by a Taylor polyomial of degree ad estimate the approximatio error. Estimate the umber of terms eeded i a Taylor polyomial to guaratee a accuracy of #. Recall: Let x! #.. l.9!! # x l # x!!!#!# #!#.! #.558!!!#! x # x # x #... for# x $ #.! #. #. #. #.

5 R!x! f!5!z x 5! x 5!! # z 5 # z 5 x5, z is betwee ad. f!x! l # x, f %!x! # x, f %%!x! #! # x, f %%%!x!! # x, f!!x! #! # x, f!5!x!! # x 5 Fid such that R!#. $ #. Let! 9. R!#. $ 5!.5!. ' # R x! f!#!z! #! x!#!! # z #! #! x# $ #!.# $ #! 9, R 9!x $.! #,! 8, R 8!x $.9 9!. ' # Example Evaluate the idefiite itegral & six x dx. & six x dx! & x!!# x#! #! dx! &!!!!#! & #! x dx!!!#! #! # x# # C!# x! #! dx.5 Example Use series to approximate the itegral & cos!x dx to withi three decimal places. cos!x! #!x #!x #...!!!!!#! x &.5 cos!x dx! &.5!!# x! dx!!!# &.5!!!#!! x# #.5!! x! dx!#.5#!! # Fid m such that R m $.5. R m $ b m#!.5 m#!m #!!m # Whe m! 5,.5!!!!. 9 ' #. Whe m!,.5 9!8!!9! 5. 8 ' #9. Whe m!,.5 7!!!7!. 55 ' #. Whe m!,.5 5!. ' #!!!5 Let m! 5. Example Approximate e # ad! correct to decimal places. 5

6 e #! # #! #! #...!! ta #!! # # 5 #!!!# # Fid m such that R m $.5. R m $ b m# $ m # $.5 # m # '.5! m '! #! Let m! Example Fid the sum of the series. a.! x!x!!! e x a.! x b.!!#!! c.! x #!# b.!!!!#!!!!! cos! c.! x #!x! x!! x e x # # x Example Fid the Taylor series of f!x! # x at a! ad the radius of covergece. Sketch the graphs of f!x ad T m!x for m!,,,. Approximate. to decimal places. Approximate # x dx to 5 decimal places. &. Set the table: f!!x f!! c!x # /!x # #/ #!x # #/ #!#!!! # #!x # #5/ # #!#!!! # # # 5!x # #7/!#!!!5!#!!!5! : : : : # #... # #!x # #7/!# #!!...! #!# #!!...! # T!x! # x #! x #!! x...#!# #!!...! #! x #...! # x #!!# #!!...! # x

7 Check the radius of covergece: lim & c # c! lim &!!...! # #! #!! lim & #! #! # R!!!...! #.! f!.! T!.! #!. #!!#!!...! #!.!!...!m # This is a alteratig series. R m $ b m#! m#!. m#.5!m #! Whe m!,!! #! #!!.#!. 5 ' #5 Whe m!,! #! #!!.#!. 5 ' # $.5. Let m!.. % #!. #!!.!. 875.! usig the Scietific Notebook.. & # x. dx! & # x #!!#!!...! #!x dx! x # 8 x #!!# #!!...! #!!. # 8!. #!!# #!!...! # Fid m such that R m $ b m#.5.!!...!m # R m $ b m#! m#!m #!!! Whe m!, #! #!! Whe m!, #! #! Let m!. &. &. m #!.m#. # x#! #!.!#!. 5 ' #! #!.!#! ' #9 Whe m!, 8!.!. 5 ' #5 $.5 # x dx %!. # 8!.!.5 # x dx!.98 usig the Scietific Notebook. #!.# 7

Test 4 Review. dy du 9 5. sin5 zdz. dt. 5 Ê. x 2 È 1, 3. 2cos( x) dx is less than using Simpson's. ,1 t 5 t 2. ft () t2 4.

Test 4 Review. dy du 9 5. sin5 zdz. dt. 5 Ê. x 2 È 1, 3. 2cos( x) dx is less than using Simpson's. ,1 t 5 t 2. ft () t2 4. Name: Class: Date: ID: A Test Review Short Aswer. Fid the geeral solutio of the differetial equatio below ad check the result by differetiatio. dy du 9 u. Use the error formula to estimate the error i

More information

Area As A Limit & Sigma Notation

Area As A Limit & Sigma Notation Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

MATH 152: Calculus 2, SET8 EXAMPLES [Belmonte, 2018] 6 Applications of Integration. 5.5 The Substitution Rule. 6.2 Volumes. 6.1 Areas Between Curves

MATH 152: Calculus 2, SET8 EXAMPLES [Belmonte, 2018] 6 Applications of Integration. 5.5 The Substitution Rule. 6.2 Volumes. 6.1 Areas Between Curves MATH 5: Calculus, SET8 EXAMPLES [Belmote, 8] 6 Applicatios of Itegratio 55 The Substitutio Rule [48/6] Evaluate the itegral t + dt by makig the substitutio u = t + [48/8] Evaluate x e x3 dx via the Substitutio

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

Integration: Reduction Formulas Any positive integer power of sin x can be integrated by using a reduction formula.

Integration: Reduction Formulas Any positive integer power of sin x can be integrated by using a reduction formula. Itegratio: Reductio Formulas Ay positive iteger power of si x ca be itegrated by usig a reductio formula. Prove that for ay iteger 2, si xdx = 1 si 1 x cos x + 1 si Solutio. Weuseitegratiobyparts. Let

More information

The Graphs of Polynomial Functions

The Graphs of Polynomial Functions Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where

More information

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

ON MATHIEU-BERG S INEQUALITY

ON MATHIEU-BERG S INEQUALITY ON MATHIEU-BERG S INEQUALITY BICHENG YANG DEPARTMENT OF MATHEMATICS, GUANGDONG EDUCATION COLLEGE, GUANGZHOU, GUANGDONG 533, PEOPLE S REPUBLIC OF CHINA. bcyag@pub.guagzhou.gd.c ABSTRACT. I this paper, by

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

WebAssign Lesson 6-1b Geometric Series (Homework)

WebAssign Lesson 6-1b Geometric Series (Homework) WebAssig Lesso 6-b Geometric Series (Homework) Curret Score : / 49 Due : Wedesday, July 30 204 :0 AM MDT Jaimos Skriletz Math 75, sectio 3, Summer 2 204 Istructor: Jaimos Skriletz. /2 poitsrogac alcet2

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

NAME: Section # SSN: X X X X

NAME: Section # SSN: X X X X Math 155 FINAL EXAM A May 5, 2003 NAME: Section # SSN: X X X X Question Grade 1 5 (out of 25) 6 10 (out of 25) 11 (out of 20) 12 (out of 20) 13 (out of 10) 14 (out of 10) 15 (out of 16) 16 (out of 24)

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s-

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s- PROPERTIES OF REGULAR POLYGONS The simplest D close figures which ca be costructe by the cocateatio of equal legth straight lies are the regular polygos icluig the equilateral triagle, the petago, a the

More information

Mathematical Stat I: solutions of homework 1

Mathematical Stat I: solutions of homework 1 Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular

More information

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY BACHMANN-LANDAU NOTATIONS Lecturer: Dr. Jomar F. Rabajate IMSP, UPLB MATH 174: Numerical Aalysis I 1 st Sem AY 018-019 RANKING OF FUNCTIONS Name Big-Oh Eamples Costat O(1 10 Logarithmic O(log log, log(

More information

Module 8-7: Pascal s Triangle and the Binomial Theorem

Module 8-7: Pascal s Triangle and the Binomial Theorem Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

An (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the.

An (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the. Sectio.2 Arithmetic Sequeces ad Series -.2 Arithmetic Sequeces ad Series Arithmetic Sequeces Arithmetic Series Key Terms: arithmetic sequece (arithmetic progressio), commo differece, arithmetic series

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

1.8 What Comes Next? What Comes Later?

1.8 What Comes Next? What Comes Later? 35 1.8 What Comes Next? What Comes Later? A Practice Uderstadig Task For each of the followig tables, CC BY Hiroaki Maeda https://flic.kr/p/6r8odk describe how to fid the ext term i the sequece, write

More information

Differentiability and Tangent Planes October 2013

Differentiability and Tangent Planes October 2013 Differentiability and Tangent Planes 14.4 04 October 2013 Differentiability in one variable. Recall for a function of one variable, f is differentiable at a f (a + h) f (a) lim exists and = f (a) h 0 h

More information

Our Learning Problem, Again

Our Learning Problem, Again Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)

More information

2.9 Linear Approximations and Differentials

2.9 Linear Approximations and Differentials 2.9 Linear Approximations and Differentials 2.9.1 Linear Approximation Consider the following graph, Recall that this is the tangent line at x = a. We had the following definition, f (a) = lim x a f(x)

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Chapter 3. Floating Point Arithmetic

Chapter 3. Floating Point Arithmetic COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 3 Floatig Poit Arithmetic Review - Multiplicatio 0 1 1 0 = 6 multiplicad 32-bit ALU shift product right multiplier add

More information

Updated: March 31, 2016 Calculus III Section Math 232. Calculus III. Brian Veitch Fall 2015 Northern Illinois University

Updated: March 31, 2016 Calculus III Section Math 232. Calculus III. Brian Veitch Fall 2015 Northern Illinois University Updated: March 3, 26 Calculus III Section 5.6 Math 232 Calculus III Brian Veitch Fall 25 Northern Illinois University 5.6 Triple Integrals In order to build up to a triple integral let s start back at

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

Exam 1 Review. MATH Intuitive Calculus Fall Name:. Show your reasoning. Use standard notation correctly.

Exam 1 Review. MATH Intuitive Calculus Fall Name:. Show your reasoning. Use standard notation correctly. MATH 11012 Intuitive Calculus Fall 2012 Name:. Exam 1 Review Show your reasoning. Use standard notation correctly. 1. Consider the function f depicted below. y 1 1 x (a) Find each of the following (or

More information

Convergence results for conditional expectations

Convergence results for conditional expectations Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,

More information

2) Give an example of a polynomial function of degree 4 with leading coefficient of -6

2) Give an example of a polynomial function of degree 4 with leading coefficient of -6 Math 165 Read ahead some cocepts from sectios 4.1 Read the book or the power poit presetatios for this sectio to complete pages 1 ad 2 Please, do ot complete the other pages of the hadout If you wat to

More information

The Eigen-Cover Ratio of a Graph: Asymptotes, Domination and Areas

The Eigen-Cover Ratio of a Graph: Asymptotes, Domination and Areas The ige-cover Ratio of a Graph: Asymptotes, Domiatio ad Areas Paul August Witer ad Carol Lye Jessop Mathematics, UKZN, Durba, outh Africa-email: witerp@ukzacza Abstract The separate study of the two cocepts

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

A graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n))

A graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n)) ca see that time required to search/sort grows with size of We How do space/time eeds of program grow with iput size? iput. time: cout umber of operatios as fuctio of iput Executio size operatio Assigmet:

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Natasha S. Sharma, PhD

Natasha S. Sharma, PhD Revisiting the function evaluation problem Most functions cannot be evaluated exactly: 2 x, e x, ln x, trigonometric functions since by using a computer we are limited to the use of elementary arithmetic

More information

Introduction to numerical algorithms

Introduction to numerical algorithms Introduction to numerical algorithms Given an algebraic equation or formula, we may want to approximate the value, and while in calculus, we deal with equations or formulas that are well defined at each

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Thompson s Group F (p + 1) is not Minimally Almost Convex

Thompson s Group F (p + 1) is not Minimally Almost Convex Thompso s Group F (p + ) is ot Miimally Almost Covex Claire Wladis Thompso s Group F (p + ). A Descriptio of F (p + ) Thompso s group F (p + ) ca be defied as the group of piecewiseliear orietatio-preservig

More information

It just came to me that I 8.2 GRAPHS AND CONVERGENCE

It just came to me that I 8.2 GRAPHS AND CONVERGENCE 44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot

More information

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle: Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical

More information

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS :

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS : J-Mathematics. CONTINUOUS FUNCTIONS : CONTINUI TY A fuctio for which a small chage i the idepedet variable causes oly a small chage ad ot a sudde jump i the depedet variable are called cotiuous fuctios.

More information

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure. SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

Assignment Assignment for Lesson 9.1

Assignment Assignment for Lesson 9.1 Assignment Assignment for Lesson.1 Name Date Shifting Away Vertical and Horizontal Translations 1. Graph each cubic function on the grid. a. y x 3 b. y x 3 3 c. y x 3 3 2. Graph each square root function

More information

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com) wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed

More information

Some non-existence results on Leech trees

Some non-existence results on Leech trees Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract

More information

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS) Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES

More information

LECTURE 3-1 AREA OF A REGION BOUNDED BY CURVES

LECTURE 3-1 AREA OF A REGION BOUNDED BY CURVES 7 CALCULUS II DR. YOU 98 LECTURE 3- AREA OF A REGION BOUNDED BY CURVES If y = f(x) and y = g(x) are continuous on an interval [a, b] and f(x) g(x) for all x in [a, b], then the area of the region between

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

Quiz 6 Practice Problems

Quiz 6 Practice Problems Quiz 6 Practice Problems Practice problems are similar, both in difficulty and in scope, to the type of problems you will see on the quiz. Problems marked with a are for your entertainment and are not

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted

More information

MA 113 Calculus I Fall 2015 Exam 2 Tuesday, 20 October Multiple Choice Answers. Question

MA 113 Calculus I Fall 2015 Exam 2 Tuesday, 20 October Multiple Choice Answers. Question MA 113 Calculus I Fall 2015 Exam 2 Tuesday, 20 October 2015 Name: Section: Last digits of student ID #: This exam has ten multiple choice questions (five points each) and five free response questions (ten

More information

Final Exam information

Final Exam information Fial Exam iformatio Wedesday, Jue 6, 2012, 9:30 am - 11:18 am Locatio: i recitatio room Comprehesive (covers all course material) 35 multiple-choice questios --> 175 poits Closed book ad otes Make up your

More information

CSE 417: Algorithms and Computational Complexity

CSE 417: Algorithms and Computational Complexity Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite

More information

Algorithm Design Techniques. Divide and conquer Problem

Algorithm Design Techniques. Divide and conquer Problem Algorithm Desig Techiques Divide ad coquer Problem Divide ad Coquer Algorithms Divide ad Coquer algorithm desig works o the priciple of dividig the give problem ito smaller sub problems which are similar

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard 1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries

More information

q-beta Polynomials and their Applications

q-beta Polynomials and their Applications Appl Math If Sci 7, No 6, 2539-2547 23 2539 Applie Mathematics & Iformatio Scieces A Iteratioal Joural http://xoiorg/2785/amis/765 -Beta Polyomials a their Applicatios Yilmaz Simse Departmet of Mathematics,

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Math 167 Review for Test 4 Chapters 7, 8 & 9

Math 167 Review for Test 4 Chapters 7, 8 & 9 Math 167 Review for Tet 4 Chapter 7, 8 & 9 Vocabulary 1. A ordered pair (a, b) i a of a equatio i term of x ad y if the equatio become a true tatemet whe a i ubtituted for x ad b i ubtituted for y. 2.

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #2

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #2 Name Date Hr. ALGEBRA - SPRING FINAL MULTIPLE CHOICE REVIEW # 5. Which measure of ceter is most appropriate for the followig data set? {7, 7, 75, 77,, 9, 9, 90} Mea Media Stadard Deviatio Rage 5. The umber

More information

MATH 104 First Midterm Exam - Fall (d) A solid has as its base the region in the xy-plane the region between the curve y = 1 x2

MATH 104 First Midterm Exam - Fall (d) A solid has as its base the region in the xy-plane the region between the curve y = 1 x2 MATH 14 First Midterm Exam - Fall 214 1. Find the area between the graphs of y = x 2 + x + 5 and y = 2x 2 x. 1. Find the area between the graphs of y = x 2 + 4x + 6 and y = 2x 2 x. 1. Find the area between

More information

Optimized Aperiodic Concentric Ring Arrays

Optimized Aperiodic Concentric Ring Arrays 24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity

More information

UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES (SOLUTIONS ) CHAPTER 3: Partial derivatives and differentiation

UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES (SOLUTIONS ) CHAPTER 3: Partial derivatives and differentiation UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES SOLUTIONS ) 3-1. Find, for the following functions: a) fx, y) x cos x sin y. b) fx, y) e xy. c) fx, y) x + y ) lnx + y ). CHAPTER 3: Partial derivatives

More information

Basic Optics: Index of Refraction

Basic Optics: Index of Refraction Basic Optics: Idex of Refractio Deser materials have lower speeds of light Idex of Refractio = where c = speed of light i vacuum v = velocity i medium Eve small chages ca create differece i Higher idex

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Exam 3 Review (Sections Covered: , 6.7topic and )

Exam 3 Review (Sections Covered: , 6.7topic and ) Exam 3 Review (Sections Covered: 6.1-6.6, 6.7topic and 8.1-8.2) 1. Find the most general antiderivative of the following functions. (Use C for the constant of integration. Remember to use absolute values

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

REVIEW I MATH 254 Calculus IV. Exam I (Friday, April 29) will cover sections

REVIEW I MATH 254 Calculus IV. Exam I (Friday, April 29) will cover sections REVIEW I MATH 254 Calculus IV Exam I (Friday, April 29 will cover sections 14.1-8. 1. Functions of multivariables The definition of multivariable functions is similar to that of functions of one variable.

More information