Numerical Methods in Physics and Astrophysics
|
|
- Beatrice Price
- 6 years ago
- Views:
Transcription
1 Kostas Kokkotas 2 October 20, kokkotas Kostas Kokkotas 3
2 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation & curve fitting 4. Numerical differentiation and numerical integration 5. Numerical Solution of ODEs 6. Boundary and Characteristic Value Problems 7. Mathematical introduction to PDEs 8. Numerical Solution of PDEs 9. Finite Elements Methods TEXTBOOKS 1. Applied Numerical Analysis C.F. Gerald & P.O.Wheatley, Addison-Wesley 7th Edition (2004) 2. Numerical Recipes. The Art of Scientific Computing W.H. Press, S.A.Teukolsky, & W. T. Vetterling, Cambridge University Press (2007) Kostas Kokkotas 4
3 Outline II 1. Solving nonlinear equations Bisection method Linear interpolation xn+1 = g(x n ) Newton s method 2. Solving systems of equations Gaussian elimination Iterative methods Matrix inverse Eigenvalues & Eigenvectors Nonlinear systems 3. Interpolation, approximation & curve fitting Interpolating polynomials Spline Curves Rational function approximations Kostas Kokkotas 5
4 Outline III 1. Numerical differentiation and integration Numerical differentiation Trapezoidal rule Simpson rules Gaussian quadrature Multiple integrals 2. Numerical Solution of ODEs Euler s method Runge-Kutta methods Adam s method Prediction-Correction methods 3. Numerical Solution of PDEs Elliptic equations Parabolic equations Hyperbolic equations Kostas Kokkotas 6
5 Solving nonlinear equations The classical problem is to find a value r such that for a function f (x) where x (a, b) f (r) = 0 (1) The typical procedure is to find a recurrence relation of the form: x n+1 = σ (x n ) (2) which will provide a sequence of values x 0, x 1,..., x κ,... and in the limit κ to lead in a root of equation (1). For every method we need to answer the following questions: Under what condition a method will converge If it converges, then how fast What is the best choice for the initial guess x 0. Kostas Kokkotas 7
6 Bisection method I (Bolzano) Let s assume that we are looking for the roots of the following equation: f (x) = 2 sin(x) x 2 e x = 0 (3) then x 1 = 0 and x 2 = 1 which give f (0) = 1 and f (1) = x 3 = (x 0 + x 1 )/2 = 0.5 f (0.5) = x 4 = (x 0 + x 3 )/2 = 0.25 f (0.25) = x 5 = (x 4 + x 3 )/2 = f (0.375) = x 6 = (x 5 + x 3 )/2 = f (0.4375) = x 7 = (x 5 + x 6 )/2 = f ( ) = x n = r the other root is r 2 = Kostas Kokkotas 8
7 Bisection method II If there exists a root in the interval [a 0, b 0 ], then f (a 0 ) f (b 0 ) < 0. If µ 0 = (a 0 + b 0 )/2, then: (I) either f (µ 0 ) f (a 0 ) < 0 (II) either f (µ 0 ) f (b 0 ) < 0 (III) either f (µ 0 ) = 0. If (III), then the root has been found or else we set a new interval [µ 0, b 0 ] if (II ) [a 1, b 1 ] = (4) [a 0, µ 0 ] if (I ) Kostas Kokkotas 9
8 Bisection method III REPEAT SET x 3 = (x 1 + x 2 )/2 IF f (x 3 ) f (x 1 ) < 0 SET x 2 = x 3 ELSE SET x 1 = x 3 ENDIF UNTIL ( x 1 x 2 < E) OR f (x 3 ) = 0 Table: Procedure to find the root of a nonlinear equations using bisection method Kostas Kokkotas 10
9 Bisection method IV CRITISISM Slow convergence Problem with discontinuities ERROR : The error defined as: ε n = r x n. For this method ε n 1 2 a n b n (5) and in every step the error is half of the previous step ε n+1 = ε n 2 = ε n = = ε 0 2 n+1 (6) and if we demand an error E we can calculate the number of steps needed: n = log 2 ε 0 E (7) Kostas Kokkotas 11
10 Linear interpolation Assume that the function is linear in the interval (x 1, x 2 ) where f (x 1 ) and f (x 2 ) are of opposite sign. Then there will be a straight line connecting the points (x 1, f (x 1 )) and (x 2, f (x 2 )) described by the equation: y (x) = f (x 1 ) + f (x 1) f (x 2 ) x 1 x 2 (x x 1 ) (8) which crosses the axis Ox let say in a point x 3 which will be given by the following relation x 3 = x 2f (x 1 ) x 1 f (x 2 ) f (x 1 ) f (x 2 ) = x 2 f (x 2 ) f (x 2 ) f (x 1 ) (x 2 x 1 ) (9) That is we substitute the actual function with a straight line and we assume that the point where this lines crosses the axis Ox is a first approximation to the root of the equation. This new point x 3 will be used to find a better approximation to the actual root r. Kostas Kokkotas 12
11 Linear interpolation A possible choice of the new points: (I) If f (x 1 ) f (x 3 ) < 0 x 2 = x 3 (II) If f (x 2 ) f (x 3 ) < 0 x 1 = x 3 (III) If f (x 3 ) = 0 Recurrence relation: f (x n+1 ) x n+2 = x n+1 f (x n+1 ) f (x n ) (x n+1 x n ). (10) Kostas Kokkotas 13
12 Linear interpolation : 1st algorithm Assume that the root is in the interval (x 1, x 2 ) REPEAT x SET x 3 = x 2 f (x 2 ) 2 x 1 f (x 2) f (x 1) IF f (x 3 ) f (x 1 ) < 0 SET x 2 = x 3 ELSE SET x 1 = x 3 ENDIF UNTIL f (x 3 ) < E PROBLEM: Examine after how many iterations you will find the root of equation (3) with an error of the order of E Kostas Kokkotas 14
13 Linear interpolation : 2nd algorithm The root is not included in the initial choice of the interval (x 1, x 2 ) REPEAT x SET x 3 = x 2 f (x 2 ) 2 x 1 f (x 2) f (x 1) IF f (x 1 ) < f (x 2 ) SET x 2 = x 3 ELSE SET x 1 = x 3 ENDIF UNTIL f (x 3 ) < E Kostas Kokkotas 15
14 Linear interpolation : Convergence If r is a root of the equation f (x) = 0 and ε n = r x n is the error for x = x n, the the convergence of the method of linear interpolation is PROOF : If we assume that x n = r + ε n and ε n+1 = k ε n (11) then the relation becomes f (x n ) = f (r + ε n ) = f (r) + ε n f (r) + ε2 n 2 f (r) (12) x n+2 = x n+1 f (x n+1 ) f (x n+1 ) f (x n ) (x n+1 x n ) (13) ε n+1 f (r) + ε 2 n+1 r +ε n+2 = r +ε n+1 f (r)/2 f (r) (ε n+1 ε n ) f (r) ( ε 2 n+1 ) (ε n+1 ε n ) ε2 n Kostas Kokkotas 16
15 which leads to: ε n+2 = ε n+1 [1 ( 1 ε n 2 f )] (r) f (r) f = ε n+1 ε n (r) 2f (r) but we are aiming for a relation of the form ε n+1 = k ε m n } ( ε n+1 = k ε m n f ε n+2 = k ε m k ε m ) (r) n+1 = ε n+1 ε n n+1 2f (r) k ε m n = ε n+1 = ( ) 1 A k ( ) 1 1 m 1 1 ε m 1 n A 1 m 1 where A = f (r) k 2f (r) m 1 ε 1 m 1 n m = 1 ± 5 2 k = ( ) A 1/(m 1) k m = 1 m 1 m2 m 1 = 0 = and k m = A = f (r) 2f (r) (14) ε n+1 = k ε n (15) Kostas Kokkotas 17
16 Method x n+1 = g(x n ) Write the nonlinear equation in a form x n+1 = g (x n ) such as lim n x n = r (n = 1, 2, 3,... ) Kostas Kokkotas 18
17 THEOREM: If g(x) and g (x) are continuous on an interval about a root r of the equation x = g(x), and if g (x) < 1 for all x in the interval, then the recurrence x n+1 = g(x n ) (n = 1, 2, 3,... ) will converge to the root x = r, provided that x 1 is chosen in the interval. Note that this is a sufficient condition only, since for some equations convergence is secured even though not all the conditions hold. In a computer program it is worthwhile to determine whether x 3 x 2 < x 2 x 1 ERROR After n steps the error will be ε n = r x n ε n+1 = r x n+1 = g (r) g(x n ) = g (r)(r x n ) = g (r) ε n I.e. linear convergence. The rate of convergence is rapid if g (x) is small in the interval. If the derivative is negative the errors alternate in sign giving oscillatory convergence. Kostas Kokkotas 19
18 Method x n+1 = g(x n ) : Example Find the root of equation f (x) = x + ln(x) in the interval [0.1, 1]. We will try various forms of rewriting the equation: x n+1 = ln(x n ) but g (x) = 1 1 on [0.1, 1] : no convergence. x x n+1 = e xn then g (x) = e x e < 1 : convergence. another writing : x n+1 = (x n + e xn )/2 then g (x) = e x e 1 = : better convergence. finally x n+1 = xn+2e xn 3 thus g (x) = e x e 1 = 0.03 : even better convergence. Thus the obvious choice is: x n+1 = x n + 2e xn 3. Kostas Kokkotas 20
19 Aitken s improvement If a method is converging linearly (e.g. ε n+1 = g (r)ε n ) then it can be improved to produce even more accurate results without extra iterations. The error the method x n+1 = g (x n ) after n iterations is: r x n+1 g (r)(r x n ) after n + 1 is: and by division we get r x n+2 g (r)(r x n+1 ) Then by solving for r we get: r x n+1 = g (r)(r x n ) r x n+2 g (r)(r x n+1 ) r = x n (x n x n 1 ) 2 x n 2x n 1 + x n 2 (16) This relation improves considerably the accuracy of the final result. Kostas Kokkotas 21
20 Newton s method If near the root r of an equation f (x) = 0 the 1st and 2nd derivatives of f (x) are continuous we can develop root finding techniques which converge faster than any method presented till now. Let s assume that after n iterations we reached a value x n+1 which is the root of the equation and x n is a nearby value such as: x n+1 = x n + ε n. Then: f (x n+1 ) = f (x n + ε n ) = f (x n ) + ε n f (x n ) + ε2 n 2 f (x n ) + but since f (x n+1 ) = 0 0 = f (x n ) + ε n f (x n ) i.e. ε n = f (x n) f (x n ) x n+1 = x n f (x n) f (x n ) (17) Kostas Kokkotas 22
21 Newton s method : Convergence If r is a root of f (x) = 0. Then x n = r + ε n and x n+1 = r + ε n+1, thus: r + ε n+1 = r + ε n f (r + ε n) f (r + ε n ) = r + ε n f (r) + ε nf (r) ε2 nf (r) f (r) + ε n f (r) but since f (r) = 0 and we get the following relation: εf (r)/f (r) 1 ε f (r) n f (r) ε n+1 = f (r) 2f (r) ε2 n (18) Notice that the convergence of the method is quadratic Kostas Kokkotas 23
22 Newton s method : Convergence II An alternative way for studying the convergence of Newton s method (17) is based on the method x n+1 = g(x n ) i.e. successive iterations will converge if g (x) < 1. Here: g(x) = x f (x) f (x) g (x) = f (x)f (x) [f (x)] 2 (19) since ɛ n = x n r = g(x n ) g(r) we get This leads to: g(x n ) = g(r + ɛ n ) = g(r) + g (r)ɛ n + g (ξ) ɛ 2 n (20) 2 = g(r) + g (ξ) ɛ 2 n, ξ [r, x n ] (21) 2 g(x n ) g(r) = g (ξ) 2 ɛ 2 n x n+1 r ɛ n+1 = g (ξ) ɛ 2 n (22) 2 Kostas Kokkotas 24
23 Newton s method : Algorithm COMPUTE f (x 1 ), f (x 1 ) SET x 2 = x 1 IF (f (x 1 ) 0) END (f (x 1 ) 0) REPEAT SET x 2 = x 1 SET x 1 = x 1 f (x 1 )/f (x 1 ) UNTIL ( x 1 x 2 < E) OR ( f (x 2 ) < E ) ENDIF EXAMPLE : Find the square root of a number a. Then f (x) = x 2 a and f (x) = 2x x n+1 = x n x 2 n a 2x n or in a better form x n+1 = 1 2 (x n + axn ). (23) Kostas Kokkotas 25
24 Newton s method : Halley Remember that ε n = x n+1 x n, then f (x n+1 ) = f (x n + ε n ) = f (x n ) + ε n f (x n ) + ε2 n 2 f (x n ) +... [ f (x n ) + ε n f (x n ) + ε ] n 2 f (x n ) = 0 f (x n ) ε n = f (x n ) + εn 2 f (x n ) from the 1st order result we substitute ε n f (x n) f (x n ) x n+1 = x n f (x n ) f (x n ) f (x n) f (x n) 2f (x n) = x n 2f (x n ) f (x n ) 2f 2 (x n ) f (x n ) f (x n ) (24) obviously for f (x n ) 0 we get the Newton-Raphson method. Kostas Kokkotas 26
25 Newton s method : Halley -Convergence Halley s methods achieves cubic convergence: [ 1 f (ξ) ε n+1 = 6 f (ξ) 1 ( f ) ] 2 (ξ) 4 f ε 3 n (25) (ξ) EXAMPLE: The square root of a number Q (here Q = 9) with Halley s method is given by (compare with eq. (23): x n+1 = x 3 n + 3x n Q 3x 2 n + Q (26) Newton Error Halley Error x 0 =15 ε 0 = 12 x 0 =15 ε 0 = 12 x 1 =7.8 ε 1 = 4.8 x 1 =5.526 ε 1 = 2.5 x 2 =4.477 ε 2 = x 2 = ε 2 = 0.16 x 3 = ε 3 = x 3 = ε 3 = x 4 = ε 4 = x 4 = ε 4 = Kostas Kokkotas 27
26 Newton s method : Multipole roots If f (x) = (x r) m q(x) where m is the multiplicity of root r then f (x) = (x r) m 1 [mq(x) + (x r)q (x)] i.e. both f (r) = 0 and f (r) = 0. Thus the ratio [f (x)/f (x)] x r will diverge. To avoid the problem we construct a new function φ(x) = f (x) f (x) = (x r)q(x) mq(x) + (x r)q (x) which obviously has r as root with multiplicity m = 1 and the recurrence relation is: x n+1 = x n φ(x n) φ (x n ) = x f (x n )/f (x n ) n {[f (x n )] 2 f (x n )f (x n )} /[f (x n )] 2 = x n f (x n ) f (x n ) [f (x n )] 2 f (x n )f (x n ) The convergence is quadratic since we applied Newton-Raphson method for for finding the roots of φ(x) = 0 for which r is a simple root. (27) Kostas Kokkotas 28
27 Newton s method : Multipole roots Find the multipole root of f (x) = x 4 4x = 0 (r = 2 = ). Standard Newton-Raphson x n+1 = x n x 2 n 2 4x n (A) Modified Newton-Raphson x n+1 = x n (x 2 n 2)x n x 2 n + 2 (B). x (A) Error (A) (B) Error (B) x x x x Kostas Kokkotas 29
28 Convergence tests We will compare the convergence rate of a method with linear and one with quadratic convergence (Bisection and Newton) For linear convergence we have:: ε n+1 lim = a ε n a ε n 1 a 2 ε n 2... a n ε 0 n ε n then by solving the above equation for n we come to a relation which gives the number of iterations, n, needed to achieve a given accuracy ε n : n log 10 ε n log 10 ε 0 log 10 a (28) In the same way for quadratic convergence we get: ε n+1 lim n ε n 2 = b ε n b ε n 1 2 b 3 ε n b 2 n+1 1 ε 0 2n+1 Kostas Kokkotas 30
29 and by solving the above relation for n in order to achieve a given accuracy ε n we get: 2 n+1 log 10 ε n + log 10 b log 10 ε 0 + log 10 b (29) If for a given problem we ask that the error after n iterations to be smaller than 10 6 i.e. ε n 10 6 with an initial error ε 0 = 0.5 and for a = b = 0.7 the relation (28) gives: n log log log iterations The same assumptions for quadratic convergence will give: 2 n+1 log log log log i.e. the number of iterations is only 3! The difference becomes more pronounce if we demand even higher accuracy e.g. ε n then bisection will need 89 iterations while Newton s method will need only 4! Kostas Kokkotas 31
30 Non-linear systems of equations We will present two methods based on the techniques of the previous section in solving systems of non-linear equations. The two methods are based on Newton s method and in the x n+1 = g(x n ) method. An example of two non-linear equations is the following: f (x, y) = e x 3y 1 g(x, y) = x 2 + y 2 4 (30) it is obvious that f (x, y) = 0 and g(x, y) = 0 are two curves on the xy plane as in the Figure on the right. Kostas Kokkotas 32
31 Newton s method for 2 equations We will develop the method for a system of two non-linear equations while the extension to n nonlinear equations will become obvious. Let s assume: f (x, y) = 0, g (x, y) = 0 Let s assume that after n + 1 iteration the method converged to the solution (x n+1, y n+1 ) i.e. f (x n+1, y n+1 ) 0 and g(x n+1, y n+1 ) 0. Then by assuming that x n+1 = x n + ε n and y n+1 = y n + δ n we can Taylor expand around the solution i.e. 0 f (x n+1, y n+1 ) = f (x n +ε n, y n +δ n ) f (x n, y n )+ε n ( f x 0 g(x n+1, y n+1 ) = g(x n +ε n, y n +δ n ) g(x n, y n )+ε n ( g x ) ) ( f +δ n n y ( g +δ n n y ) n ) n Kostas Kokkotas 33
32 And by solving the system with respect to ε n and δ n we get : ε n = f g f x y + g f y g y g x f y and δ n = g f f x x + f g x g y g x f y (31) Since x n+1 = x n + ε n and y n+1 = y n + δ n we come to the following pair of recurrence relations, which are generalizations of Newton s method: ( ) f gy g f y x n+1 = x n f x g y g x f y ( ) g fx f g x y n+1 = y n f x g y g x f y n n (32) (33) Kostas Kokkotas 34
33 Newton s method n non-linear equations If we assume the following system of N equations f 1 (x 1, x 2,..., x N ) = 0.. f n (x 1, x 2,..., x N ) = 0 with N unknowns (x 1, x 2,..., x N ). Then by considering a solution of the system (xn+1 1, x n+1 2,..., x n+1 N ) for which we assume the following relations xn+1 1 = x n 1 + xn 1.. xn+1 N = x n N + xn N Kostas Kokkotas 35
34 We can create expansion of the form: 0 = f 1 (x 1 n+1,..., x N n+1) = f 1 (x 1 n + x 1 n,..., x N n + x N n ) f 1 + f 1 x 1 x 1 n f 1 x N x N n.. (34) 0 = f N (x 1 n+1,..., x N n+1) = f N (x 1 n + x 1 n,..., x N n + x N n ) f N + f N x 1 x 1 n f N x N x N n Then the quantities xn i will be found as solutions of the linear system f 1 f 1 f x 1 x 1 2 x N xn 1 f 1... =. (35) f N f N x 1 x x N 2 n f N f N x N Kostas Kokkotas 36
35 Thus if we start with N initial values (x0 1, x 0 2,..., x 0 N ) then from the solution of the above system we will calculate the quantities xn i which lead to the new values (x1 1, x 1 2,..., x 1 N ) via the relations: x 1 1 = x x (36) x N 1 = x N 0 + x N 0 This procedure will be repeated till the a given accuracy is reached i.e. max x i n < E. Kostas Kokkotas 37
36 Methods of type x = g(x) Let s assume the system on N nonlinear equations: f 1 (x 1, x 2,..., x N ) = 0 f N (x 1, x 2,..., x N ) = 0 The system can be rewritten in the form: x 1 = F 1 (x 1, x 2,..., x N ).. (37).. (38) x N = F N (x 1, x 2,..., x N ) A SIMPLE CHOICE: Give some N initial values (x 1,..., x N ) 0 in the right hand side of the equations and find a set on N new values (x 1,..., x N ) 1. Repeat the procedure till you reach a solution with a given accuracy. Kostas Kokkotas 38
37 AN IMPROVED APPROACH: Give some N initial values (x 1,..., x N ) 0 in the right hand side of the 1st of the equations (38) and find a new value (x 1 ) 1. Then in the right hand side of the 2nd equations apply the following set of guess values (x 1 ) 1, (x 2,..., x N ) 0 and estimate (x 2 ) 1. Continue in the third equation by applying the improved set of values : (x 1, x 2 ) 1, (x 3,..., x N ) 0 and so on. CONVERGENCE: The system x i = F i (x 1, x 2,..., x N ) with i = 1,..., N will converge to a solution, if near this solution the following criterion is satisfied: F 1 x 1 + F 1 x F 1 x N < 1 F N x 1.. (39) + F N x F N x N < 1 Kostas Kokkotas 39
38 Methods of type x = g(x) : EXAMPLE The non-linear system of equations x 2 + y 2 = 4 and e x 3y = 1 with exact solutions (1.5595,1.2522) and ( , ) can be written in the form: x n+1 = 4 y 2 n and y n+1 = 1 3 (exn 1) for an initial choice ( 1, 0), we create the following sequence of solutions n x y which after 5 iterations approaches the exact solution. Kostas Kokkotas 40
39 If we use the 2nd method then the results are: n x y i.e. the same accuracy has been achieved with only 3 iterations. In order to find the 2nd solution of the system we modify the recurrence relations as follows: x n+1 = 4 y 2 n and y n+1 = 1 3 (exn 1) If we start with values close to the exact solution e.g. x 0 = 1.5 and y 0 = 1 the results are : n x y we notice that we diverge from the solution and the reason is that the criteria for convergence set earlier are not satisfied. Kostas Kokkotas 41
40 While if we write the recurrence relation in the form y n+1 = 4 xn 2 x n+1 = ln(1 + 3y n ) after some iterations we will find the 2nd solution. Kostas Kokkotas 42
41 Selected problems I 1. Find the eigenvalues λ of the differential equation y + λ 2 y = 0 with the following boundary conditions y(0) = 0 and y(1) = y (1). 2. Find the inverse of a number without using division 3. If a is a given number find the value of 1/ a. 4. Find the root of equation e x sin(x) = 0 (r = ). If the initial interval is [ 4, 3] estimate the number of iteration needed to reach an accuracy of 4 digits i.e. x n r < Repeat the previous estimation for using the methods of linear interpolation and Newton. 6. Solve the following system of equations using both methods and estimate the rate of convergence: e x y = 0 and xy e x = 0 Kostas Kokkotas 43
42 1. Consider the nonlinear system of equations f 1 (x, y) = x 2 + y 2 2 = 0, and f 2 (x, y) = xy 1 = 0. It is obvious that the solutions are (1, 1) and ( 1, 1), examine the difficulties that might arise if we try to use Newton s method to find the solution. Kostas Kokkotas 44
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
More informationIntroductory Numerical Analysis
Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection
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 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 informationApplied Numerical Analysis
Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory
More informationNumerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error. 2- Fixed point
Numerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error In this method we assume initial value of x, and substitute in the equation. Then modify x and continue till we
More informationPARTIAL DIFFERENTIAL EQUATIONS
MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL
More informationNumerical Methods I Solving Nonlinear Equations
Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)
More informationSimple Iteration, cont d
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 2 Notes These notes correspond to Section 1.2 in the text. Simple Iteration, cont d In general, nonlinear equations cannot be solved in a finite sequence
More informationMATHEMATICAL METHODS INTERPOLATION
MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU
More informationOrder of convergence
Order of convergence Linear and Quadratic Order of convergence Computing square root with Newton s Method Given a > 0, p def = a is positive root of equation Newton s Method p k+1 = p k p2 k a 2p k = 1
More 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 informationSOLUTION 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
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 informationNumerical Analysis. A Comprehensive Introduction. H. R. Schwarz University of Zürich Switzerland. with a contribution by
Numerical Analysis A Comprehensive Introduction H. R. Schwarz University of Zürich Switzerland with a contribution by J. Waldvogel Swiss Federal Institute of Technology, Zürich JOHN WILEY & SONS Chichester
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 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 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
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 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 informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More informationBisection Method. and compute f (p 1 ). repeat with p 2 = a 2+b 2
Bisection Method Given continuous function f (x) on the interval [a, b] with f (a) f (b) < 0, there must be a root in (a, b). To find a root: set [a 1, b 1 ] = [a, b]. set p 1 = a 1+b 1 2 and compute f
More informationName of the Student: Unit I (Solution of Equations and Eigenvalue Problems)
Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK
KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS
More informationTABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1. Chapter Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9
TABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1 Chapter 01.01 Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9 Chapter 01.02 Measuring errors 11 True error 11 Relative
More informationContents. I Basic Methods 13
Preface xiii 1 Introduction 1 I Basic Methods 13 2 Convergent and Divergent Series 15 2.1 Introduction... 15 2.1.1 Power series: First steps... 15 2.1.2 Further practical aspects... 17 2.2 Differential
More informationCAM Ph.D. Qualifying Exam in Numerical Analysis CONTENTS
CAM Ph.D. Qualifying Exam in Numerical Analysis CONTENTS Preliminaries Round-off errors and computer arithmetic, algorithms and convergence Solutions of Equations in One Variable Bisection method, fixed-point
More informationSOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS)
CHENDU COLLEGE OF ENGINEERING AND TECHNOLOGY (Approved by AICTE New Delhi, Affiliated to Anna University Chennai. Zamin Endathur Village, Madurntakam Taluk, Kancheepuram Dist.-603311.) MA6459 - NUMERICAL
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 informationIntegration, differentiation, and root finding. Phys 420/580 Lecture 7
Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:
More informationCS 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
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 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 information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
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 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 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 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 informationBisection and False Position Dr. Marco A. Arocha Aug, 2014
Bisection and False Position Dr. Marco A. Arocha Aug, 2014 1 Given function f, we seek x values for which f(x)=0 Solution x is the root of the equation or zero of the function f Problem is known as root
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 information1. 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
More informationBACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES
No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks
More information3.1 Introduction. Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x x 1.5 =0, tan x x =0.
3.1 Introduction Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x 3 +1.5x 1.5 =0, tan x x =0. Practical existence test for roots: by intermediate value theorem, f C[a, b] & f(a)f(b)
More informationx 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)
More informationNUMERICAL MATHEMATICS AND COMPUTING
NUMERICAL MATHEMATICS AND COMPUTING Fourth Edition Ward Cheney David Kincaid The University of Texas at Austin 9 Brooks/Cole Publishing Company I(T)P An International Thomson Publishing Company Pacific
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 informationNumerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.
Numerical Methods for Engineers An Introduction with and Scientists Applications using MATLAB Third Edition Amos Gilat Vish- Subramaniam Department of Mechanical Engineering The Ohio State University Wiley
More informationRoot Finding Convergence Analysis
Root Finding Convergence Analysis Justin Ross & Matthew Kwitowski November 5, 2012 There are many different ways to calculate the root of a function. Some methods are direct and can be done by simply solving
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Linear Multistep methods Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the
More informationA Few Concepts from Numerical Analysis
2 A Few Concepts from Numerical Analysis A systematic treatment of numerical methods is provided in conventional courses and textbooks on numerical analysis. But a few very common issues, that emerge in
More informationNumerical Methods. Scientists. Engineers
Third Edition Numerical Methods for Scientists and Engineers K. Sankara Rao Numerical Methods for Scientists and Engineers Numerical Methods for Scientists and Engineers Third Edition K. SANKARA RAO Formerly,
More informationM.SC. PHYSICS - II YEAR
MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. PHYSICS - II YEAR DKP26 - NUMERICAL METHODS (From the academic year 2016-17) Most Student
More informationMA1023-Methods of Mathematics-15S2 Tutorial 1
Tutorial 1 the week starting from 19/09/2016. Q1. Consider the function = 1. Write down the nth degree Taylor Polynomial near > 0. 2. Show that the remainder satisfies, < if > > 0 if > > 0 3. Show that
More informationA short presentation on Newton-Raphson method
A short presentation on Newton-Raphson method Doan Tran Nguyen Tung 5 Nguyen Quan Ba Hong 6 Students at Faculty of Math and Computer Science. Ho Chi Minh University of Science, Vietnam email. nguyenquanbahong@gmail.com
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 informationNotes for Numerical Analysis Math 5465 by S. Adjerid Virginia Polytechnic Institute and State University. (A Rough Draft)
Notes for Numerical Analysis Math 5465 by S. Adjerid Virginia Polytechnic Institute and State University (A Rough Draft) 1 2 Contents 1 Error Analysis 5 2 Nonlinear Algebraic Equations 7 2.1 Convergence
More 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 informationNUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A)
NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A) Unit - 1 Errors & Their Accuracy Solutions of Algebraic and Transcendental Equations Bisection Method The method of false position The iteration method
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 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 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 informationVirtual University of Pakistan
Virtual University of Pakistan File Version v.0.0 Prepared For: Final Term Note: Use Table Of Content to view the Topics, In PDF(Portable Document Format) format, you can check Bookmarks menu Disclaimer:
More informationGENG2140, S2, 2012 Week 7: Curve fitting
GENG2140, S2, 2012 Week 7: Curve fitting Curve fitting is the process of constructing a curve, or mathematical function, f(x) that has the best fit to a series of data points Involves fitting lines and
More informationNumerical techniques to solve equations
Programming for Applications in Geomatics, Physical Geography and Ecosystem Science (NGEN13) Numerical techniques to solve equations vaughan.phillips@nateko.lu.se Vaughan Phillips Associate Professor,
More informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
More informationRoot Finding: Close Methods. Bisection and False Position Dr. Marco A. Arocha Aug, 2014
Root Finding: Close Methods Bisection and False Position Dr. Marco A. Arocha Aug, 2014 1 Roots Given function f(x), we seek x values for which f(x)=0 Solution x is the root of the equation or zero of the
More informationyou expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form
Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)
More information5. Hand in the entire exam booklet and your computer score sheet.
WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test
More informationNumerical methods. Examples with solution
Numerical methods Examples with solution CONTENTS Contents. Nonlinear Equations 3 The bisection method............................ 4 Newton s method.............................. 8. Linear Systems LU-factorization..............................
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationScientific 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
More informationPreface. 2 Linear Equations and Eigenvalue Problem 22
Contents Preface xv 1 Errors in Computation 1 1.1 Introduction 1 1.2 Floating Point Representation of Number 1 1.3 Binary Numbers 2 1.3.1 Binary number representation in computer 3 1.4 Significant Digits
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 informationNumerical Marine Hydrodynamics Summary
Numerical Marine Hydrodynamics Summary Fundamentals of Digital Computing Error Analysis Roots of Non-linear Equations Systems of Linear Equations Gaussian Elimination Iterative Methods Optimization, Curve
More informationGoals for This Lecture:
Goals for This Lecture: Learn the Newton-Raphson method for finding real roots of real functions Learn the Bisection method for finding real roots of a real function Look at efficient implementations of
More informationOrdinary Differential Equations
CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things
More informationNumerical Methods for Engineers and Scientists
Numerical Methods for Engineers and Scientists Second Edition Revised and Expanded Joe D. Hoffman Department of Mechanical Engineering Purdue University West Lafayette, Indiana m MARCEL D E К К E R MARCEL
More informationProject on Newton-Raphson Method
Project on Newton-Raphson Method Nguyen Quan Ba Hong Doan Tran Nguyen Tung Students at Faculty of Math and Computer Science, Ho Chi Minh University of Science, Vietnam email. email. dtrngtung@live.com
More informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
NUMERICAL ANALYSIS PRACTICE PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon's method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
More information8 Numerical methods for unconstrained problems
8 Numerical methods for unconstrained problems Optimization is one of the important fields in numerical computation, beside solving differential equations and linear systems. We can see that these fields
More informationCHAPTER 4. Interpolation
CHAPTER 4 Interpolation 4.1. Introduction We will cover sections 4.1 through 4.12 in the book. Read section 4.1 in the book on your own. The basic problem of one-dimensional interpolation is this: Given
More informationRoots of Equations. ITCS 4133/5133: Introduction to Numerical Methods 1 Roots of Equations
Roots of Equations Direct Search, Bisection Methods Regula Falsi, Secant Methods Newton-Raphson Method Zeros of Polynomials (Horner s, Muller s methods) EigenValue Analysis ITCS 4133/5133: Introduction
More informationASSIGNMENT BOOKLET. Numerical Analysis (MTE-10) (Valid from 1 st July, 2011 to 31 st March, 2012)
ASSIGNMENT BOOKLET MTE-0 Numerical Analysis (MTE-0) (Valid from st July, 0 to st March, 0) It is compulsory to submit the assignment before filling in the exam form. School of Sciences Indira Gandhi National
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More informationNUMERICAL METHODS USING MATLAB
NUMERICAL METHODS USING MATLAB Dr John Penny George Lindfield Department of Mechanical Engineering, Aston University ELLIS HORWOOD NEW YORK LONDON TORONTO SYDNEY TOKYO SINGAPORE Preface 1 An introduction
More informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Multidimensional Unconstrained Optimization Suppose we have a function f() of more than one
More informationFundamental Numerical Methods for Electrical Engineering
Stanislaw Rosloniec Fundamental Numerical Methods for Electrical Engineering 4y Springei Contents Introduction xi 1 Methods for Numerical Solution of Linear Equations 1 1.1 Direct Methods 5 1.1.1 The Gauss
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 informationSolving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations
Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations Outline ODEs and initial conditions. Explicit and implicit Euler methods. Runge-Kutta methods. Multistep
More information1 Series Solutions Near Regular Singular Points
1 Series Solutions Near Regular Singular Points All of the work here will be directed toward finding series solutions of a second order linear homogeneous ordinary differential equation: P xy + Qxy + Rxy
More informationNUMERICAL METHODS FOR ENGINEERING APPLICATION
NUMERICAL METHODS FOR ENGINEERING APPLICATION Second Edition JOEL H. FERZIGER A Wiley-Interscience Publication JOHN WILEY & SONS, INC. New York / Chichester / Weinheim / Brisbane / Singapore / Toronto
More informationPolynomial Interpolation
Polynomial Interpolation (Com S 477/577 Notes) Yan-Bin Jia Sep 1, 017 1 Interpolation Problem In practice, often we can measure a physical process or quantity (e.g., temperature) at a number of points
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 informationComputational Methods
Numerical Computational Methods Revised Edition P. B. Patil U. P. Verma Alpha Science International Ltd. Oxford, U.K. CONTENTS Preface List ofprograms v vii 1. NUMER1CAL METHOD, ERROR AND ALGORITHM 1 1.1
More informationNumerical Methods. Root Finding
Numerical Methods Solving Non Linear 1-Dimensional Equations Root Finding Given a real valued function f of one variable (say ), the idea is to find an such that: f() 0 1 Root Finding Eamples Find real
More informationRoots of equations, minimization, numerical integration
Roots of equations, minimization, numerical integration Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University November 1, 2017 Roots of equations Find the roots solve equation
More information