FIXED POINT ITERATION
|
|
- Godfrey Rice
- 6 years ago
- Views:
Transcription
1 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 guess x 0 chosen, compute a sequence in the hope that x n α. x n+1 = g(x n ), n 0 There are infinite many ways to introduce an equivalent fixed point problem for a given equation.
2 Example We begin with an example. Consider solving the two equations E1: x = sin x E2: x = sin x y y y = 3 + 2sin x y = 1 +.5sin x y = x y = x α x α x
3 The solutions are E1: x = sin x E2: x = sin x E1: α = E2: α = We are going to use a numerical scheme called fixed point iteration. It amounts to making an initial guess of x 0 and substituting this into the right side of the equation. The resulting value is denoted by x 1 ; and then the process is repeated, this time substituting x 1 into the right side. This is repeated until convergence occurs or until the iteration is terminated. for n = 0, 1, 2,... E1: x n+1 = sin x n E2: x n+1 = sin x n
4 E1 E2 n x n x n We show the results of the first 10 iterations in the table. Clearly convergence is occurring with E1, but not with E2. Why?
5 Fixed point iteration methods In general, we are interested in solving the equation by means of fixed point iteration: x = g(x) x n+1 = g(x n ), n = 0, 1, 2,... It is called fixed point iteration because the root α of the equation x g(x) = 0 is a fixed point of the function g(x), meaning that α is a number for which g(α) = α. The Newton method x n+1 = x n f (x n) f (x n ) is also an example of fixed point iteration, for the equation x = x f (x) f (x)
6 EXISTENCE THEOREM We begin by asking whether the equation x = g(x) has a solution. For this to occur, the graphs of y = x and y = g(x) must intersect, as seen on the earlier graphs. y y y = 3 + 2sin x y = 1 +.5sin x y = x y = x α x α x
7 Solution Existence Lemma: Let g(x) be a continuous function on the interval [a, b], and suppose it satisfies the property a x b a g(x) b (#) Then the equation x = g(x) has at least one solution α in the interval [a, b]. The proof of this is fairly intuitive. Look at the function f (x) = x g(x), a x b Evaluating at the endpoints, f (a) 0, f (b) 0 The function f (x) is continuous on [a, b], and therefore it contains a zero in the interval.
8 Examples Example 1. Consider the equation Here x = sin x. g(x) = sin x. Note that 0.5 g(x) 1.5 for any x R. Also, g(x) is a continuous function. Applying the existence lemma, we conclude that the equation x = sin x has a solution in [a, b] with a 0.5 and b 1.5. Example 2. Similarly, the equation x = sin x has a solution in [a, b] with a 1 and b 5.
9 Theorem Assume g(x) and g (x) exist and are continuous on the interval [a, b]; and further, assume a x b a g(x) b λ max g (x) < 1 a x b Then: S1. The equation x = g(x) has a unique solution α in [a, b]. S2. For any initial guess x 0 in [a, b], the iteration x n+1 = g(x n ), n = 0, 1, 2,... will converge to α. S3. α x n λn 1 λ x 1 x 0, n 0 S4. α x n+1 lim = g (α) n α x n Thus for x n close to α, α x n+1 g (α) (α x n ).
10 The following general result is useful in the proof. For any two points w and z in [a, b], g(w) g(z) = g (c) (w z) for some unknown point c between w and z. Therefore, g(w) g(z) λ w z (@) for any a w, z b. For S1, suppose there are two solutions α and β: α = g(α), β = g(β). By (@), α β = g(α) g(β) λ α β implying α β = 0 since λ < 1.
11 For S2, note that from (#), if x 0 is in [a, b], then x 1 = g(x 0 ) is also in [a, b]. Repeat the argument to show that every x n belongs to [a, b]. Subtract x n+1 = g(x n ) from α = g(α) to get α x n+1 = g(α) g(x n ) = g (c n ) (α x n ) ($) α x n+1 λ α x n (*) with c n between α and x n. From (*), we have that the error is guaranteed to decrease by a factor of λ with each iteration. This leads to α x n λ n α x 0, n 0 (%) Convergence follows from the condition that λ < 1.
12 For S3, use (*) for n = 0, α x 0 α x 1 + x 1 x 0 λ α x 0 + x 1 x 0 α x λ x 1 x 0 Combine this with (%) to get the error bound. For S4, use ($) to write α x n+1 α x n = g (c n ) Since x n α and c n is between α and x n, we have g (c n ) g (α).
13 The statement α x n+1 g (α) (α x n ) tells us that when near to the root α, the errors will decrease by a constant factor of g (α). If g (α) is negative, then the errors will oscillate between positive and negative, and the iterates will be approaching from both sides. When g (α) is positive, the iterates will approach α from only one side. The statements α x n+1 = g (c n ) (α x n ) α x n+1 g (α) (α x n ) also tell us a bit more of what happens when g (α) > 1 Then the errors will increase as we approach the root rather than decrease in size.
14 Application of the theorem Look at the earlier example. First consider Here E1: x = sin x g(x) = sin x We can take [a, b] with any a 0.5 and b 1.5. Note that g (x) =.5 cos x, g (x) 1 2 Therefore, we can apply the theorem and conclude that the fixed point iteration x n+1 = sin x n will converge for E1.
15 Application of the theorem (cont.) Then we consider the second equation E2: x = sin x Here g(x) = sin x Note that g(x) = sin x, g (x) = 2 cos x g (α) = 2 cos ( ) = Therefore the fixed point iteration will diverge for E2. x n+1 = sin x n
16 Localized version of the theorem Often, the theorem is not easy to apply directly due to the need to identify an interval [a, b] on which the conditions on g and g are valid. So we turn to a localized version of the theorem. Assume x = g(x) has a solution α, both g(x) and g (x) are continuous for all x in some interval about α, and g (α) < 1 (**) Then for any sufficiently small number ε > 0, the interval [a, b] = [α ε, α + ε] will satisfy the hypotheses of the theorem. This means that if (**) is true, and if we choose x 0 sufficiently close to α, then the fixed point iteration x n+1 = g(x n ) will converge and the earlier results S1 S4 will all hold. The result does not tell us how close we need to be to α in order to have convergence.
17 NEWTON S METHOD Newton s method is a fixed point iteration with x n+1 = x n f (x n) f (x n ) g(x) = x f (x) f (x) Check its convergence by checking the condition (**). g (x) = 1 f (x) f (x) + f (x)f (x) [f (x)] 2 = f (x)f (x) [f (x)] 2 g (α) = 0 Therefore the Newton method will converge if x 0 is chosen sufficiently close to α.
18 HIGHER ORDER METHODS What happens when g (α) = 0? We use Taylor s theorem to answer this question. Begin by writing g(x) = g(α) + g (α) (x α) g (c) (x α) 2 with c between x and α. Substitute x = x n and recall that g(x n ) = x n+1 and g(α) = α. Also assume g (α) = 0. Then x n+1 = α g (c n ) (x n α) 2 α x n+1 = 1 2 g (c n ) (α x n ) 2 with c n between α and x n. Thus if g (α) = 0, the fixed point iteration is quadratically convergent or better. In fact, if g (α) 0, then the iteration is exactly quadratically convergent.
19 ANOTHER RAPID ITERATION Newton s method is rapid, but requires use of the derivative f (x). Can we get by without this? The answer is yes! Consider the method D n = f (x n + f (x n )) f (x n ) f (x n ) x n+1 = x n f (x n) D n This is an approximation to Newton s method, with f (x n ) D n. To analyze its convergence, regard it as a fixed point iteration with f (x + f (x)) f (x) D(x) = f (x) g(x) = x f (x) D(x) Then we can show that g (α) = 0 and g (α) 0. So this new iteration is quadratically convergent.
20 FIXED POINT ITERATION: ERROR Recall the result for the iteration Thus lim n with λ = g (α) and λ < 1. α x n α x n 1 = g (α) x n = g(x n 1 ), n = 1, 2,... α x n λ (α x n 1 ) (***) If we were to know λ, then we could solve (***) for α: α x n λx n 1 1 λ
21 Usually, we write this as a modification of the currently computed iterate x n : α x n λx n 1 1 λ = x n λx n 1 λ + λx n λx n 1 1 λ = x n + λ 1 λ (x n x n 1 ) The formula x n + λ 1 λ (x n x n 1 ) is said to be an extrapolation of the numbers x n 1 and x n. But what is λ? From we have lim n α x n α x n 1 = g (α) λ α x n α x n 1
22 Unfortunately this also involves the unknown root α which we seek; and we must find some other way of estimating λ. To calculate λ consider the ratio λ n = x n x n 1 x n 1 x n 2 To see this is approximately λ as x n approaches α, write x n x n 1 = g(x n 1) g(x n 2 ) = g (c n ) x n 1 x n 2 x n 1 x n 2 with c n between x n 1 and x n 2. As the iterates approach α, the number c n must also approach α. Thus λ n approaches λ as x n α.
23 Combine these results to obtain the estimation x n = x n + λ n 1 λ n (x n x n 1 ), λ n = x n x n 1 x n 1 x n 2 We call x n the Aitken extrapolate of {x n 2, x n 1, x n }; and α x n. We can also rewrite this as α x n x n x n = λ n 1 λ n (x n x n 1 ) This is called Aitken s error estimation formula. The accuracy of these procedures is tied directly to the accuracy of the formulas α x n λ (α x n 1 ), α x n 1 λ (α x n 2 ) If this is accurate, then so are the above extrapolation and error estimation formulas.
24 EXAMPLE Consider the iteration for solving x n+1 = sin(x n ), n = 0, 1, 2,... x = sin x Iterates are shown on the accompanying sheet, including calculations of λ n, the error estimate α x n x n x n = λ n 1 λ n (x n x n 1 ) (Estimate) The latter is called Estimate in the table. In this instance, g (α). =.9644 and therefore the convergence is very slow. This is apparent in the table.
25 n x n x n x n 1 λ n α x n Estimate E E E E E E E E E E E E E E E E E E E E E 2
26 AITKEN S ALGORITHM Step 1: Select x 0 Step 2: Calculate Step3: Calculate Step 4: Calculate x 1 = g(x 0 ), x 2 = g(x 1 ) x 3 = x 2 + λ 2 1 λ 2 (x 2 x 1 ), λ 2 = x 2 x 1 x 1 x 0 x 4 = g(x 3 ), x 5 = g(x 4 ) and calculate x 6 as the extrapolate of {x 3, x 4, x 5 }. Continue this procedure, ad infinatum. Of course in practice we will have some kind of error test to stop this procedure when believe we have sufficient accuracy.
27 EXAMPLE Consider again the iteration for solving x n+1 = sin(x n ), n = 0, 1, 2,... x = sin x Now we use the Aitken method, and the results are shown in the accompanying table. With this we have α x 3. = , α x 6. = In comparison, the original iteration had α x 6. =
28 GENERAL COMMENTS Aitken extrapolation can greatly accelerate the convergence of a linearly convergent iteration x n+1 = g(x n ) This shows the power of understanding the behaviour of the error in a numerical process. From that understanding, we can often improve the accuracy, thru extrapolation or some other procedure. This is a justification for using mathematical analysis to understand numerical methods. We will see this repeated at later points in the course, and it holds with many different types of problems and numerical methods for their solution.
Chapter 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
Unit 2: Solving Scalar Equations. Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright
cs416: introduction to scientific computing 01/9/07 Unit : Solving Scalar Equations Notes prepared by: Amos Ron, Yunpeng Li, Mark Cowlishaw, Steve Wright Instructor: Steve Wright 1 Introduction We now
ROOT 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
Numerical 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
Accelerating Convergence
Accelerating Convergence MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have seen that most fixed-point methods for root finding converge only linearly
Section 21. The Metric Topology (Continued)
21. The Metric Topology (cont.) 1 Section 21. The Metric Topology (Continued) Note. In this section we give a number of results for metric spaces which are familar from calculus and real analysis. We also
Math 4329: Numerical Analysis Chapter 03: Fixed Point Iteration and Ill behaving problems. Natasha S. Sharma, PhD
Why another root finding technique? iteration gives us the freedom to design our own root finding algorithm. The design of such algorithms is motivated by the need to improve the speed and accuracy of
Numerical differentiation
Numerical differentiation Paul Seidel 1801 Lecture Notes Fall 011 Suppose that we have a function f(x) which is not given by a formula but as a result of some measurement or simulation (computer experiment)
Numerical 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
NUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
Bisection 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
MATH 1910 Limits Numerically and Graphically Introduction to Limits does not exist DNE DOES does not Finding Limits Numerically
MATH 90 - Limits Numerically and Graphically Introduction to Limits The concept of a limit is our doorway to calculus. This lecture will explain what the limit of a function is and how we can find such
Simple 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
SYSTEMS OF NONLINEAR EQUATIONS
SYSTEMS OF NONLINEAR EQUATIONS Widely used in the mathematical modeling of real world phenomena. We introduce some numerical methods for their solution. For better intuition, we examine systems of two
Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 5. Nonlinear Equations
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T Heath Chapter 5 Nonlinear Equations Copyright c 2001 Reproduction permitted only for noncommercial, educational
MATH 1231 MATHEMATICS 1B Calculus Section 4.4: Taylor & Power series.
MATH 1231 MATHEMATICS 1B 2010. For use in Dr Chris Tisdell s lectures. Calculus Section 4.4: Taylor & Power series. 1. What is a Taylor series? 2. Convergence of Taylor series 3. Common Maclaurin series
1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that
Chapter 4 Nonlinear equations 4.1 Root finding Consider the problem of solving any nonlinear relation g(x) = h(x) in the real variable x. We rephrase this problem as one of finding the zero (root) of a
8.5 Taylor Polynomials and Taylor Series
8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:
Chapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
Geometric 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
e x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form
Taylor Series Given a function f(x), we would like to be able to find a power series that represents the function. For example, in the last section we noted that we can represent e x by the power series
Numerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
1.7 Inequalities. Copyright Cengage Learning. All rights reserved.
1.7 Inequalities Copyright Cengage Learning. All rights reserved. Objectives Solving Linear Inequalities Solving Nonlinear Inequalities Absolute Value Inequalities Modeling with Inequalities 2 Inequalities
CHALLENGE! (0) = 5. Construct a polynomial with the following behavior at x = 0:
TAYLOR SERIES Construct a polynomial with the following behavior at x = 0: CHALLENGE! P( x) = a + ax+ ax + ax + ax 2 3 4 0 1 2 3 4 P(0) = 1 P (0) = 2 P (0) = 3 P (0) = 4 P (4) (0) = 5 Sounds hard right?
Numerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 17, 2017 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
Two hours UNIVERSITY OF MANCHESTER. 21 January
Two hours MATH20111 UNIVERSITY OF MANCHESTER REAL ANALYSIS 21 January 2015 09.45 11.45 Answer ALL SIX questions in Section A (50 marks in total). Answer TWO of the THREE questions in Section B (30 marks
SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS BISECTION METHOD
BISECTION METHOD If a function f(x) is continuous between a and b, and f(a) and f(b) are of opposite signs, then there exists at least one root between a and b. It is shown graphically as, Let f a be negative
MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series.
MATH 1231 MATHEMATICS 1B CALCULUS. Section 5: - Power Series and Taylor Series. The objective of this section is to become familiar with the theory and application of power series and Taylor series. By
Chapter 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
Infinite series, improper integrals, and Taylor series
Chapter 2 Infinite series, improper integrals, and Taylor series 2. Introduction to series In studying calculus, we have explored a variety of functions. Among the most basic are polynomials, i.e. functions
Scientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 5 Nonlinear Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
CS 450 Numerical Analysis. Chapter 5: Nonlinear Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
PART 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
INTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 = 0, x 1 = π/4, x
We consider the problem of finding a polynomial that interpolates a given set of values:
Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.
1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
Order 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
CHAPTER 10 Zeros of Functions
CHAPTER 10 Zeros of Functions An important part of the maths syllabus in secondary school is equation solving. This is important for the simple reason that equations are important a wide range of problems
Section 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
Geometric 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, 2017 Outline Geometric Series The
Zeros of Functions. Chapter 10
Chapter 10 Zeros of Functions An important part of the mathematics syllabus in secondary school is equation solving. This is important for the simple reason that equations are important a wide range of
3 Algebraic Methods. we can differentiate both sides implicitly to obtain a differential equation involving x and y:
3 Algebraic Methods b The first appearance of the equation E Mc 2 in Einstein s handwritten notes. So far, the only general class of differential equations that we know how to solve are directly integrable
Outline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations
Methods for Systems of Methods for Systems of Outline Scientific Computing: An Introductory Survey Chapter 5 1 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
Math 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
Scientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
Numerical 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
Lecture 7 - Separable Equations
Lecture 7 - Separable Equations Separable equations is a very special type of differential equations where you can separate the terms involving only y on one side of the equation and terms involving only
Preliminary check: are the terms that we are adding up go to zero or not? If not, proceed! If the terms a n are going to zero, pick another test.
Throughout these templates, let series. be a series. We hope to determine the convergence of this Divergence Test: If lim is not zero or does not exist, then the series diverges. Preliminary check: are
Solution of Algebric & Transcendental Equations
Page15 Solution of Algebric & Transcendental Equations Contents: o Introduction o Evaluation of Polynomials by Horner s Method o Methods of solving non linear equations o Bracketing Methods o Bisection
MA 8019: Numerical Analysis I Solution of Nonlinear Equations
MA 8019: Numerical Analysis I Solution of Nonlinear Equations Suh-Yuh Yang ( 楊肅煜 ) Department of Mathematics, National Central University Jhongli District, Taoyuan City 32001, Taiwan syyang@math.ncu.edu.tw
INFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES In section 11.9, we were able to find power series representations for a certain restricted class of functions. INFINITE SEQUENCES AND SERIES
Graphs of Antiderivatives, Substitution Integrals
Unit #10 : Graphs of Antiderivatives, Substitution Integrals Goals: Relationship between the graph of f(x) and its anti-derivative F (x) The guess-and-check method for anti-differentiation. The substitution
x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
Power series and Taylor series
Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series
Table of contents. d 2 y dx 2, As the equation is linear, these quantities can only be involved in the following manner:
M ath 0 1 E S 1 W inter 0 1 0 Last Updated: January, 01 0 Solving Second Order Linear ODEs Disclaimer: This lecture note tries to provide an alternative approach to the material in Sections 4. 4. 7 and
The Relation between the Integral and the Derivative Graphs. Unit #10 : Graphs of Antiderivatives, Substitution Integrals
Graphs of Antiderivatives - Unit #0 : Graphs of Antiderivatives, Substitution Integrals Goals: Relationship between the graph of f(x) and its anti-derivative F (x) The guess-and-check method for anti-differentiation.
MATH ASSIGNMENT 03 SOLUTIONS
MATH444.0 ASSIGNMENT 03 SOLUTIONS 4.3 Newton s method can be used to compute reciprocals, without division. To compute /R, let fx) = x R so that fx) = 0 when x = /R. Write down the Newton iteration for
Advanced Mathematics Unit 2 Limits and Continuity
Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring
Advanced Mathematics Unit 2 Limits and Continuity
Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring
Math 480 The Vector Space of Differentiable Functions
Math 480 The Vector Space of Differentiable Functions The vector space of differentiable functions. Let C (R) denote the set of all infinitely differentiable functions f : R R. Then C (R) is a vector space,
Optimization Methods. Lecture 19: Line Searches and Newton s Method
15.93 Optimization Methods Lecture 19: Line Searches and Newton s Method 1 Last Lecture Necessary Conditions for Optimality (identifies candidates) x local min f(x ) =, f(x ) PSD Slide 1 Sufficient Conditions
Math 1b Sequences and series summary
Math b Sequences and series summary December 22, 2005 Sequences (Stewart p. 557) Notations for a sequence: or a, a 2, a 3,..., a n,... {a n }. The numbers a n are called the terms of the sequence.. Limit
Chapter 4. Solution of Non-linear Equation. Module No. 1. Newton s Method to Solve Transcendental Equation
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-713209 email: anita.buie@gmail.com 1 . Chapter 4 Solution of Non-linear
Numerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
Section 3.7. Rolle s Theorem and the Mean Value Theorem
Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate of change and the average rate of change of
Outline. Math Numerical Analysis. Intermediate Value Theorem. Lecture Notes Zeros and Roots. Joseph M. Mahaffy,
Outline Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
Analysis II - few selective results
Analysis II - few selective results Michael Ruzhansky December 15, 2008 1 Analysis on the real line 1.1 Chapter: Functions continuous on a closed interval 1.1.1 Intermediate Value Theorem (IVT) Theorem
The First Derivative and Second Derivative Test
The First Derivative and Second Derivative Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University April 9, 2018 Outline 1 Extremal Values 2
Math Numerical Analysis
Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
Iterative solvers for linear equations
Spectral Graph Theory Lecture 17 Iterative solvers for linear equations Daniel A. Spielman October 31, 2012 17.1 About these notes These notes are not necessarily an accurate representation of what happened
Families of Functions, Taylor Polynomials, l Hopital s
Unit #6 : Rule Families of Functions, Taylor Polynomials, l Hopital s Goals: To use first and second derivative information to describe functions. To be able to find general properties of families of functions.
In general, if we start with a function f and want to reverse the differentiation process, then we are finding an antiderivative of f.
Math 1410 Worksheet #27: Section 4.9 Name: Our final application of derivatives is a prelude to what will come in later chapters. In many situations, it will be necessary to find a way to reverse the differentiation
Chapter 11: Sequences; Indeterminate Forms; Improper Integrals
Chapter 11: Sequences; Indeterminate Forms; Improper Integrals Section 11.1 The Least Upper Bound Axiom a. Least Upper Bound Axiom b. Examples c. Theorem 11.1.2 d. Example e. Greatest Lower Bound f. Theorem
The First Derivative and Second Derivative Test
The First Derivative and Second Derivative Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 8, 2017 Outline Extremal Values The
1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
Lecture 7. Root finding I. 1 Introduction. 2 Graphical solution
1 Introduction Lecture 7 Root finding I For our present purposes, root finding is the process of finding a real value of x which solves the equation f (x)=0. Since the equation g x =h x can be rewritten
Numerical Analysis Exam with Solutions
Numerical Analysis Exam with Solutions Richard T. Bumby Fall 000 June 13, 001 You are expected to have books, notes and calculators available, but computers of telephones are not to be used during the
Math 230 Mock Final Exam Detailed Solution
Name: Math 30 Mock Final Exam Detailed Solution Disclaimer: This mock exam is for practice purposes only. No graphing calulators TI-89 is allowed on this test. Be sure that all of your work is shown and
Figure 1: Graph of y = x cos(x)
Chapter The Solution of Nonlinear Equations f(x) = 0 In this chapter we will study methods for find the solutions of functions of single variables, ie values of x such that f(x) = 0 For example, f(x) =
Announcements. Topics: Homework:
Topics: Announcements - section 2.6 (limits at infinity [skip Precise Definitions (middle of pg. 134 end of section)]) - sections 2.1 and 2.7 (rates of change, the derivative) - section 2.8 (the derivative
Math Review for Exam Answer each of the following questions as either True or False. Circle the correct answer.
Math 22 - Review for Exam 3. Answer each of the following questions as either True or False. Circle the correct answer. (a) True/False: If a n > 0 and a n 0, the series a n converges. Soln: False: Let
Lecture 10: Finite Differences for ODEs & Nonlinear Equations
Lecture 10: Finite Differences for ODEs & Nonlinear Equations J.K. Ryan@tudelft.nl WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 21 November 2012 () Finite Differences
Calculus. Central role in much of modern science Physics, especially kinematics and electrodynamics Economics, engineering, medicine, chemistry, etc.
Calculus Calculus - the study of change, as related to functions Formally co-developed around the 1660 s by Newton and Leibniz Two main branches - differential and integral Central role in much of modern
Consequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline 1 Domains of Continuous Functions 2 The
MATH141: Calculus II Exam #4 review solutions 7/20/2017 Page 1
MATH4: Calculus II Exam #4 review solutions 7/0/07 Page. The limaçon r = + sin θ came up on Quiz. Find the area inside the loop of it. Solution. The loop is the section of the graph in between its two
AN ITERATION. In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b
AN ITERATION In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b In this, A is an n n matrix and b R n.systemsof this form arise
G12MAN Mathematical Analysis Fully-justified answers to Revision Quiz questions
G12MAN Mathematical Analysis Fully-justified answers to Revision Quiz questions Remember that, unless otherwise specified or not applicable for some reason), you MUST justify your answers to questions
Unit 2, Section 3: Linear Combinations, Spanning, and Linear Independence Linear Combinations, Spanning, and Linear Independence
Linear Combinations Spanning and Linear Independence We have seen that there are two operations defined on a given vector space V :. vector addition of two vectors and. scalar multiplication of a vector
Optimization Tutorial 1. Basic Gradient Descent
E0 270 Machine Learning Jan 16, 2015 Optimization Tutorial 1 Basic Gradient Descent Lecture by Harikrishna Narasimhan Note: This tutorial shall assume background in elementary calculus and linear algebra.
Polynomial Approximations and Power Series
Polynomial Approximations and Power Series June 24, 206 Tangent Lines One of the first uses of the derivatives is the determination of the tangent as a linear approximation of a differentiable function
Solutions 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,
Math 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
Distance from a Point to an Ellipse, an Ellipsoid, or a Hyperellipsoid
Distance from a Point to an Ellipse, an Ellipsoid, or a Hyperellipsoid David Eberly, Geometric Tools, Redmond WA 9805 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution
Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.
s of the Fourier Theorem (Sect. 1.3. The Fourier Theorem: Continuous case. : Using the Fourier Theorem. The Fourier Theorem: Piecewise continuous case. : Using the Fourier Theorem. The Fourier Theorem:
Variable. 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
AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period:
WORKSHEET: Series, Taylor Series AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period: 1 Part I. Multiple-Choice Questions (5 points each; please circle the correct answer.) 1. The
4.4 Uniform Convergence of Sequences of Functions and the Derivative
4.4 Uniform Convergence of Sequences of Functions and the Derivative Say we have a sequence f n (x) of functions defined on some interval, [a, b]. Let s say they converge in some sense to a function f
THE EIGENVALUE PROBLEM
THE EIGENVALUE PROBLEM Let A be an n n square matrix. If there is a number λ and a column vector v 0 for which Av = λv then we say λ is an eigenvalue of A and v is an associated eigenvector. Note that
Appendix 8 Numerical Methods for Solving Nonlinear Equations 1
Appendix 8 Numerical Methods for Solving Nonlinear Equations 1 An equation is said to be nonlinear when it involves terms of degree higher than 1 in the unknown quantity. These terms may be polynomial
MATH 1902: Mathematics for the Physical Sciences I
MATH 1902: Mathematics for the Physical Sciences I Dr Dana Mackey School of Mathematical Sciences Room A305 A Email: Dana.Mackey@dit.ie Dana Mackey (DIT) MATH 1902 1 / 46 Module content/assessment Functions