Accelerating Convergence
|
|
- Poppy Sims
- 5 years ago
- Views:
Transcription
1 Accelerating Convergence MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013
2 Motivation We have seen that most fixed-point methods for root finding converge only linearly to a solution. Today we describe a technique which can be used accelerate the convergence of any linearly convergent sequence.
3 Linear Convergence Suppose sequence {p n } n=0 converges linearly to p.
4 Linear Convergence Suppose sequence {p n } n=0 converges linearly to p. p n+1 p 0 < lim = λ < 1 n p n p
5 Linear Convergence Suppose sequence {p n } n=0 converges linearly to p. p n+1 p 0 < lim = λ < 1 n p n p Assume the signs of p n+2 p, p n+1 p, and p n p are all the same.
6 Linear Convergence Suppose sequence {p n } n=0 converges linearly to p. p n+1 p 0 < lim = λ < 1 n p n p Assume the signs of p n+2 p, p n+1 p, and p n p are all the same. For large n then p n+2 p p n+1 p p n+1 p p n p.
7 Re-writing the Sequence (1 of 2) Solve for p. p n+2 p p n+1 p p n+1 p p n p (p n+1 p) 2 (p n+2 p)(p n p)
8 Re-writing the Sequence (1 of 2) Solve for p. p n+2 p p n+1 p p n+1 p p n p (p n+1 p) 2 (p n+2 p)(p n p) p p n+2p n p 2 n+1 p n+2 2p n+1 + p n
9 Re-writing the Sequence (2 of 2) p p n+2p n p 2 n+1 p n+2 2p n+1 + p n Add and subtract the terms p 2 n and 2p n p n+1 in the numerator.
10 Re-writing the Sequence (2 of 2) p p n+2p n p 2 n+1 p n+2 2p n+1 + p n Add and subtract the terms p 2 n and 2p n p n+1 in the numerator. p p2 n+1 + 2p np n+1 p 2 n + p n+2 p n + p 2 n 2p n p n+1 p n+2 2p n+1 + p n Now factor the numerator.
11 Re-writing the Sequence (2 of 2) p p n+2p n p 2 n+1 p n+2 2p n+1 + p n Add and subtract the terms p 2 n and 2p n p n+1 in the numerator. p p2 n+1 + 2p np n+1 p 2 n + p n+2 p n + p 2 n 2p n p n+1 p n+2 2p n+1 + p n Now factor the numerator. p (p n+1 p n ) 2 + p n (p n+2 + p n 2p n+1 ) p n+2 2p n+1 + p n (p n+1 p n ) 2 = p n p n+2 2p n+1 + p n
12 Aitken s 2 Method Define a new sequence {ˆp n } n=0 as ˆp n = p n We would like to show that (p n+1 p n ) 2 p n+2 2p n+1 + p n. lim ˆp n = p = lim p n, and n n sequence {ˆp n } n=0 converges to p faster than sequence {p n } n=0.
13 Aitken s 2 Method Define a new sequence {ˆp n } n=0 as ˆp n = p n We would like to show that (p n+1 p n ) 2 p n+2 2p n+1 + p n. lim ˆp n = p = lim p n, and n n sequence {ˆp n } n=0 converges to p faster than sequence {p n } n=0. We will come to call this iterative method as Aitken s 2 Method.
14 Example ( ) 1 Define p n = sin for n 1. Find the limit of this sequence n and compare its convergence to that of the sequence ˆp n.
15 Example ( ) 1 Define p n = sin for n 1. Find the limit of this sequence n and compare its convergence to that of the sequence ˆp n. n p n ˆp n
16 Forward Difference Definition Given sequence {p n } n=0, the forward difference denoted p n is defined as p n = p n+1 p n, for n 0. Higher powers of the operator are defined recursively as ) k p n = ( k 1 p n, for n 2.
17 Forward Difference (2 of 2) p n = p n+1 p n 2 p n = (p n+1 p n ) = p n+2 p n+1 (p n+1 p n ) = p n+2 2p n+1 + p n 3 p n = (p n+2 2p n+1 + p n ) = p n+3 3p n+2 + 3p n+1 p n.
18 Forward Difference (2 of 2) p n = p n+1 p n 2 p n = (p n+1 p n ) = p n+2 p n+1 (p n+1 p n ) = p n+2 2p n+1 + p n 3 p n = (p n+2 2p n+1 + p n ) = p n+3 3p n+2 + 3p n+1 p n. We can write Aitken s 2 Method as ˆp n = p n ( p n) 2 2 p n.
19 Convergence of Aitken s 2 Method Theorem Let {p n } n=0 be a sequence converging linearly to p with asymptotic error constant λ < 1. The sequence {ˆp n } n=0 converges to p faster than {p n } n=0 in the sense that ˆp n p lim n p n p = 0.
20 Proof (1 of 5) By assumption {p n } n=0 converges linearly to p, i.e. p n+1 p 0 < lim = λ < 1. n p n p Assume the signs of p k p are all the same for sufficiently large k.
21 Proof (1 of 5) By assumption {p n } n=0 converges linearly to p, i.e. p n+1 p 0 < lim = λ < 1. n p n p Assume the signs of p k p are all the same for sufficiently large k. Define a new sequence δ n = p n+1 p λ for n 0. Note that lim n δ n = 0. p n p
22 Proof (2 of 5) Consider ˆp n p p n p = 1 p n p ( p n ( p n) 2 2 p n p )
23 Proof (2 of 5) Consider ˆp n p p n p = 1 p n p = 1 p n p ( ) p n ( p n) 2 2 p p n ( ) p n p ( p n) 2 2 p n ( p n ) 2 = 1 (p n p) 2 p n
24 Proof (2 of 5) Consider ˆp n p p n p = 1 p n p = 1 p n p ( ) p n ( p n) 2 2 p p n ( ) p n p ( p n) 2 2 p n ( p n ) 2 = 1 (p n p) 2 p n (p n+1 p n ) 2 = 1 (p n p)(p n+2 2p n+1 + p n ) = 1 ((p n+1 p) (p n p)) 2 (p n p)((p n+2 p) 2(p n+1 p) + (p n p))
25 Proof (3 of 5) Recall p n+1 p p n p = δ n + λ p n+1 p = (δ n + λ)(p n p)
26 Proof (3 of 5) Recall p n+1 p p n p = δ n + λ p n+1 p = (δ n + λ)(p n p) This implies p 2 p = (δ 1 + λ)(p 1 p) p 3 p = (δ 2 + λ)(p 2 p) = (δ 1 + λ)(δ 2 + λ)(p 1 p). n p n+1 p = (p 1 p) (δ i + λ). i=1
27 Proof (4 of 5) Consequently ˆp n p p n p = 1 ((p n+1 p) (p n p)) 2 (p n p)((p n+2 p) 2(p n+1 p) + (p n p)) = 2 n n 1 (p 1 p) (δ i + λ) (p 1 p) (δ i + λ) i=1 i=1 1 ( n 1 n+1 n n 1 ) (p 1 p) (δ i + λ) (p 1 p) (δ i + λ) 2(p 1 p) (δ i + λ) + (p 1 p) (δ i + λ) i=1 = 1 n 1 (δ i + λ) = 1 i=1 n 1 i=1 i=1 i=1 ( n+1 i=1 n 1 i=1 n n 1 (δ i + λ) (δ i + λ) i=1 2 ) n n 1 (δ i + λ) 2 (δ i + λ) + (δ i + λ) i=1 2 (δ i + λ) (δ i + λ) 2 i=1 (δ n+λ 1) 2 ((δ n+1 +λ)(δ n+λ) 2(δ n+λ)+1) i=1 i=1
28 Proof (5 of 5) ˆp n p p n p = 1 = 1 n 1 i=1 n 1 i=1 2 (δ i + λ) (δ i + λ) 2 (δ n+λ 1) 2 ((δ n+1 +λ)(δ n+λ) 2(δ n+λ)+1) (δ n + λ 1) 2 (δ n+1 + λ)(δ n + λ) 2(δ n + λ) + 1
29 Proof (5 of 5) ˆp n p p n p = 1 = 1 n 1 i=1 Taking the limit as n : ˆp n p lim n p n p = lim n = 1 = 0 n 1 i=1 2 (δ i + λ) (δ i + λ) 2 (δ n+λ 1) 2 ((δ n+1 +λ)(δ n+λ) 2(δ n+λ)+1) (δ n + λ 1) 2 (δ n+1 + λ)(δ n + λ) 2(δ n + λ) + 1 [ 1 (δ n + λ 1) 2 ] (δ n+1 + λ)(δ n + λ) 2(δ n + λ) + 1 (λ 1)2 λ 2 2λ + 1
30 Steffensen s Method We can use Aitken s 2 Method to accelerate the convergence of any linearly convergent sequence generated by fixed-point iteration.
31 Steffensen s Method We can use Aitken s 2 Method to accelerate the convergence of any linearly convergent sequence generated by fixed-point iteration. Consider the fixed point problem g(x) = x and an initial approximation p 0. Calculate p 1 = g(p 0 ) p 2 = g(p 1 ) { ˆp 0 = 2} (p 0 ) p 4 = g(ˆp 0 ) p 5 = g(p 4 ) { ˆp 1 = 2} (ˆp 0 ) p 7 = g(ˆp 1 ) p 8 = g(p 7 ) { ˆp 2 = 2} (ˆp 1 )
32 Steffensen s Method We can use Aitken s 2 Method to accelerate the convergence of any linearly convergent sequence generated by fixed-point iteration. Consider the fixed point problem g(x) = x and an initial approximation p 0. Calculate p 1 = g(p 0 ) p 2 = g(p 1 ) { ˆp 0 = 2} (p 0 ) p 4 = g(ˆp 0 ) p 5 = g(p 4 ) { ˆp 1 = 2} (ˆp 0 ) p 7 = g(ˆp 1 ) p 8 = g(p 7 ) { ˆp 2 = 2} (ˆp 1 ) Every 3rd term is calculated using the 2 method, all other terms use fixed-point iteration.
33 Algorithm INPUT initial approximation p 0, tolerance ɛ, maximum iterations N. STEP 1 Set i = 1. STEP 2 While i N do STEPS 3 6. STEP 3 Set p 1 = g(p 0 ); p 2 = g(p 1 ); p = { 2} (p 0 ). STEP 4 If p p 0 < ɛ then OUTPUT p; STOP. STEP 5 Set i = i + 1. STEP 6 Set p 0 = p. STEP 7 OUTPUT Method failed after N iterations. ; STOP.
34 Example Use Steffensen s Method to approximate the solution to x 3 x = 0 for x [0, 1].
35 Example Use Steffensen s Method to approximate the solution to x 3 x = 0 for x [0, 1]. n Fixed-point Steffensen s
36 Final Result Remark: Steffensen s Method appears to generate a quadratically convergent sequence for root finding without requiring computation of a derivative.
37 Final Result Remark: Steffensen s Method appears to generate a quadratically convergent sequence for root finding without requiring computation of a derivative. Theorem Suppose g(x) = x has a solution p with g (p) 1. If there exists δ > 0 such that g C 3 [p δ, p + δ], the Steffensen s Method gives quadratic convergence for any p 0 [p δ, p + δ].
38 Homework Read Section 2.5. Exercises: 1, 2, 7, 9, 11
Fixed-Point Iteration
Fixed-Point Iteration MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation Several root-finding algorithms operate by repeatedly evaluating a function until its
More informationReview of Power Series
Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power
More informationNeville s Method. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Neville s Method
Neville s Method MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have learned how to approximate a function using Lagrange polynomials and how to estimate
More informationVariable. Peter W. White Fall 2018 / Numerical Analysis. Department of Mathematics Tarleton State University
Newton s Iterative s Peter W. White white@tarleton.edu Department of Mathematics Tarleton State University Fall 2018 / Numerical Analysis Overview Newton s Iterative s Newton s Iterative s Newton s Iterative
More informationOrder of convergence
Order of convergence Linear and Quadratic Order of convergence Computing square root with Newton s Method Given a > 0, p def = a is positive root of equation Newton s Method p k+1 = p k p2 k a 2p k = 1
More informationSection 6.3 Richardson s Extrapolation. Extrapolation (To infer or estimate by extending or projecting known information.)
Section 6.3 Richardson s Extrapolation Key Terms: Extrapolation (To infer or estimate by extending or projecting known information.) Illustrated using Finite Differences The difference between Interpolation
More informationLinear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Linear Independence MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Given a set of vectors {v 1, v 2,..., v r } and another vector v span{v 1, v 2,...,
More informationBisection Method. and compute f (p 1 ). repeat with p 2 = a 2+b 2
Bisection Method Given continuous function f (x) on the interval [a, b] with f (a) f (b) < 0, there must be a root in (a, b). To find a root: set [a 1, b 1 ] = [a, b]. set p 1 = a 1+b 1 2 and compute f
More informationFIXED POINT ITERATION
FIXED POINT ITERATION The idea of the fixed point iteration methods is to first reformulate a equation to an equivalent fixed point problem: f (x) = 0 x = g(x) and then to use the iteration: with an initial
More informationRow Space, Column Space, and Nullspace
Row Space, Column Space, and Nullspace MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Every matrix has associated with it three vector spaces: row space
More informationCalculus and Parametric Equations
Calculus and Parametric Equations MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Given a pair a parametric equations x = f (t) y = g(t) for a t b we know how
More informationInterpolation and the Lagrange Polynomial
Interpolation and the Lagrange Polynomial MATH 375 J. Robert Buchanan Department of Mathematics Fall 2013 Introduction We often choose polynomials to approximate other classes of functions. Theorem (Weierstrass
More informationSolving Quadratic Equations
Solving Quadratic Equations MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: solve quadratic equations by factoring, solve quadratic
More informationNumerical Methods
Numerical Methods 263-2014 Prof. M. K. Banda Botany Building: 2-10. Prof. M. K. Banda (Tuks) WTW263 Semester II 1 / 18 Topic 1: Solving Nonlinear Equations Prof. M. K. Banda (Tuks) WTW263 Semester II 2
More informationComputer Arithmetic. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Computer Arithmetic
Computer Arithmetic MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Machine Numbers When performing arithmetic on a computer (laptop, desktop, mainframe, cell phone,
More informationMath Introduction to Numerical Methods - Winter 2011 Homework 2 Assigned: Friday, January 14, Due: Thursday, January 27,
Math 371 - Introduction to Numerical Methods - Winter 2011 Homework 2 Assigned: Friday, January 14, 2011. Due: Thursday, January 27, 2011.. Include a cover page. You do not need to hand in a problem sheet.
More informationBessel s Equation. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics
Bessel s Equation MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Background Bessel s equation of order ν has the form where ν is a constant. x 2 y + xy
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationLimit Theorems. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Limit Theorems
Limit s MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Bounded Functions Definition Let A R, let f : A R, and let c R be a cluster point of A. We say that f is bounded
More informationRomberg Integration. MATH 375 Numerical Analysis. J. Robert Buchanan. Spring Department of Mathematics
Romberg Integration MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Spring 019 Objectives and Background In this lesson we will learn to obtain high accuracy approximations to
More informationApplied Mathematical Sciences, Vol. 6, 2012, no. 77, Oana Bumbariu
Applied Mathematical Sciences, Vol. 6, 2012, no. 77, 3821-3826 A Convergence Result for the B-Algorithm Oana Bumbariu North University of Baia Mare Department of Mathematics and Computer Science Victoriei
More informationContinuity. MATH 161 Calculus I. J. Robert Buchanan. Fall Department of Mathematics
Continuity MATH 161 Calculus I J. Robert Buchanan Department of Mathematics Fall 2017 Intuitive Idea A process or an item can be described as continuous if it exists without interruption. The mathematical
More informationEquations in Quadratic Form
Equations in Quadratic Form MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: make substitutions that allow equations to be written
More informationChain Rule. MATH 311, Calculus III. J. Robert Buchanan. Spring Department of Mathematics
3.33pt Chain Rule MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Spring 2019 Single Variable Chain Rule Suppose y = g(x) and z = f (y) then dz dx = d (f (g(x))) dx = f (g(x))g (x)
More informationAbsolute Convergence and the Ratio Test
Absolute Convergence and the Ratio Test MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Bacground Remar: All previously covered tests for convergence/divergence apply only
More informationSEC POWER METHOD Power Method
SEC..2 POWER METHOD 599.2 Power Method We now describe the power method for computing the dominant eigenpair. Its extension to the inverse power method is practical for finding any eigenvalue provided
More informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
More informationSection 3.3 Product and Quotient rules 1 Lecture. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I
Section 3.3 Product and Quotient rules 1 Lecture College of Science MATHS 101: Calculus I (University of Bahrain) Differentiation Rules 1 / 12 Motivation Goal: We want to derive rules to find the derivative
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationOrthonormal Bases; Gram-Schmidt Process; QR-Decomposition
Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 205 Motivation When working with an inner product space, the most
More informationElementary Matrices. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Elementary Matrices MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Outline Today s discussion will focus on: elementary matrices and their properties, using elementary
More informationPlane Curves and Parametric Equations
Plane Curves and Parametric Equations MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction We typically think of a graph as a curve in the xy-plane generated by the
More informationVectors in the Plane
Vectors in the Plane MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Vectors vs. Scalars scalar quantity having only a magnitude (e.g. temperature, volume, length, area) and
More informationLimits and Continuity
Limits and Continuity MATH 151 Calculus for Management J. Robert Buchanan Department of Mathematics Fall 2018 Objectives After this lesson we will be able to: Determine the left-hand and right-hand limits
More informationNumerical Optimization
Unconstrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 01, India. NPTEL Course on Unconstrained Minimization Let f : R n R. Consider the optimization problem:
More informationFundamental Trigonometric Identities
Fundamental Trigonometric Identities MATH 160, Precalculus J. Robert Buchanan Department of Mathematics Fall 2011 Objectives In this lesson we will learn to: recognize and write the fundamental trigonometric
More informationSection 4.3 Concavity and Curve Sketching 1.5 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I
Section 4.3 Concavity and Curve Sketching 1.5 Lectures College of Science MATHS 101: Calculus I (University of Bahrain) Concavity 1 / 29 Concavity Increasing Function has three cases (University of Bahrain)
More informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
More informationSeries Solutions Near a Regular Singular Point
Series Solutions Near a Regular Singular Point MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Background We will find a power series solution to the equation:
More informationMAT137 Calculus! Lecture 45
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 45 Today: Taylor Polynomials Taylor Series Next: Taylor Series Power Series Definition (Power Series) A power series is a series of the form
More informationPRACTICE PROBLEM SET
PRACTICE PROBLEM SET NOTE: On the exam, you will have to show all your work (unless told otherwise), so write down all your steps and justify them. Exercise. Solve the following inequalities: () x < 3
More informationNotes for Numerical Analysis Math 5465 by S. Adjerid Virginia Polytechnic Institute and State University. (A Rough Draft)
Notes for Numerical Analysis Math 5465 by S. Adjerid Virginia Polytechnic Institute and State University (A Rough Draft) 1 2 Contents 1 Error Analysis 5 2 Nonlinear Algebraic Equations 7 2.1 Convergence
More informationMean Value Theorem. MATH 161 Calculus I. J. Robert Buchanan. Summer Department of Mathematics
Mean Value Theorem MATH 161 Calculus I J. Robert Buchanan Department of Mathematics Summer 2018 Background: Corollary to the Intermediate Value Theorem Corollary Suppose f is continuous on the closed interval
More informationMATH 4211/6211 Optimization Basics of Optimization Problems
MATH 4211/6211 Optimization Basics of Optimization Problems Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 A standard minimization
More informationMean Value Theorem. MATH 161 Calculus I. J. Robert Buchanan. Summer Department of Mathematics
Mean Value Theorem MATH 161 Calculus I J. Robert Buchanan Department of Mathematics Summer 2018 Background: Corollary to the Intermediate Value Theorem Corollary Suppose f is continuous on the closed interval
More informationPART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435
PART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435 Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu
More informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationMATH115. Sequences and Infinite Series. Paolo Lorenzo Bautista. June 29, De La Salle University. PLBautista (DLSU) MATH115 June 29, / 16
MATH115 Sequences and Infinite Series Paolo Lorenzo Bautista De La Salle University June 29, 2014 PLBautista (DLSU) MATH115 June 29, 2014 1 / 16 Definition A sequence function is a function whose domain
More informationFundamental Theorem of Calculus
Fundamental Theorem of Calculus MATH 6 Calculus I J. Robert Buchanan Department of Mathematics Summer 208 Remarks The Fundamental Theorem of Calculus (FTC) will make the evaluation of definite integrals
More informationMotion in Space. MATH 311, Calculus III. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Motion in Space
Motion in Space MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Background Suppose the position vector of a moving object is given by r(t) = f (t), g(t), h(t), Background
More informationMath 2142 Homework 5 Part 1 Solutions
Math 2142 Homework 5 Part 1 Solutions Problem 1. For the following homogeneous second order differential equations, give the general solution and the particular solution satisfying the given initial conditions.
More informationAbsolute Convergence and the Ratio Test
Absolute Convergence and the Ratio Test MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Bacground Remar: All previously covered tests for convergence/divergence apply only
More informationExtrema of Functions of Several Variables
Extrema of Functions of Several Variables MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Background (1 of 3) In single-variable calculus there are three important results
More informationChapter 3: Root Finding. September 26, 2005
Chapter 3: Root Finding September 26, 2005 Outline 1 Root Finding 2 3.1 The Bisection Method 3 3.2 Newton s Method: Derivation and Examples 4 3.3 How To Stop Newton s Method 5 3.4 Application: Division
More informationEvaluating Determinants by Row Reduction
Evaluating Determinants by Row Reduction MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives Reduce a matrix to row echelon form and evaluate its determinant.
More informationInfinite Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Infinite Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background Consider the repeating decimal form of 2/3. 2 3 = 0.666666 = 0.6 + 0.06 + 0.006 + 0.0006 + = 6(0.1)
More informationExercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 <
Math 316, Intro to Analysis Limits of functions We are experts at taking limits of sequences as the indexing parameter gets close to infinity. What about limits of functions as the independent variable
More informationLecture 5. September 4, 2018 Math/CS 471: Introduction to Scientific Computing University of New Mexico
Lecture 5 September 4, 2018 Math/CS 471: Introduction to Scientific Computing University of New Mexico 1 Review: Office hours at regularly scheduled times this week Tuesday: 9:30am-11am Wed: 2:30pm-4:00pm
More informationSection 8.7. Taylor and MacLaurin Series. (1) Definitions, (2) Common Maclaurin Series, (3) Taylor Polynomials, (4) Applications.
Section 8.7 Taylor and MacLaurin Series (1) Definitions, (2) Common Maclaurin Series, (3) Taylor Polynomials, (4) Applications. MATH 126 (Section 8.7) Taylor and MacLaurin Series The University of Kansas
More information2. The Power Method for Eigenvectors
2. Power Method We now describe the power method for computing the dominant eigenpair. Its extension to the inverse power method is practical for finding any eigenvalue provided that a good initial approximation
More informationFall 2016 Math 2B Suggested Homework Problems Solutions
Fall 016 Math B Suggested Homework Problems Solutions Antiderivatives Exercise : For all x ], + [, the most general antiderivative of f is given by : ( x ( x F(x = + x + C = 1 x x + x + C. Exercise 4 :
More informationExponential Functions
Exponential Functions MATH 160, Precalculus J. Robert Buchanan Department of Mathematics Fall 2011 Objectives In this lesson we will learn to: recognize and evaluate exponential functions with base a,
More informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
More informationROOT FINDING REVIEW MICHELLE FENG
ROOT FINDING REVIEW MICHELLE FENG 1.1. Bisection Method. 1. Root Finding Methods (1) Very naive approach based on the Intermediate Value Theorem (2) You need to be looking in an interval with only one
More informationStokes Theorem. MATH 311, Calculus III. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Stokes Theorem
tokes Theorem MATH 311, alculus III J. Robert Buchanan Department of Mathematics ummer 2011 Background (1 of 2) Recall: Green s Theorem, M(x, y) dx + N(x, y) dy = R ( N x M ) da y where is a piecewise
More informationLIMITS AT INFINITY MR. VELAZQUEZ AP CALCULUS
LIMITS AT INFINITY MR. VELAZQUEZ AP CALCULUS RECALL: VERTICAL ASYMPTOTES Remember that for a rational function, vertical asymptotes occur at values of x = a which have infinite its (either positive or
More information2.4 - Convergence of the Newton Method and Modified Newton Method
2.4 - Convergence of the Newton Method and Modified Newton Method Consider the problem of finding the solution of the equation: for in Assume that is continuous and for in 1. Newton's Method: Suppose that
More informationApplications Involving Rational Functions
Applications Involving Rational Functions MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: solve applied problems related to
More informationNumerical Methods
Numerical Methods 263-2014 Prof. M. K. Banda Botany Building: 2-10. Prof. M. K. Banda (Tuks) WTW263 Semester II 1 / 27 Theme 1: Solving Nonlinear Equations Prof. M. K. Banda (Tuks) WTW263 Semester II 2
More informationSolutions of Equations in One Variable. Newton s Method
Solutions of Equations in One Variable Newton s Method Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011 Brooks/Cole,
More informationConic Sections in Polar Coordinates
Conic Sections in Polar Coordinates MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction We have develop the familiar formulas for the parabola, ellipse, and hyperbola
More informationRank and Nullity. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Rank and Nullity MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives We have defined and studied the important vector spaces associated with matrices (row space,
More information3.1 Introduction. Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x x 1.5 =0, tan x x =0.
3.1 Introduction Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x 3 +1.5x 1.5 =0, tan x x =0. Practical existence test for roots: by intermediate value theorem, f C[a, b] & f(a)f(b)
More informationSeparable Differential Equations
Separable Differential Equations MATH 6 Calculus I J. Robert Buchanan Department of Mathematics Fall 207 Background We have previously solved differential equations of the forms: y (t) = k y(t) (exponential
More informationNumerical Methods. Root Finding
Numerical Methods Solving Non Linear 1-Dimensional Equations Root Finding Given a real valued function f of one variable (say ), the idea is to find an such that: f() 0 1 Root Finding Eamples Find real
More informationNumerical Methods in Informatics
Numerical Methods in Informatics Lecture 2, 30.09.2016: Nonlinear Equations in One Variable http://www.math.uzh.ch/binf4232 Tulin Kaman Institute of Mathematics, University of Zurich E-mail: tulin.kaman@math.uzh.ch
More informationSimple Iteration, cont d
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 2 Notes These notes correspond to Section 1.2 in the text. Simple Iteration, cont d In general, nonlinear equations cannot be solved in a finite sequence
More informationMath 126 Enhanced 10.3 Series with positive terms The University of Kansas 1 / 12
Section 10.3 Convergence of series with positive terms 1. Integral test 2. Error estimates for the integral test 3. Comparison test 4. Limit comparison test (LCT) Math 126 Enhanced 10.3 Series with positive
More informationArc Length and Surface Area in Parametric Equations
Arc Length and Surface Area in Parametric Equations MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2011 Background We have developed definite integral formulas for arc length
More informationThe Derivative of a Function Measuring Rates of Change of a function. Secant line. f(x) f(x 0 ) Average rate of change of with respect to over,
The Derivative of a Function Measuring Rates of Change of a function y f(x) f(x 0 ) P Q Secant line x 0 x x Average rate of change of with respect to over, " " " " - Slope of secant line through, and,
More informationHence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ
Matthew Straughn Math 402 Homework 5 Homework 5 (p. 429) 13.3.5, 13.3.6 (p. 432) 13.4.1, 13.4.2, 13.4.7*, 13.4.9 (p. 448-449) 14.2.1, 14.2.2 Exercise 13.3.5. Let (X, d X ) be a metric space, and let f
More informationSeries Solutions Near an Ordinary Point
Series Solutions Near an Ordinary Point MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Spring 2018 Ordinary Points (1 of 2) Consider the second order linear homogeneous
More informationx 2 x n r n J(x + t(x x ))(x x )dt. For warming-up we start with methods for solving a single equation of one variable.
Maria Cameron 1. Fixed point methods for solving nonlinear equations We address the problem of solving an equation of the form (1) r(x) = 0, where F (x) : R n R n is a vector-function. Eq. (1) can be written
More informationSolving Systems of Linear and Quadratic Equations
9.5 Solving Systems of Linear and Quadratic Equations How can you solve a system of two equations when one is linear and the other is quadratic? ACTIVITY: Solving a System of Equations Work with a partner.
More informationFixed point iteration Numerical Analysis Math 465/565
Fixed point iteration Numerical Analysis Math 465/565 1 Fixed Point Iteration Suppose we wanted to solve : f(x) = cos(x) x =0 or cos(x) =x We might consider a iteration of this type : x k+1 = cos(x k )
More informationRoot Finding For NonLinear Equations Bisection Method
Root Finding For NonLinear Equations Bisection Method P. Sam Johnson November 17, 2014 P. Sam Johnson (NITK) Root Finding For NonLinear Equations Bisection MethodNovember 17, 2014 1 / 26 Introduction The
More informationyou expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form
Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 7 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 7 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.2.1, 4.2.3, 4.2.6, 4.2.8,
More informationChapter 1. Root Finding Methods. 1.1 Bisection method
Chapter 1 Root Finding Methods We begin by considering numerical solutions to the problem f(x) = 0 (1.1) Although the problem above is simple to state it is not always easy to solve analytically. This
More informationSystems of Ordinary Differential Equations
Systems of Ordinary Differential Equations MATH 365 Ordinary Differential Equations J Robert Buchanan Department of Mathematics Fall 2018 Objectives Many physical problems involve a number of separate
More informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
More informationImplicit Differentiation and Inverse Trigonometric Functions
Implicit Differentiation an Inverse Trigonometric Functions MATH 161 Calculus I J. Robert Buchanan Department of Mathematics Summer 2018 Explicit vs. Implicit Functions 0.5 1 y 0.0 y 2 0.5 3 4 1.0 0.5
More information(4.2) -Richardson Extrapolation
(.) -Ricardson Extrapolation. Small-O Notation: Recall tat te big-o notation used to define te rate of convergence in Section.: Suppose tat lim G 0 and lim F L. Te function F is said to converge to L as
More informationMATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N.
MATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of F (x) = 0, their advantages and disadvantages.
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series
More informationWarm-up Simple methods Linear recurrences. Solving recurrences. Misha Lavrov. ARML Practice 2/2/2014
Solving recurrences Misha Lavrov ARML Practice 2/2/2014 Warm-up / Review 1 Compute 100 k=2 ( 1 1 ) ( = 1 1 ) ( 1 1 ) ( 1 1 ). k 2 3 100 2 Compute 100 k=2 ( 1 1 ) k 2. Homework: find and solve problem Algebra
More informationPLC Papers. Created For:
PLC Papers Created For: t followed by close scrutiny of the marking scheme followed by reassessing every 3 days to attain at least 8 out o Approximate solutions to equations using iteration 1 Grade 9 Objective:
More informationNonlinear Integral Equation Formulation of Orthogonal Polynomials
Nonlinear Integral Equation Formulation of Orthogonal Polynomials Eli Ben-Naim Theory Division, Los Alamos National Laboratory with: Carl Bender (Washington University, St. Louis) C.M. Bender and E. Ben-Naim,
More informationToday s class. Numerical differentiation Roots of equation Bracketing methods. Numerical Methods, Fall 2011 Lecture 4. Prof. Jinbo Bi CSE, UConn
Today s class Numerical differentiation Roots of equation Bracketing methods 1 Numerical Differentiation Finite divided difference First forward difference First backward difference Lecture 3 2 Numerical
More informationMAT137 Calculus! Lecture 9
MAT137 Calculus! Lecture 9 Today we will study: Limits at infinity. L Hôpital s Rule. Mean Value Theorem. (11.5,11.6, 4.1) PS3 is due this Friday June 16. Next class: Applications of the Mean Value Theorem.
More information