Math 5334: Homework 3 Solutions
|
|
- Irma Page
- 6 years ago
- Views:
Transcription
1 Math 5334: Homework 3 Solutions Victoria E. Howle March 31, 28 Problem 4.3 a. Since I don t see any easy roots ( or ±1) of p(x) = 816x x 2 + 6x 3125 I will find them with MATLAB: >> format long >> roots([ ]) b. >> p = inline( 816*x.^3-3835*x.^2 + 6*x ) p = Inline function: p(x) = 816*x.^3-3835*x.^2 + 6*x >> x = 1.43:.1:1.71; >> y = p(x); >> plot(x,y) >> hold on >> plot( , p( ), o ) >> plot( , p( ), o ) >> plot( , p( ), o ) Texas Tech University, Department of Mathematics & Statistics 1
2 c. With x = 1.5, Newton s method finds the root in 11 iterations. >> pprime = inline( 3*816*x.^2-2*3835*x + 6 ) >> x = mynewton(p, pprime, 1.5) x = Here is my Newton code, mynewton.m: function x = mynewton(f,fprime,x) % function x = mynewton(f,fprime,x) % % define functions f and fprime as inlines or m-files % e.g., f x^2-2 % % finds a root of f near x 2
3 k = ; xprev = rand(1); x = x; while abs(x - xprev) > eps*abs(x) xprev = x; x = x - f(x)/fprime(x); % with m-file funcs, input func handles disp(sprintf( %5.16g, x)); k = k + 1; end d. With initial points x = 1 and x 1 = 2, the secant method finds the root in 12 iterations. >> x = mysecant(p,1,2) x = Here is my secant method code, mysecant.m: function x = mysecant(f,a,b) %function x = secant(f,a,b) % % define functions as inlines or m-files % e.g., f x^2-2 % % finds a root of f using initial guesses a,b k = ; while abs(b-a) > eps*abs(b) c = a; a = b; b = b + (b-c)/(f(c)/f(b)-1); 3
4 disp(sprintf( %5.16g, b)); k = k + 1; end e. Starting on the interval [1, 2], bisection finds the root after 52 iterations. >> x = mybisection(p,1,2)
5 x = Here is the bisection method, right out of the NCM book: function x = mybisection(f,a,b) % function x = mybisection(f,a,b) % see NCM p. 118 % % Does bisection method to find root of function f. % Bisects interval [a,b], so initial a and b must bracket a root. k = ; while b-a > eps % converge when bracket width is <= eps x = (a+b)/2; % midpt of interval [a,b] if sign(f(x)) == sign(f(b)) b = x; disp(sprintf( %5.16g,b)); else a = x; disp(sprintf( %5.16g,a)); end % now our new bracket is half as big k = k + 1; end e. fzerotx(p, [1,2]) finds the root The fzerotx code uses the secant method to take its first step. One step of secant gives , which is very near The following steps (IQI) zero in on this root. 5
6 Problem 4.8 Unlike Newton s method, which just bounced back and forth without making any progress on this function, the secant method does converge. Since it is only approximating the slope, the secant method doesn t get stuck in this case. Note that the requirements of the convergence theory for the secant method are the same as those for Newton. So like with Newton, they are violated by this function since it s first derivative is unbounded as x goes to a. But in this case we get lucky, and the method converges anyway. Depending on the given interval, the method converges in just a couple of iterations or after many iterations. In this example, I picked a = 3. f = Inline function: f(x) = sign(x - 3)*sqrt(abs(x - 3)) >> x = mysecant(f,2.5,4) x = 3 Problem 4.16 We ll start by rewriting the equation as a function T (x, t): x T (x, t) = erf( 2 αt )(T i T s ) + T s. Next we will write T (x, t) as an inline Matlab function of x only given α =.138e 6, T i = 2, T s = 15, and t = = 5184 seconds. >> T = inline( erf(x/(2*sqrt(.138e-6*5184)))*(2 + 15) - 15 ) T = Inline function: T(x) = erf(x/(2*sqrt(.138e-6*5184)))*(2 + 15) - 15 Finally, we find an interval on which T changes sign and call fzerotx to find a zero. >> T() -15 >> T(1) 2 >> fzerotx(t, [,1]).677 So we need to bury the water main at least.677 meters under ground. 6
7 Problem 5.4 a. We have defined ρ = 1/( σu k ) and want to show that ρ = 2/ u 2. First we will look at u 2 : u 2 = u ū Next we ll look at σu k : = (x + σe k ) ( x + σe k ) = x 1 x (x k + σ)( x k + σ) + + x n x n = x 2 + σ x k + σx k + σ σ = x 2 + x k x k x k x + x kx k x k x + x k x k x k 2 x 2 = 2 x σx k σu k = x k x k x u k = x k x k x (x k + σ) = x k x k x (x k + x k x k x ) = x kx k x k x + x k x k x k 2 x 2 = x 2 + σx k So we can see that u 2 = 2 σu k so that 1 = 2 σu k u 2. b. We ll show that H = H and H H = I with a Matlab example: >> x = rand(4,1) + i*rand(4,1) x = i i i i >> % we will take k = 2 >> sigma = sign(x(2))*norm(x); >> ek = [; 1; ; ] 7
8 ek = 1 >> u = x + sigma*ek u = i i i i >> rho = 2/norm(u)^2 rho =.291 >> H = I - rho*u*u H = i i i i i i i i i i i i.788 >> H i i i i i i i i i i i i.788 >> norm(h - H ) 1.284e-16 >> H *H i -. +.i -. +.i -. -.i i -. +.i -. -.i -. +.i i -. -.i -. -.i -. +.i 1. Note that H H above is equal to the identity up to a little round off error. 8
9 c. We ll use the same Matlab example as in (b). >> H*x. +.i i. +.i. -.i >> -sigma*ek i d. We can show this one directly: where τ = ρu y. Hy = (I ρuu )y = y ρuu y = y ρu(u y) = y u(ρu y) since ρ and u y are scalars = y τu Problem 5.5 a. For this problem, we just follow the steps for building the Householder reflector that zeros out all but the first element (k = 1) of the vector. >> x = [9 2 6] x = >> ek = [1; ; ] ek = 1 >> sigma = sign(x(1))*norm(x) sigma = 11 9
10 >> u = x + sigma*ek u = >> rho = 2/norm(u)^2 rho =.45 >> I = eye(3,3); >> H = I - rho*u*u H = >> H*x b. I am trying u from the construction of H (since the problem helpfully uses that letter...) >> u u = >> H*u That worked! For v, note that σ is defined with a plus or minus on p So we ll try v = x σ e 1. >> v = x - sigma*ek v =
11 >> H*v Problem 5.6 >> X = [1 2 3; 4 5 6; 7 8 9; ; ] X = a. X is rank deficient if its rank is < 3. >> rank(x) 2 b. >> Z = pinv(x) Z = >> B = X\eye(5,5) Warning: Rank deficient, rank = 2, tol = 2.471e-14. B = >> S = eye(3,3)/x Warning: Rank deficient, rank = 2, tol = e-14. S = >> norm(z, fro ).6777 >> norm(b, fro ).6791 >> norm(s, fro )
12 >> norm(x*z - I5, fro ) >> norm(x*b - I5, fro ) >> norm(x*s - I5, fro ) >> norm(z*x - I3, fro ) 1 >> norm(b*x - I3, fro ) >> norm(s*x - I3, fro ) 1 In all cases, the values involving Z are less than or equal to the values with B or S. c. >> norm(x*z - (X*Z) ) 1.942e-15 >> norm(z*x - (Z*X) ) 2.467e-15 >> norm(x*z*x - X) 2.466e-14 >> norm(z*x*z - Z) e-16 All are true for Z. >> norm(x*b - (X*B) ) e-15 >> norm(b*x - (B*X) ).771 >> norm(x*b*x - X) 2.254e-14 >> norm(b*x*b - B) 6.846e-16 Second property fails for B. >> norm(x*s - (X*S) ) >> norm(s*x - (S*X) ) e-16 >> norm(x*s*x - X) e-14 >> norm(s*x*s - S) 4.835e-16 First property fails for S. 12
13 Problem 5.12 a. >> x = [ ] ; >> y = [ ] ; >> M = [x.*x x.*y y.*y x y]; >> b = -1*ones(1,1); >> c = M\b; >> z = c(1)*x.^2 + c(2)*x.*y + c(3)*y.^2 + c(4)*x + c(5)*y + ones(1,1); >> [X,Y] = meshgrid(-.75:.5:1.25, :.5:1.25); >> Z = c(1)*x.^2 + c(2)*x.*y + c(3)*y.^2 + c(4)*x + c(5)*y + 1; >> contour(x,y,z,[ ]) >> hold on >> plot(x,y, bo ) >> title( orbit ) I made the meshgrid over a larger x and y range so we can see the full orbit. b. Perturbed system: >> rx = (.1)*rand(1,1); >> ry = (.1)*rand(1,1); >> x2 = x + rx; >> y2 = y + ry; >> M2 = [x2.*x2 x2.*y2 y2.*y2 x2 y2]; >> c2 = M2\b; >> % plot both orbits on same figure >> contour(x,y,z,[ ]) % from part a >> hold on 13
14 >> plot(x,y, bo ) >> plot(x2,y2, rx ) >> Z2 = c2(1)*x.^2 + c2(2)*x.*y + c2(3)*y.^2 + c2(4)*x + c2(5)*y + 1; >> contour(x,y,z2,[ ]) >> title( orbit and perturbed orbit ) 14
MATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter IV: Locating Roots of Equations Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu
More informationMATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter IV: Locating Roots of Equations Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu
More informationIf you need the source code from the sample solutions, copy and paste from the PDF should work. If you re having trouble, send me an .
AM117 Sample Solutions, HW#1 Hi, I m Andreas Kloeckner, your grader for this course. Feel free to email me at kloeckner@dam.brown.edu. The code for the sample solutions is written so that it will run in
More informationOutline. Additional Nonlinear Systems. Abstract. Finding Equilibrium Points Numerically. Newton s Method
Outline Finding Equilibrium Points Numerically Additional Nonlinear Systems James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University June 13, 2017
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 informationMath Numerical Analysis Mid-Term Test Solutions
Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationChapter 5: Quadratic Functions
Section 5.1: Square Root Property #1-20: Solve the equations using the square root property. 1) x 2 = 16 2) y 2 = 25 3) b 2 = 49 4) a 2 = 16 5) m 2 = 98 6) d 2 = 24 7) x 2 = 75 8) x 2 = 54 9) (x 3) 2 =
More informationCaculus 221. Possible questions for Exam II. March 19, 2002
Caculus 221 Possible questions for Exam II March 19, 2002 These notes cover the recent material in a style more like the lecture than the book. The proofs in the book are in section 1-11. At the end there
More informationINTRODUCTION TO NUMERICAL ANALYSIS
INTRODUCTION TO NUMERICAL ANALYSIS Cho, Hyoung Kyu Department of Nuclear Engineering Seoul National University 3. SOLVING NONLINEAR EQUATIONS 3.1 Background 3.2 Estimation of errors in numerical solutions
More informationNonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems
Nonlinear Systems CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Nonlinear Systems 1 / 24 Part III: Nonlinear Problems Not all numerical problems
More informationOutline. 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
More informationMath 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
More informationR x n. 2 R We simplify this algebraically, obtaining 2x n x n 1 x n x n
Math 42 Homework 4. page 3, #9 This is a modification of the bisection method. Write a MATLAB function similar to bisect.m. Here, given the points P a a,f a and P b b,f b with f a f b,we compute the point
More informationNumerical Solution of f(x) = 0
Numerical Solution of f(x) = 0 Gerald W. Recktenwald Department of Mechanical Engineering Portland State University gerry@pdx.edu ME 350: Finding roots of f(x) = 0 Overview Topics covered in these slides
More informationFinding the Roots of f(x) = 0. Gerald W. Recktenwald Department of Mechanical Engineering Portland State University
Finding the Roots of f(x) = 0 Gerald W. Recktenwald Department of Mechanical Engineering Portland State University gerry@me.pdx.edu These slides are a supplement to the book Numerical Methods with Matlab:
More informationFinding the Roots of f(x) = 0
Finding the Roots of f(x) = 0 Gerald W. Recktenwald Department of Mechanical Engineering Portland State University gerry@me.pdx.edu These slides are a supplement to the book Numerical Methods with Matlab:
More informationProb 1 Solution and Matlab example #1 (prepared by HPH)
Prob 1 Solution and Matlab example #1 (prepared by HPH) Many have obtained the solution for this problem by hand, which is perfectly fine. With the toy calculator, one can "keep 3 digits" by chopping or
More informationBasic Linear Algebra in MATLAB
Basic Linear Algebra in MATLAB 9.29 Optional Lecture 2 In the last optional lecture we learned the the basic type in MATLAB is a matrix of double precision floating point numbers. You learned a number
More information1.1: The bisection method. September 2017
(1/11) 1.1: The bisection method Solving nonlinear equations MA385/530 Numerical Analysis September 2017 3 2 f(x)= x 2 2 x axis 1 0 1 x [0] =a x [2] =1 x [3] =1.5 x [1] =b 2 0.5 0 0.5 1 1.5 2 2.5 1 Solving
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 informationSection 3.4. Second Order Nonhomogeneous. The corresponding homogeneous equation. is called the reduced equation of (N).
Section 3.4. Second Order Nonhomogeneous Equations y + p(x)y + q(x)y = f(x) (N) The corresponding homogeneous equation y + p(x)y + q(x)y = 0 (H) is called the reduced equation of (N). 1 General Results
More informationLecture 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
More informationTWO METHODS FOR OF EQUATIONS
TWO METHODS FOR FINDING ROOTS OF EQUATIONS Closed (Bracketing) Methods Open Methods Motivation: i In engineering applications, it is often necessary to determine the rootofan of equation when a formula
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 informationQuarter 2 400, , , , , , ,000 50,000
Algebra 2 Quarter 2 Quadratic Functions Introduction to Polynomial Functions Hybrid Electric Vehicles Since 1999, there has been a growing trend in the sales of hybrid electric vehicles. These data show
More informationMarch Algebra 2 Question 1. March Algebra 2 Question 1
March Algebra 2 Question 1 If the statement is always true for the domain, assign that part a 3. If it is sometimes true, assign it a 2. If it is never true, assign it a 1. Your answer for this question
More informationMath 551 Homework Assignment 3 Page 1 of 6
Math 551 Homework Assignment 3 Page 1 of 6 Name and section: ID number: E-mail: 1. Consider Newton s method for finding + α with α > 0 by finding the positive root of f(x) = x 2 α = 0. Assuming that x
More informationApplied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit II: Numerical Linear Algebra Lecturer: Dr. David Knezevic Unit II: Numerical Linear Algebra Chapter II.3: QR Factorization, SVD 2 / 66 QR Factorization 3 / 66 QR Factorization
More informationSOLUTIONS to Exercises from Optimization
SOLUTIONS to Exercises from Optimization. Use the bisection method to find the root correct to 6 decimal places: 3x 3 + x 2 = x + 5 SOLUTION: For the root finding algorithm, we need to rewrite the equation
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 informationNumerical Methods 5633
Numerical Methods 5633 Lecture 4 Michaelmas Term 2017 Marina Krstic Marinkovic mmarina@maths.tcd.ie School of Mathematics Trinity College Dublin Marina Krstic Marinkovic 1 / 17 5633-Numerical Methods Root
More information(6.2) -The Shooting Method for Nonlinear Problems
(6.2) -The Shooting Method for Nonlinear Problems Consider the boundary value problems (BVPs) for the second order differential equation of the form (*) y f x,y,y, a x b, y a and y b. When f x,y,y is linear
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 informationSequences and infinite series
Sequences and infinite series D. DeTurck University of Pennsylvania March 29, 208 D. DeTurck Math 04 002 208A: Sequence and series / 54 Sequences The lists of numbers you generate using a numerical method
More informationMath 471. Numerical methods Root-finding algorithms for nonlinear equations
Math 471. Numerical methods Root-finding algorithms for nonlinear equations overlap Section.1.5 of Bradie Our goal in this chapter is to find the root(s) for f(x) = 0..1 Bisection Method Intermediate value
More informationMath 409/509 (Spring 2011)
Math 409/509 (Spring 2011) Instructor: Emre Mengi Study Guide for Homework 2 This homework concerns the root-finding problem and line-search algorithms for unconstrained optimization. Please don t hesitate
More informationSection 3.4. Second Order Nonhomogeneous. The corresponding homogeneous equation
Section 3.4. Second Order Nonhomogeneous Equations y + p(x)y + q(x)y = f(x) (N) The corresponding homogeneous equation y + p(x)y + q(x)y = 0 (H) is called the reduced equation of (N). 1 General Results
More informationUniversity of Delaware Department of Mathematical Sciences Math 353 Engineering Mathematics III 06S C. Bacuta
University of Delaware Department of Mathematical Sciences Math 353 Engineering Mathematics III 06S C. Bacuta Homework 4: Due Friday, 0/4/06, 10:00am Part I) (1) Section., Problems #3(a,d), 9, 11. () Apply
More information5 Finding roots of equations
Lecture notes for Numerical Analysis 5 Finding roots of equations Topics:. Problem statement. Bisection Method 3. Newton s Method 4. Fixed Point Iterations 5. Systems of equations 6. Notes and further
More information1 Getting started Math4414 Matlab Tutorial We start by defining the arithmetic operations in matlab in the following tables Arithmetic Operations * mu
1 Getting started Math4414 Matlab Tutorial We start by defining the arithmetic operations in matlab in the following tables Arithmetic Operations * multiplication + addition - subtraction n left division
More informationSolving Nonlinear Equations
Solving Nonlinear Equations Jijian Fan Department of Economics University of California, Santa Cruz Oct 13 2014 Overview NUMERICALLY solving nonlinear equation Four methods Bisection Function iteration
More informationProf. Krstic Nonlinear Systems MAE281A Homework set 1 Linearization & phase portrait
Prof. Krstic Nonlinear Systems MAE28A Homework set Linearization & phase portrait. For each of the following systems, find all equilibrium points and determine the type of each isolated equilibrium. Use
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationIntegration of Rational Functions by Partial Fractions
Title Integration of Rational Functions by MATH 1700 MATH 1700 1 / 11 Readings Readings Readings: Section 7.4 MATH 1700 2 / 11 Rational functions A rational function is one of the form where P and Q are
More informationHomework No. 2 Solutions TA: Theo Drivas
550.386 Homework No. Solutions TA: Theo Drivas Problem 1. (a) Consider the initial-value problems for the following two differential equations: (i) dy/dt = y, y(0) = y 0, (ii) dy/dt = y, y(0) = y 0. Use
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
More information3.2 Iterative Solution Methods for Solving Linear
22 CHAPTER 3. NUMERICAL LINEAR ALGEBRA 3.2 Iterative Solution Methods for Solving Linear Systems 3.2.1 Introduction We continue looking how to solve linear systems of the form Ax = b where A = (a ij is
More informationIntegration of Rational Functions by Partial Fractions
Title Integration of Rational Functions by Partial Fractions MATH 1700 December 6, 2016 MATH 1700 Partial Fractions December 6, 2016 1 / 11 Readings Readings Readings: Section 7.4 MATH 1700 Partial Fractions
More informationSolving nonlinear equations (See online notes and lecture notes for full details) 1.3: Newton s Method
Solving nonlinear equations (See online notes and lecture notes for full details) 1.3: Newton s Method MA385 Numerical Analysis September 2018 (1/16) Sir Isaac Newton, 1643-1727, England. Easily one of
More informationMidterm 1 Solutions Thursday, February 26
Math 59 Dr. DeTurck Midterm 1 Solutions Thursday, February 26 1. First note that since f() = f( + ) = f()f(), we have either f() = (in which case f(x) = f(x + ) = f(x)f() = for all x, so c = ) or else
More informationLB 220 Homework 4 Solutions
LB 220 Homework 4 Solutions Section 11.4, # 40: This problem was solved in class on Feb. 03. Section 11.4, # 42: This problem was also solved in class on Feb. 03. Section 11.4, # 43: Also solved in class
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
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 informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationMath 2E Selected Problems for the Final Aaron Chen Spring 2016
Math 2E elected Problems for the Final Aaron Chen pring 216 These are the problems out of the textbook that I listed as more theoretical. Here s also some study tips: 1) Make sure you know the definitions
More informationz 2 = 1 4 (x 2) + 1 (y 6)
MA 5 Fall 007 Exam # Review Solutions. Consider the function fx, y y x. a Sketch the domain of f. For the domain, need y x 0, i.e., y x. - - - 0 0 - - - b Sketch the level curves fx, y k for k 0,,,. The
More informationMath 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
More informationNonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems
Nonlinear Systems CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Nonlinear Systems 1 / 27 Part III: Nonlinear Problems Not
More informationProject One: C Bump functions
Project One: C Bump functions James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 2, 2018 Outline 1 2 The Project Let s recall what the
More informationCHAPTER 1. Review of Algebra
CHAPTER 1 Review of Algebra Much of the material in this chapter is revision from GCSE maths (although some of the exercises are harder). Some of it particularly the work on logarithms may be new if you
More informationALGEBRAIC GEOMETRY HOMEWORK 3
ALGEBRAIC GEOMETRY HOMEWORK 3 (1) Consider the curve Y 2 = X 2 (X + 1). (a) Sketch the curve. (b) Determine the singular point P on C. (c) For all lines through P, determine the intersection multiplicity
More informationMath 5334: Homework 2 Solutions
Math 5334: Homework 2 Solutions Victoria E. Howle February 20, 2008 Problem 2.15 a. The condition number of golub(n) grows exponentially. x = []; y = []; % For golub matrices size n = 1 to 10, we will
More informationFirst-Order Differential Equations
CHAPTER 1 First-Order Differential Equations 1. Diff Eqns and Math Models Know what it means for a function to be a solution to a differential equation. In order to figure out if y = y(x) is a solution
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationLESSON 7.2 FACTORING POLYNOMIALS II
LESSON 7.2 FACTORING POLYNOMIALS II LESSON 7.2 FACTORING POLYNOMIALS II 305 OVERVIEW Here s what you ll learn in this lesson: Trinomials I a. Factoring trinomials of the form x 2 + bx + c; x 2 + bxy +
More informationOrder of convergence. MA3232 Numerical Analysis Week 3 Jack Carl Kiefer ( ) Question: How fast does x n
Week 3 Jack Carl Kiefer (94-98) Jack Kiefer was an American statistician. Much of his research was on the optimal design of eperiments. However, he also made significant contributions to other areas of
More informationChapter 3 Numerical Methods
Chapter 3 Numerical Methods Part 2 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization 1 Outline 3.2 Systems of Equations 3.3 Nonlinear and Constrained Optimization Summary 2 Outline 3.2
More informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
More informationInvestigating Limits in MATLAB
MTH229 Investigating Limits in MATLAB Project 5 Exercises NAME: SECTION: INSTRUCTOR: Exercise 1: Use the graphical approach to find the following right limit of f(x) = x x, x > 0 lim x 0 + xx What is the
More informationMathematics (MEI) Advanced Subsidiary GCE Core 1 (4751) June 2010
Link to past paper on OCR website: www.ocr.org.uk The above link takes you to OCR s website. From there you click QUALIFICATIONS, QUALIFICATIONS BY TYPE, AS/A LEVEL GCE, MATHEMATICS (MEI), VIEW ALL DOCUMENTS,
More informationLecture 7 Symbolic Computations
Lecture 7 Symbolic Computations The focus of this course is on numerical computations, i.e. calculations, usually approximations, with floating point numbers. However, Matlab can also do symbolic computations,
More informationMATLAB Examples 2 (covering Statistics Lectures 3 and 4)
MATLAB Examples 2 (covering Statistics Lectures 3 and 4) Contents Example 1: Fit a linearized regression model Example 2: Fit a parametric nonlinear model Example 3: Another optimization example Example
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 informationIntro to Scientific Computing: How long does it take to find a needle in a haystack?
Intro to Scientific Computing: How long does it take to find a needle in a haystack? Dr. David M. Goulet Intro Binary Sorting Suppose that you have a detector that can tell you if a needle is in a haystack,
More informationProblems in Algebra. 2 4ac. 2a
Problems in Algebra Section Polynomial Equations For a polynomial equation P (x) = c 0 x n + c 1 x n 1 + + c n = 0, where c 0, c 1,, c n are complex numbers, we know from the Fundamental Theorem of Algebra
More informationSolving Non-Linear Equations (Root Finding)
Solving Non-Linear Equations (Root Finding) Root finding Methods What are root finding methods? Methods for determining a solution of an equation. Essentially finding a root of a function, that is, a zero
More informationJoint Distributions. (a) Scalar multiplication: k = c d. (b) Product of two matrices: c d. (c) The transpose of a matrix:
Joint Distributions Joint Distributions A bivariate normal distribution generalizes the concept of normal distribution to bivariate random variables It requires a matrix formulation of quadratic forms,
More informationDistribution-Free Procedures (Devore Chapter Fifteen)
Distribution-Free Procedures (Devore Chapter Fifteen) MATH-5-01: Probability and Statistics II Spring 018 Contents 1 Nonparametric Hypothesis Tests 1 1.1 The Wilcoxon Rank Sum Test........... 1 1. Normal
More informationLecture V. Numerical Optimization
Lecture V Numerical Optimization Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Numerical Optimization p. 1 /19 Isomorphism I We describe minimization problems: to maximize
More informationWhen you square a binomial, you can apply the FOIL method to find the product. You can also apply the following rules as a short cut.
Squaring a Binomial When you square a binomial, you can apply the FOIL method to find the product. You can also apply the following rules as a short cut. Solve. (x 3) 2 Step 1 Square the first term. Rules
More informationare Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication
7. Banach algebras Definition 7.1. A is called a Banach algebra (with unit) if: (1) A is a Banach space; (2) There is a multiplication A A A that has the following properties: (xy)z = x(yz), (x + y)z =
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationMATH LESSON 24 EXAMPLE SOLUTIONS OCTOBER 27, 2017
MATH 16020 LESSON 24 EXAMPLE SOLUTIONS OCTOBER 27, 2017 Example 1. We are tasked with constructing a rectangular box with a volume of 64 cubic feet. The material for the top costs 8 dollars per square
More informationSolution 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
More informationComputational Methods CMSC/AMSC/MAPL 460. Solving nonlinear equations and zero finding. Finding zeroes of functions
Computational Methods CMSC/AMSC/MAPL 460 Solving nonlinear equations and zero finding Ramani Duraiswami, Dept. of Computer Science Where does it arise? Finding zeroes of functions Solving functional equations
More informationThe Plan. Initial value problems (ivps) for ordinary differential equations (odes) Review of basic methods You are here: Hamiltonian systems
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 2 Dianne P. O Leary c 2008 The Plan
More informationPackage RootsExtremaInflections
Type Package Package RootsExtremaInflections May 10, 2017 Title Finds Roots, Extrema and Inflection Points of a Curve Version 1.1 Date 2017-05-10 Author Demetris T. Christopoulos Maintainer Demetris T.
More informationPHYSICS 3266 SPRING 2016
PHYSICS 3266 SPRIG 2016 Each problem is worth 5 points as discussed in the syllabus. For full credit you must include in your solution a copy of your program (well commented and listed any students that
More informationAssignment 13 Assigned Mon Oct 4
Assignment 3 Assigned Mon Oct 4 We refer to the integral table in the back of the book. Section 7.5, Problem 3. I don t see this one in the table in the back of the book! But it s a very easy substitution
More informationOutline. Scientific Computing: An Introductory Survey. Optimization. Optimization Problems. Examples: Optimization Problems
Outline Scientific Computing: An Introductory Survey Chapter 6 Optimization 1 Prof. Michael. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
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 informationSolving nonlinear equations
Chapter Solving nonlinear equations Bisection Introduction Linear equations are of the form: find x such that ax + b = 0 Proposition Let f be a real-valued function that is defined and continuous on a
More informationOutline. 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
More informationHomework 5. Convex Optimization /36-725
Homework 5 Convex Optimization 10-725/36-725 Due Tuesday November 22 at 5:30pm submitted to Christoph Dann in Gates 8013 (Remember to a submit separate writeup for each problem, with your name at the top)
More informationMathematics (MEI) Advanced Subsidiary GCE Core 1 (4751) May 2010
Link to past paper on OCR website: http://www.mei.org.uk/files/papers/c110ju_ergh.pdf These solutions are for your personal use only. DO NOT photocopy or pass on to third parties. If you are a school or
More informationInverse Singular Value Problems
Chapter 8 Inverse Singular Value Problems IEP versus ISVP Existence question A continuous approach An iterative method for the IEP An iterative method for the ISVP 139 140 Lecture 8 IEP versus ISVP Inverse
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) Linear Systems Fall 2015 1 / 12 Introduction We continue looking how to solve linear systems of
More informationNonlinear equations can take one of two forms. In the nonlinear root nding n n
Chapter 3 Nonlinear Equations Nonlinear equations can take one of two forms. In the nonlinear root nding n n problem, a function f from < to < is given, and one must compute an n-vector x, called a root
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 information