Lecture 10: Finite Differences for ODEs & Nonlinear Equations
|
|
- Sydney Burns
- 5 years ago
- Views:
Transcription
1 Lecture 10: Finite Differences for ODEs & Nonlinear Equations J.K. WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 21 November 2012 () Finite Differences & Nonlinear Equations 21 November / 44
2 Outline 1 Review Neumann BC Convection-diffusion equation Stability of Finite Differences 2 Consistency, Stability, Convergence 3 Nonlinear equations Bisection method Fixed Point Iteration () Finite Differences & Nonlinear Equations 21 November / 44
3 Neumann BC y + q(x)y = f (x), x L = 0 < x < x R = 1, y(0) = 0, dy dx (x=1) = 0, (Dirichlet) (Neumann) Similar to the previous case, we have Step 1: Subdivide the domain, h = x R x L N+1 = 1 N+1 Step 2: Define the nodal points, x j = x L + jh = jh, j = 0,..., N + 1. Step 3: Discretize the equation y j w j+1 2w j + w j 1 h 2. () Finite Differences & Nonlinear Equations 21 November / 44
4 Neumann BC Changing the left boundary condition from Dirichlet (y(x R ) = 0) to Neumann ( dy dx (x R ) = 0), changes our approximation through Adding a "ghost" point Approximating the right boundary condition using central differences Vectors increase in length to (N + 1) and matrices increase in size to (N + 1) (N + 1). () Finite Differences & Nonlinear Equations 21 November / 44
5 Convection-diffusion equation y + νy = 0, y(x L ) = 0, y(x R ) = α x L x x R Need to approximate both first and second derivatives. () Finite Differences & Nonlinear Equations 21 November / 44
6 Convection-diffusion equation Define a 1 = ( ) ( ) 1 ν h 2 and b 1 = 1 + ν h 2. Then A = 1 h 2 2 b a 1 2 b a 1 2 b a 1 2 A is no longer symmetric. () Finite Differences & Nonlinear Equations 21 November / 44
7 Condition number Definition (Condition number) The condition number of a matrix A is given by κ(a) = A A 1. This is useful in determining the stability of our system of equations. () Finite Differences & Nonlinear Equations 21 November / 44
8 Condition number For symmetric matrices, the condition number is given by κ(a) = A A 1 = λ max λ min For stability, w w κ(a) f f Small κ(a) affect of perturbations is small. () Finite Differences & Nonlinear Equations 21 November / 44
9 Gerschgorin s Theorem Theorem (Gerschgorin) The eigenvalues of the matrix A lie in the union of circles z a ii where z is a complex number. n j =1 j i a ij = R i, a ii are the diagonal entries a ij are the non-diagonal entries z a ii is a closed disc centered at a ii with radius R. () Finite Differences & Nonlinear Equations 21 November / 44
10 Consistency Recall, for consistency, the local truncation error should go to zero as the step size gets smaller: lim τ = 0 h 0 But, now τ is a vector so we need to look at the individual entries: τ j+1 = Exact ODE Approximating ODE () Finite Differences & Nonlinear Equations 21 November / 44
11 Consistency Consider the equation y + qy = f. At the grid points, this is d 2 y dx 2 x=x j + q j y j = f j. The discretization of this equation is 1 h 2 (y j+1 2y j + y j 1 ) + q j y j = f j. () Finite Differences & Nonlinear Equations 21 November / 44
12 Consistency The componentwise truncation error is then τ j =( d 2 y dx 2 x=x j + q j y j ) ( 1 h 2 (y j+1 2y j + y j 1 ) + q j y j ) =( y j ) ( 1 h 2 (y j+1 2y j + y j 1 )) }{{} Approximation to 2nd derivative Recall that So that d 2 y dx 2 1 h 2 (y j+1 2y j + y j 1 ) = O(h 2 ). τ O(h 2 ) () Finite Differences & Nonlinear Equations 21 November / 44
13 Consistency The local truncation error is second order. This is because of how we chose to approximation y. So, we have consistency lim τ = h 0 O(h2 ) 0 as h 0. () Finite Differences & Nonlinear Equations 21 November / 44
14 Stability Definition (Stability for finite differences) A finite difference scheme is stable if there exists a constant M independent of h such that A 1 M, as h 0. This is equivalent to the system having a unique solution. () Finite Differences & Nonlinear Equations 21 November / 44
15 Stability For the equation y j + q j y j = f j, The approximating system is given by Aw = f, A = 1 h 2 K + M. where w = w 1 w 2 w N 1 w N, f = f 1 f 2 f N 1 f N () Finite Differences & Nonlinear Equations 21 November / 44
16 Stability where A = 1 h 2 K + M M = diag(q 1, q 2,..., q N ) and K is a tri-banded symmetric diagonal matrix K = which means that A is symmetric. () Finite Differences & Nonlinear Equations 21 November / 44
17 Stability Since A is symmetric A has real eigenvalues It also means that we have an exact definition for the matrix norms: A = λ max, A 1 = 1 λ min But, what are the eigenvalues? () Finite Differences & Nonlinear Equations 21 November / 44
18 Stability Case 1: q = 0 for all x. Then A = 1 h 2 K. K = () Finite Differences & Nonlinear Equations 21 November / 44
19 Stability A is a symmetric matrix with eigenvalues λ j = 1 (2 2 cos((n j)hπ)) h2 This means that ) λ min = 1 h 2 (2 2 cos(hπ)) = 4 h 2 sin2 ( hπ 2 = π 2 sin2 (hπ/2) (hπ/2) 2 }{{} 1 λ min π 2 () Finite Differences & Nonlinear Equations 21 November / 44
20 Stability For the maximum eigenvalue of A, we need to look at this in another way: λ max = 1 h 2 (2 2 cos(hπ)) = 4 ( hπ h 2 sin2 2 }{{} 1 ) λ max 4 h 2 () Finite Differences & Nonlinear Equations 21 November / 44
21 Stability Thus, the scheme is stable for q = 0 and the condition number is ( ) ( ) 4 1 κ(a) = A A 1 = h 2 π 2 = Notice, the scheme is stable because A 1 1 π 2, even though the condition number depends on h. ( ) 2 2 hπ () Finite Differences & Nonlinear Equations 21 November / 44
22 aij 4 h 2 Stability Case 2: q(x) 0. We can estimate the eigenvalues using Gerschgorin s theorem. Assume 0 < q min q(x) q max. q min < q min + 4 h 2 λ j q max < q max + 4 h 2, j = 1,..., n because A is symmetric and A 1 1 q min stable scheme () Finite Differences & Nonlinear Equations 21 November / 44
23 Stability What happens with small perturbations? which gives A(w + w) = f + f w = A 1 f 1 λ min f. () Finite Differences & Nonlinear Equations 21 November / 44
24 Stability The relative error is w w 1 f λ min f Using w w 1 f f λ min w f }{{} Effective condition number where λ min π 2 and f w is usually bounded. () Finite Differences & Nonlinear Equations 21 November / 44
25 Convergence For convergence lim y w = 0. h 0 Is this the case? Ay Aw = f + τ f y w A 1 τ 1 π 2 τ But τ O(h 2 ). Therefore y w O(h 2 ) () Finite Differences & Nonlinear Equations 21 November / 44
26 Consistency + Stability = Convergence Consistency τ j+1 = Exact ODE Approximating ODE Stability We also need A 1 M, as h 0. κ(a) = A A 1 to not be too large. Convergence y w τ () Finite Differences & Nonlinear Equations 21 November / 44
27 Nonlinear Equations Given a nonlinear equation, f (x) = 0, we want to determine for what x this equation is satisfied. Methods Bisection method Fixed point iteration Newton-Raphson method () Finite Differences & Nonlinear Equations 21 November / 44
28 Bisection method This idea is based upon the intermediate value theorem. Theorem (Intermediate value theorem) Assume f C[a, b]. Let f (a) f (b) and let F be a number between f (a) and f (b). Then there exists a number c (a, b) such that f (c) = F. () Finite Differences & Nonlinear Equations 21 November / 44
29 Bisection method Given f (x) C[a, b] such that f (a)f (b) < 0, then we know that f (x) changes sign on [a, b]. f (x) = 0 in the inteval [a, b]. () Finite Differences & Nonlinear Equations 21 November / 44
30 Bisection method Idea: Repeatedly half the interval, keeping the half where the change of sign occurs. () Finite Differences & Nonlinear Equations 21 November / 44
31 Bisection method Algorithm Let x = α be the root of f (x) = 0 and ɛ > 0 is the error tolerance. Algorithm 1 Let a 0 = a and b 0 = b 2 Define c j = 1 2 (a j + b j ) 3 If b j c j < ɛ STOP! α = c j. 4 Else if f (b j )f (c j ) 0 then a j+1 = c j, b j+1 = b j. Otherwise a j+1 = a j, b j+1 = c j. 5 j = j Return to step 2. Notice: for each loop, the interval is halved. () Finite Differences & Nonlinear Equations 21 November / 44
32 Bisection method Properties Easy implementation Always converges to a solution. Convergence is slow. Often used to generate a good starting point for other methods. () Finite Differences & Nonlinear Equations 21 November / 44
33 Bisection method Error bounds Let a n, b n, c n be the n th computed values. Then b n+1 a n+1 = 1 2 (b n a n ) = 1 4 (b n 1 a n 1 ) =... = 1 (b a), n 1. 2n 1 () Finite Differences & Nonlinear Equations 21 November / 44
34 Bisection method Error bounds What is the error? The root α is either in [a n, c n ] or [c n, b n ]. α c n c n a n = b n c n = 1 2 (b n a n ) 1 (b a) 2n α c n 1 (b a) 2n () Finite Differences & Nonlinear Equations 21 November / 44
35 Bisection method Error bounds Suppose we want α c n < ɛ. Then what are the number of iterations that we need? α c n 1 (b a) < ɛ 2n 1 2 n < ɛ b a 2 n (b a) > ɛ () Finite Differences & Nonlinear Equations 21 November / 44
36 Bisection method Error bounds ( ) (b a) ln(2 n ) = n ln(2) > ln = ln(b a) ln(ɛ) ɛ n > ln(b a) ln(ɛ) ln(2) # iterations needed to converge to error ɛ. Note: we need to make sure ɛ is larger than the rounding error. () Finite Differences & Nonlinear Equations 21 November / 44
37 Fixed Point Iteration Definition A fixed point of a given function g(x) is a number α such that g(α) = α. Goal: Find the solution, α. Lemma Let g(x) C[a, b] such that a x b. Then a g(x) b and x = g(x) has at least one solution, α [a, b]. () Finite Differences & Nonlinear Equations 21 November / 44
38 Fixed Point Iteration Theorem (Contraction mapping theorem) Assume g(x) C 1 [a, b] such that a x b (which means a g(x) b). Further assume that Then λ max g (x) 1. x [a,b] 1 There exists a unique solution α of x = g(x) in [a, b]. 2 For any initial estimate α 0 [a, b], x n α. 3 α x n λn 1 λ x 0 x 1, n 0. 4 lim n α x n+1 α x n = g (α). () Finite Differences & Nonlinear Equations 21 November / 44
39 Fixed Point Iteration g (α) determines the convergence rate. If g (α) << 1, then we have fast convergence. If g (α) 1 ɛ then we have slow convergence. If g (α) > 1, then we do not have convergence. () Finite Differences & Nonlinear Equations 21 November / 44
40 Fixed Point Iteration Algorithm 1 α 0 = starting value. 2 α n = g(α n 1 ) 3 If lim n α n = α and g(α) C then STOP! α = g(α n ). 4 Else go to Step 2. () Finite Differences & Nonlinear Equations 21 November / 44
41 Fixed Point Iteration Example Let f (x) = x 3 + 3x 4. Find g(x). Root finding says that f (x) = 0. To use fixed point iteration, we must find g(x) = x. () Finite Differences & Nonlinear Equations 21 November / 44
42 Fixed Point Iteration Therefore f (x) = 0 x 3 + 3x 4= 0 x(x 2 + 3) = 4 g(x) = 4 x x = 4 x () Finite Differences & Nonlinear Equations 21 November / 44
43 Fixed Point Iteration Theorem The fixed point iteration always converges. Proof. Recall g(x) C 1 [a, b], a g(x) b, and λ max x [a,b] g (x) 1. Then we have α n α = g(α n 1 ) g(α) = g (ξ) α n 1 α λ α n 1 α lim α n α lim n n λn α 0 α () Finite Differences & Nonlinear Equations 21 November / 44
44 Material addressed 1 Review Neumann BC Convection-diffusion equation Stability of Finite Differences 2 Consistency, Stability, Convergence 3 Nonlinear equations Bisection method Fixed Point Iteration Material in book: Chapter 7, 1-6,8; Chapter 4, 1-3 Useful exercises: Ch7: 1-4; Ch4: 1-3 () Finite Differences & Nonlinear Equations 21 November / 44
BEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations
BEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations Ser Lee Loh a, Wei Sen Loi a a Fakulti Kejuruteraan Elektrik Universiti Teknikal Malaysia Melaka Lesson Outcome Upon completion of this lesson,
More informationLecture 5: Single Step Methods
Lecture 5: Single Step Methods J.K. Ryan@tudelft.nl WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 1 October 2012 () Single Step Methods 1 October 2012 1 / 44 Outline 1
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 information2 Two-Point Boundary Value Problems
2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x
More informationFinite Difference Methods for Boundary Value Problems
Finite Difference Methods for Boundary Value Problems October 2, 2013 () Finite Differences October 2, 2013 1 / 52 Goals Learn steps to approximate BVPs using the Finite Difference Method Start with two-point
More informationCHAPTER 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
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 informationFixed-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 informationx n+1 = x n f(x n) f (x n ), n 0.
1. Nonlinear Equations Given scalar equation, f(x) = 0, (a) Describe I) Newtons Method, II) Secant Method for approximating the solution. (b) State sufficient conditions for Newton and Secant to converge.
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
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 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 informationNumerical Methods Lecture 3
Numerical Methods Lecture 3 Nonlinear Equations by Pavel Ludvík Introduction Definition (Root or zero of a function) A root (or a zero) of a function f is a solution of an equation f (x) = 0. We learn
More informationMath 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March 22, 2018
1 Linear Systems Math 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March, 018 Consider the system 4x y + z = 7 4x 8y + z = 1 x + y + 5z = 15. We then obtain x = 1 4 (7 + y z)
More informationZeros 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
More informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationComputation Fluid Dynamics
Computation Fluid Dynamics CFD I Jitesh Gajjar Maths Dept Manchester University Computation Fluid Dynamics p.1/189 Garbage In, Garbage Out We will begin with a discussion of errors. Useful to understand
More informationLecture 12: Numerical Quadrature
Lecture 12: Numericl Qudrture J.K. Ryn@tudelft.nl WI3097TU Delft Institute of Applied Mthemtics Delft University of Technology 5 December 2012 () Numericl Qudrture 5 December 2012 1 / 46 Outline 1 Review
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 informationu xx + u yy = 0. (5.1)
Chapter 5 Laplace Equation The following equation is called Laplace equation in two independent variables x, y: The non-homogeneous problem u xx + u yy =. (5.1) u xx + u yy = F, (5.) where F is a function
More informationIterative solvers for linear equations
Spectral Graph Theory Lecture 23 Iterative solvers for linear equations Daniel A. Spielman November 26, 2018 23.1 Overview In this and the next lecture, I will discuss iterative algorithms for solving
More informationMathematics for Engineers. Numerical mathematics
Mathematics for Engineers Numerical mathematics Integers Determine the largest representable integer with the intmax command. intmax ans = int32 2147483647 2147483647+1 ans = 2.1475e+09 Remark The set
More informationSTOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1
53 17. Lecture 17 Nonlinear Equations Essentially, the only way that one can solve nonlinear equations is by iteration. The quadratic formula enables one to compute the roots of p(x) = 0 when p P. Formulas
More informationFinal Examination. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University
Final Examination CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University The exam runs for 3 hours. The exam contains eight problems. You must complete the first
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationIntroduction to Numerical Analysis
Introduction to Numerical Analysis S. Baskar and S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay Powai, Mumbai 400 076. Introduction to Numerical Analysis Lecture Notes
More informationChapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS
Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS 5.1 Introduction When a physical system depends on more than one variable a general
More informationIterative 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
More informationOn solving linear systems arising from Shishkin mesh discretizations
On solving linear systems arising from Shishkin mesh discretizations Petr Tichý Faculty of Mathematics and Physics, Charles University joint work with Carlos Echeverría, Jörg Liesen, and Daniel Szyld October
More informationLecture 4 Eigenvalue problems
Lecture 4 Eigenvalue problems Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
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 informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
More informationREVIEW OF DIFFERENTIAL CALCULUS
REVIEW OF DIFFERENTIAL CALCULUS DONU ARAPURA 1. Limits and continuity To simplify the statements, we will often stick to two variables, but everything holds with any number of variables. Let f(x, y) be
More informationChapter 2. Solving Systems of Equations. 2.1 Gaussian elimination
Chapter 2 Solving Systems of Equations A large number of real life applications which are resolved through mathematical modeling will end up taking the form of the following very simple looking matrix
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
More informationMB4018 Differential equations
MB4018 Differential equations Part II http://www.staff.ul.ie/natalia/mb4018.html Prof. Natalia Kopteva Spring 2015 MB4018 (Spring 2015) Differential equations Part II 0 / 69 Section 1 Second-Order Linear
More informationPreliminary Examination, Numerical Analysis, August 2016
Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any
More informationNumerical Methods for Ordinary Differential Equations
Numerical Methods for Ordinary Differential Equations Answers of the exercises C Vuik, S van Veldhuizen and S van Loenhout 08 Delft University of Technology Faculty Electrical Engineering, Mathematics
More informationSeries Solution of Linear Ordinary Differential Equations
Series Solution of Linear Ordinary Differential Equations Department of Mathematics IIT Guwahati Aim: To study methods for determining series expansions for solutions to linear ODE with variable coefficients.
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 informationSolution Methods. Richard Lusby. Department of Management Engineering Technical University of Denmark
Solution Methods Richard Lusby Department of Management Engineering Technical University of Denmark Lecture Overview (jg Unconstrained Several Variables Quadratic Programming Separable Programming SUMT
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 informationRoot Finding (and Optimisation)
Root Finding (and Optimisation) M.Sc. in Mathematical Modelling & Scientific Computing, Practical Numerical Analysis Michaelmas Term 2018, Lecture 4 Root Finding The idea of root finding is simple we want
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Discretization of Boundary Conditions Discretization of Boundary Conditions On
More informationNumerical 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
More informationNumerical 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
More informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
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 informationBackground. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58
Background C. T. Kelley NC State University tim kelley@ncsu.edu C. T. Kelley Background NCSU, Spring 2012 1 / 58 Notation vectors, matrices, norms l 1 : max col sum... spectral radius scaled integral norms
More informationOR MSc Maths Revision Course
OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision
More information12 The Heat equation in one spatial dimension: Simple explicit method and Stability analysis
ATH 337, by T. Lakoba, University of Vermont 113 12 The Heat equation in one spatial dimension: Simple explicit method and Stability analysis 12.1 Formulation of the IBVP and the minimax property of its
More informationFigure 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) =
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 informationAn Introduction to Numerical Methods for Differential Equations. Janet Peterson
An Introduction to Numerical Methods for Differential Equations Janet Peterson Fall 2015 2 Chapter 1 Introduction Differential equations arise in many disciplines such as engineering, mathematics, sciences
More informationHence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1.
The Bisection method or BOLZANO s method or Interval halving method: Find the positive root of x 3 x = 1 correct to four decimal places by bisection method Let f x = x 3 x 1 Here f 0 = 1 = ve, f 1 = ve,
More informationAdditional Homework Problems
Additional Homework Problems These problems supplement the ones assigned from the text. Use complete sentences whenever appropriate. Use mathematical terms appropriately. 1. What is the order of a differential
More informationInstructor: Marios M. Fyrillas HOMEWORK ASSIGNMENT ON NUMERICAL SOLUTION OF NONLINEAR EQUATIONS
AMAT 34 Numerical Methods Instructor: Marios M. Fyrillas Email: m.fyrillas@fit.ac.cy Office Tel.: 34559/60 Ext. 3 HOMEWORK ASSIGNMENT ON NUMERICAL SOLUTION OF NONLINEAR EQUATIONS Question You are required
More informationMA 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
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 8, 2009 Today
More informationLecture 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
More information1. 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) =
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
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 informationLecture 19: Heat conduction with distributed sources/sinks
Introductory lecture notes on Partial Differential Equations - c Anthony Peirce. Not to be copied, used, or revised without explicit written permission from the copyright owner. 1 ecture 19: Heat conduction
More informationIterative solvers for linear equations
Spectral Graph Theory Lecture 15 Iterative solvers for linear equations Daniel A. Spielman October 1, 009 15.1 Overview In this and the next lecture, I will discuss iterative algorithms for solving linear
More informationAn Overly Simplified and Brief Review of Differential Equation Solution Methods. 1. Some Common Exact Solution Methods for Differential Equations
An Overly Simplified and Brief Review of Differential Equation Solution Methods We will be dealing with initial or boundary value problems. A typical initial value problem has the form y y 0 y(0) 1 A typical
More informationNumerical Methods for Differential Equations Mathematical and Computational Tools
Numerical Methods for Differential Equations Mathematical and Computational Tools Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 Part 1. Vector norms, matrix norms and logarithmic
More informationSolution of nonlinear equations
Chapter 1 Solution of nonlinear equations This chapter is devoted the problem of locating roots of equations (or zeros functions). The problem occurs frequently in scientific work. In this chapter we are
More informationMATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations.
MATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of f(x) = 0, their advantages and disadvantages. Convergence
More informationHomework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)
CS 106 Spring 2004 Homework 1 Elena Davidson 8 April 2004 Problem 1.1 Let B be a 4 4 matrix to which we apply the following operations: 1. double column 1, 2. halve row 3, 3. add row 3 to row 1, 4. interchange
More informationNumerical 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
More informationMath 7824 Spring 2010 Numerical solution of partial differential equations Classroom notes and homework
Math 7824 Spring 2010 Numerical solution of partial differential equations Classroom notes and homework Jan Mandel University of Colorado Denver May 12, 2010 1/20/09: Sec. 1.1, 1.2. Hw 1 due 1/27: problems
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 informationAIMS Exercise Set # 1
AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest
More informationORIE 6334 Spectral Graph Theory October 13, Lecture 15
ORIE 6334 Spectral Graph heory October 3, 206 Lecture 5 Lecturer: David P. Williamson Scribe: Shijin Rajakrishnan Iterative Methods We have seen in the previous lectures that given an electrical network,
More informationMath 117: Calculus & Functions II
Drexel University Department of Mathematics Jason Aran Math 117: Calculus & Functions II Contents 0 Calculus Review from Math 116 4 0.1 Limits............................................... 4 0.1.1 Defining
More informationTangent Planes, Linear Approximations and Differentiability
Jim Lambers MAT 80 Spring Semester 009-10 Lecture 5 Notes These notes correspond to Section 114 in Stewart and Section 3 in Marsden and Tromba Tangent Planes, Linear Approximations and Differentiability
More informationConsequences of Orthogonality
Consequences of Orthogonality Philippe B. Laval KSU Today Philippe B. Laval (KSU) Consequences of Orthogonality Today 1 / 23 Introduction The three kind of examples we did above involved Dirichlet, Neumann
More informationAccelerating 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
More informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationLecture 19: Solving linear ODEs + separable techniques for nonlinear ODE s
Lecture 19: Solving linear ODEs + separable techniques for nonlinear ODE s Geoffrey Cowles Department of Fisheries Oceanography School for Marine Science and Technology University of Massachusetts-Dartmouth
More informationReview. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn
Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations
More information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationGoal: to construct some general-purpose algorithms for solving systems of linear Equations
Chapter IV Solving Systems of Linear Equations Goal: to construct some general-purpose algorithms for solving systems of linear Equations 4.6 Solution of Equations by Iterative Methods 4.6 Solution of
More informationIterative methods for positive definite linear systems with a complex shift
Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution
More informationOptimization and Calculus
Optimization and Calculus To begin, there is a close relationship between finding the roots to a function and optimizing a function. In the former case, we solve for x. In the latter, we solve: g(x) =
More informationChapter 4. Unconstrained optimization
Chapter 4. Unconstrained optimization Version: 28-10-2012 Material: (for details see) Chapter 11 in [FKS] (pp.251-276) A reference e.g. L.11.2 refers to the corresponding Lemma in the book [FKS] PDF-file
More informationHermite Interpolation
Jim Lambers MAT 77 Fall Semester 010-11 Lecture Notes These notes correspond to Sections 4 and 5 in the text Hermite Interpolation Suppose that the interpolation points are perturbed so that two neighboring
More informationMATH 333: Partial Differential Equations
MATH 333: Partial Differential Equations Problem Set 9, Final version Due Date: Tues., Nov. 29, 2011 Relevant sources: Farlow s book: Lessons 9, 37 39 MacCluer s book: Chapter 3 44 Show that the Poisson
More informationThe Factorization Method for Inverse Scattering Problems Part I
The Factorization Method for Inverse Scattering Problems Part I Andreas Kirsch Madrid 2011 Department of Mathematics KIT University of the State of Baden-Württemberg and National Large-scale Research Center
More informationChapter 11 ORDINARY DIFFERENTIAL EQUATIONS
Chapter 11 ORDINARY DIFFERENTIAL EQUATIONS The general form of a first order differential equations is = f(x, y) with initial condition y(a) = y a We seek the solution y = y(x) for x > a This is shown
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 9, 2008 Today
More informationFinite-Elements Method 2
Finite-Elements Method 2 January 29, 2014 2 From Applied Numerical Analysis Gerald-Wheatley (2004), Chapter 9. Finite-Elements Method 3 Introduction Finite-element methods (FEM) are based on some mathematical
More informationGradient Descent and Implementation Solving the Euler-Lagrange Equations in Practice
1 Lecture Notes, HCI, 4.1.211 Chapter 2 Gradient Descent and Implementation Solving the Euler-Lagrange Equations in Practice Bastian Goldlücke Computer Vision Group Technical University of Munich 2 Bastian
More informationMS 3011 Exercises. December 11, 2013
MS 3011 Exercises December 11, 2013 The exercises are divided into (A) easy (B) medium and (C) hard. If you are particularly interested I also have some projects at the end which will deepen your understanding
More information1. Differential Equations (ODE and PDE)
1. Differential Equations (ODE and PDE) 1.1. Ordinary Differential Equations (ODE) So far we have dealt with Ordinary Differential Equations (ODE): involve derivatives with respect to only one variable
More informationBest approximation in the 2-norm
Best approximation in the 2-norm Department of Mathematical Sciences, NTNU september 26th 2012 Vector space A real vector space V is a set with a 0 element and three operations: Addition: x, y V then x
More informationNumerical Optimization
Unconstrained Optimization (II) Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Unconstrained Optimization Let f : R R Unconstrained problem min x
More information