Determining the Rolle function in Lagrange interpolatory approximation
|
|
- Angel Chapman
- 5 years ago
- Views:
Transcription
1 Determining the Rolle function in Lagrange interpolatory approimation arxiv: v1 [math.na] Oct 18 J. S. C. Prentice Department of Pure and Applied Mathematics University of Johannesburg South Africa October 4, 18 Abstract We determine the Rolle function in Lagrange polynomial approimation using a suitable differential equation. We then propose a device for improving the Lagrange approimation by eploiting our knowledge of the Rolle function. 1 Introduction Approimation of nonlinear functions is of fundamental importance in applied mathematics, especially by means of polynomials. Those techniques for which the approimation error is well understood are particularly useful. In this paper, we describe how the error in Lagrange polynomial interpolation can be precisely determined, by solving an appropriate initial-value problem. We then consider using the knowledge so obtained to improve the quality of the original approimation. Relevant Concepts, Terminology and Notation Let f ) be a real-valued univariate function. The Lagrange interpolating polynomial P n ) of degree n, at most, that interpolates the data {f ), 1
2 f 1 ),...,f n )} at the nodes {, 1,..., n }, where < 1 < < n, has the property P n k ) = f k ) for k =,1,...,n. Naturally, we regard P n ) as an approimation to f ). The pointwise error in Lagrange interpolation, on [, n ], is ;P n ) f ) P n ) = fn+1) ξ)) n+1)! n k ), 1) where < ξ) < n, and is derived by invoking Rolle s Theorem [1, ]. Clearly, we assume here that f ) is n+1)-times differentiable and, as will be seen, we must assume that f ) is, in fact, n+)-times differentiable. We refer to ξ generically as the Rolle number, and to ξ) as the Rolle function. k= 3 Determining the Rolle Function Using the notation π) n k) we have, by differentiating with k= respect to, n+1)!f ) P n )) = f n+1) ξ))π) n+1)!f ) P n)) = f n+1) ξ)π )+π) dfn+1) ξ) dξ dξ d = f n+1) ξ)π )+π)f n+) ξ) dξ d. We have used the well-known prime notation for differentiation with respect to. In this epression, the factor f n+1) ξ) denotes the n+1)th derivative of f ξ) with respect to ξ, and similarly for f n+) ξ). We now find dξ d = n+1)!f ) P n )) fn+1) ξ)π ) π)f n+) ξ) and, if we have a particular value ξ z = ξ z ) at our disposal, we then have an initial-value problem that can, in principle, be solved to yield the Rolle function ξ). Note the necessity of our assumption that f ) is n+)- times differentiable.
3 4 Calculations Consider the Lagrange interpolation of f ) = e sin over the nodes { },. We have n = 1 so that the Lagrange polynomial is e sin )) ) e P 1 ) = =. Furthermore, we have ;P 1 ) = e sin e ) = ) e ξ) cosξ)) ) and ) dξ e cos+sin) e e ξ cosξ ) ) d = ). 3) eξ cosξ sinξ)) We solve this differential equation using an initial value chosen close to the node =. Observe that it is not possible to find the Rolle number at any interpolation node, because the factor n k) in 1) ensures that ;P n ) = at the interpolation nodes, irrespective of the value k= of ξ. Hence, we choose here z = 1 5 and determine the corresponding Rolle number by applying Newton s ) method to ). Naturally, we compute z ;P 1 ) = e z sin z z to facilitate this calculation. In fact, we e find two values for ξ z, giving the initial values z,ξ z ) = 1 5,.1931) and z,ξ z ) = 1 5,4.6631). Note to the reader: we quote numerical values correct to no more than four decimal places throughout this paper, simply for ease of presentation, but all calculations are performed in double precision). Using these two initial values we solve 3) to find ξ), shown respectively in Figures 1a) and 1b). We are then able to compute the pointwise error ;P 1 ) using ), and this is shown in Figure 1c) for z,ξ z ) = 1 5,.1931). Of course, we can compare this error curve with the actual error, and the magnitude of the difference between the two - the error in, so to speak - is shown in Figure 1d). Clearly, this error is small, indicating the accuracy of our numerical estimate of ξ). Similar results obtain for z,ξ z ) = 1 5,4.6631), with a maimum magnitude in the error in of This accuracy is a consequence of using a fourth-order Runge-Kutta method [3, 4] to solve 3) with a small stepsize ). 3
4 As a second eample, let us use the same objective function f ) as above, but now with three interpolatory nodes { },,. So, we have n = which gives P ) = a +b+c, where a = ,b = and c =. Also, with π) = ) ) ) = 3 + ) ) + π ) = 3 + 4)+, we have and ;P ) = eξ cosξ sinξ)π) 3 dξ d = 6e cos+sin) a+b)) e ξ cosξ sinξ)π ). 4) π) 4e ξ sinξ) We perform similar calculations as above, with results depicted in Figure. Again, we find two initial values z,ξ z ) = 1 5,1.7845) and z,ξ z ) = 1 5,3.8165), and the error plot in Figure d) corresponds to z,ξ z ) = 1 5,1.7845). For z,ξ z ) = 1 5,3.8165) the maimum magnitude in the error in is Our second eample allows us to make a point about the continuity of ξ). Since P ) is continuous and the assumed n+)-times differentiability of f ) implies the continuity of both f ) and f n+1) ), we will assume, from 1), that ξ) is continuous. Hence, even though it is not really meaningful to ask for the value of ξ) at an interpolatory node, the continuity of ξ) allows us to infer a value at such a node. We refer to such a value as an implied Rolle number. In our second eample we determine the implied values ξ) =.991 from Figure a) and ξ) = from Figure b). Our technique for doing this is as follows: we ensure that = is not amongst the nodes used for the Runge-Kutta calculation, because this would lead to a zero in the denominator on the RHS of 4), but we use the values of ξ) at the Runge-Kutta nodes on either side of = to estimate ξ) using linear interpolation. Of course, we acknowledge that it is not necessary to know the Rolle number at any interpolatory node, because the pointwise error at interpolatory nodes is always zero. As such, ξ) is actually arbitrary at interpolatory nodes, but our technique does allow a 4
5 sensible estimate to be made, if only for completeness sake. Note also that simple linear etrapolation will allow an estimate of ξ) to be made at the endpoints of the interval. 5 A Possible Application Our ability to determine the Rolle function suggests an interesting possibility. If we know ξ) then we know f n+1) ξ)). If we approimate f n+1) ξ)) by means of a polynomial - a least-squares fit, or a truncated Taylor series, for eample - then, using 1), we find f ) P n )+ P ξ) n+1)! n k ), where P ξ ) denotes the polynomial that approimates f n+1) ξ)). Notice that the RHS of this epression is simply a polynomial, and so constitutes a polynomial approimation to f ). Thus, our knowledge of ξ) allows us to improve the approimation P n ) by adding a polynomial term that approimates the error in P n ). By way of eample, we return to the first of our earlier calculations. Here, we have f ) = e sin ) e P 1 ) = ;P 1 ) = ) e ξ) cosξ)) using the nodes { },. Once we have found ξ) - using z,ξ z ) = 1 5,.1931) and shown in Figure 1a)- we determine a polynomial approimation to e ξ) cosξ)) using a least-squares fit. For the purpose of demonstration, we choose to fit a degree si polynomial so that ;P 1 )+P 1 ) becomes an eighth-degree polynomial approimation, which we denote 8 ). In Figure 3a) we show the pointwise error in P 1 ), and observe it has a maimum magnitude of 75. In Figure 3b) we plot the pointwise error k= e sin 8 ). This error is significantly smaller than that in Figure 3a) and has maimum magnitude In other words, 8 ) is an approimation more 5
6 than four orders of magnitude!) more accurate than P 1 ), and this was achieved only through our knowledge of the Rolle function ξ). This eample serves to illustrate the value of knowing ξ), and certainly warrants further investigation, but we will reserve a detailed study thereof for future research. 6 Conclusion We have described how the Rolle function in Lagrange interpolatory polynomial approimation can be determined by solving an initial-value problem. Knowledge of the Rolle function permits the calculation of the approimation error. In particular, the Rolle term in the epression for the approimation error can itself be approimated by means of a polynomial, once the Rolle function is known, and this can lead to a significant improvement in the quality of the Lagrange approimation overall. Of course, the ideas presented in this paper are not restricted to Lagrange approimation, but could also be applied to Hermite interpolation, for eample, in which the error term is also derived through the use of Rolle s Theorem. References [1] Isaacson, E. and Keller, H. B. 1994). Analysis of Numerical Methods, New York: Dover. [] Kincaid, D. and Cheney, W. ). Numerical Analysis: Mathematics of Scientific Computing, 3rd ed., Pacific Grove: Brooks/Cole. [3] Butcher, J. C. 3). Numerical Methods for Ordinary Differential Equations, Chichester: Wiley. [4] Hairer, E., Norsett, S.P., and Wanner, G. ). Solving Ordinary Differential Equations I: Nonstiff Problems, Berlin: Springer. 6
7 3 Figure 1a) 4.7 Figure 1b) Rolle number Rolle number Figure 1c) Figure 1d) 7 4 Delta Error in Delta
8 .4 Figure a) 3.84 Figure b) Rolle number Rolle number Figure c) Figure d) Delta Error in Delta
9 8 Figure 3a) Error Figure 3b) 4 Error
Exact and Approximate Numbers:
Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.
More informationarxiv: v1 [math.na] 31 Oct 2016
RKFD Methods - a short review Maciej Jaromin November, 206 arxiv:60.09739v [math.na] 3 Oct 206 Abstract In this paper, a recently published method [Hussain, Ismail, Senua, Solving directly special fourthorder
More informationInterpolation & Polynomial Approximation. Hermite Interpolation I
Interpolation & Polynomial Approximation Hermite Interpolation I Numerical Analysis (th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
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 informationNumerical Analysis & Computer Programming
++++++++++ Numerical Analysis & Computer Programming Previous year Questions from 07 to 99 Ramanasri Institute W E B S I T E : M A T H E M A T I C S O P T I O N A L. C O M C O N T A C T : 8 7 5 0 7 0 6
More informationNovember 20, Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 20, 2016 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More information2.29 Numerical Fluid Mechanics Fall 2009 Lecture 13
2.29 Numerical Fluid Mechanics Fall 2009 Lecture 13 REVIEW Lecture 12: Classification of Partial Differential Equations (PDEs) and eamples with finite difference discretizations Parabolic PDEs Elliptic
More informationCISE-301: Numerical Methods Topic 1:
CISE-3: Numerical Methods Topic : Introduction to Numerical Methods and Taylor Series Lectures -4: KFUPM Term 9 Section 8 CISE3_Topic KFUPM - T9 - Section 8 Lecture Introduction to Numerical Methods What
More informationInterpolation. P. Sam Johnson. January 30, P. Sam Johnson (NITK) Interpolation January 30, / 75
Interpolation P. Sam Johnson January 30, 2015 P. Sam Johnson (NITK) Interpolation January 30, 2015 1 / 75 Overview One of the basic ideas in Mathematics is that of a function and most useful tool of numerical
More informationIMPLICIT INTERVAL MULTISTEP METHODS FOR SOLVING THE INITIAL VALUE PROBLEM
COMPUTATIONAL METHODS IN SCIENCE AND TECHNOLOGY 8 (1), 17-30 (2002) IMPLICIT INTERVAL MULTISTEP METHODS FOR SOLVING THE INITIAL VALUE PROBLEM MAŁGORZATA JANKOWSKA 1, ANDRZEJ MARCINIAK 1,2 1 Poznań University
More informationImproved Starting Methods for Two-Step Runge Kutta Methods of Stage-Order p 3
Improved Starting Methods for Two-Step Runge Kutta Methods of Stage-Order p 3 J.H. Verner August 3, 2004 Abstract. In [5], Jackiewicz and Verner derived formulas for, and tested the implementation of two-step
More informationONE- AND TWO-STAGE IMPLICIT INTERVAL METHODS OF RUNGE-KUTTA TYPE
COMPUTATIONAL METHODS IN SCIENCE AND TECHNOLOGY 5,53-65 (1999) ONE- AND TWO-STAGE IMPLICIT INTERVAL METHODS OF RUNGE-KUTTA TYPE ANDRZEJ MARCINIAK 1, BARBARA SZYSZKA 2 1 Institute of Computing Science,
More informationNumerical Integration (Quadrature) Another application for our interpolation tools!
Numerical Integration (Quadrature) Another application for our interpolation tools! Integration: Area under a curve Curve = data or function Integrating data Finite number of data points spacing specified
More informationTHREE- AND FOUR-STAGE IMPLICIT INTERVAL METHODS OF RUNGE-KUTTA TYPE
COMPUTATIONAL METHODS IN SCIENCE AND TECHNOLOGY 6, 41-59 (2000) THREE- AND FOUR-STAGE IMPLICIT INTERVAL METHODS OF RUNGE-KUTTA TYPE KAROL GAJDA 1, ANDRZEJ MARCINIAK 2, BARBARA SZYSZKA 1 1 Institute of
More informationWorld's largest Science, Technology & Medicine Open Access book publisher
PUBLISHED BY World's largest Science, Technology & Medicine Open Access book publisher 2750+ OPEN ACCESS BOOKS 95,000+ INTERNATIONAL AUTHORS AND EDITORS 88+ MILLION DOWNLOADS BOOKS DELIVERED TO 5 COUNTRIES
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 information369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 2017 pp
369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 27 pp. 369-374 Original Research Article THIRD DERIVATIVE MULTISTEP METHODS WITH OPTIMIZED REGIONS OF ABSOLUTE STABILITY FOR
More informationFour Point Gauss Quadrature Runge Kuta Method Of Order 8 For Ordinary Differential Equations
International journal of scientific and technical research in engineering (IJSTRE) www.ijstre.com Volume Issue ǁ July 206. Four Point Gauss Quadrature Runge Kuta Method Of Order 8 For Ordinary Differential
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 informationUniversity of Alberta ENGM 541: Modeling and Simulation of Engineering Systems Laboratory #5
University of Alberta ENGM 54: Modeling and Simulation of Engineering Systems Laboratory #5 M.G. Lipsett, Updated 00 Integration Methods with Higher-Order Truncation Errors with MATLAB MATLAB is capable
More informationMathematical Methods for Numerical Analysis and Optimization
Biyani's Think Tank Concept based notes Mathematical Methods for Numerical Analysis and Optimization (MCA) Varsha Gupta Poonam Fatehpuria M.Sc. (Maths) Lecturer Deptt. of Information Technology Biyani
More informationA New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations
A New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations Rei-Wei Song and Ming-Gong Lee* d09440@chu.edu.tw, mglee@chu.edu.tw * Department of Applied Mathematics/
More informationmultistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):
MATH 351 Fall 217 multistep methods http://www.phys.uconn.edu/ rozman/courses/m351_17f/ Last modified: November 28, 217 Recall that we are interested in the numerical solution of the initial value problem
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationTHE θ-methods IN THE NUMERICAL SOLUTION OF DELAY DIFFERENTIAL EQUATIONS. Karel J. in t Hout, Marc N. Spijker Leiden, The Netherlands
THE θ-methods IN THE NUMERICAL SOLUTION OF DELAY DIFFERENTIAL EQUATIONS Karel J. in t Hout, Marc N. Spijker Leiden, The Netherlands 1. Introduction This paper deals with initial value problems for delay
More informationA NOTE ON EXPLICIT THREE-DERIVATIVE RUNGE-KUTTA METHODS (ThDRK)
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 303-4874 (p), ISSN (o) 303-4955 www.imvibl.org / JOURNALS / BULLETIN Vol. 5(015), 65-7 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationSection 5.3 The Newton Form of the Interpolating Polynomial
Section 5.3 The Newton Form of the Interpolating Polynomial Key terms Divided Difference basis Add-on feature Divided Difference Table The Lagrange form is not very efficient if we have to evaluate the
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 informationError formulas for divided difference expansions and numerical differentiation
Error formulas for divided difference expansions and numerical differentiation Michael S. Floater Abstract: We derive an expression for the remainder in divided difference expansions and use it to give
More informationFourth Order RK-Method
Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)
More informationProblem Set 9 Solutions
8.4 Problem Set 9 Solutions Total: 4 points Problem : Integrate (a) (b) d. ( 4 + 4)( 4 + 5) d 4. Solution (4 points) (a) We use the method of partial fractions to write A B (C + D) = + +. ( ) ( 4 + 5)
More informationNumerical Mathematics & Computing, 7 Ed. 4.1 Interpolation
Numerical Mathematics & Computing, 7 Ed. 4.1 Interpolation Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole www.engage.com www.ma.utexas.edu/cna/nmc6 November 7, 2011 2011 1 /
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 informationSolving scalar IVP s : Runge-Kutta Methods
Solving scalar IVP s : Runge-Kutta Methods Josh Engwer Texas Tech University March 7, NOTATION: h step size x n xt) t n+ t + h x n+ xt n+ ) xt + h) dx = ft, x) SCALAR IVP ASSUMED THROUGHOUT: dt xt ) =
More information9.6 Predictor-Corrector Methods
SEC. 9.6 PREDICTOR-CORRECTOR METHODS 505 Adams-Bashforth-Moulton Method 9.6 Predictor-Corrector Methods The methods of Euler, Heun, Taylor, and Runge-Kutta are called single-step methods because they use
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 information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationAP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period:
WORKSHEET: Series, Taylor Series AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period: 1 Part I. Multiple-Choice Questions (5 points each; please circle the correct answer.) 1. The
More informationLet s Get Series(ous)
Department of Mathematics, Computer Science, and Statistics Bloomsburg University Bloomsburg, Pennsylvania 785 Let s Get Series(ous) Summary Presenting infinite series can be (used to be) a tedious and
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 informationExample - Newton-Raphson Method
Eample - Newton-Raphson Method We now consider the following eample: minimize f( 3 3 + -- 4 4 Since f ( 3 2 + 3 3 and f ( 6 + 9 2 we form the following iteration: + n 3 ( n 3 3( n 2 ------------------------------------
More informationExtended Runge Kutta-like formulae
Applied Numerical Mathematics 56 006 584 605 www.elsevier.com/locate/apnum Extended Runge Kutta-like formulae Xinyuan Wu a Jianlin Xia b a State Key Laboratory for Novel Software Technology Department
More informationApplication of modified Leja sequences to polynomial interpolation
Special Issue for the years of the Padua points, Volume 8 5 Pages 66 74 Application of modified Leja sequences to polynomial interpolation L. P. Bos a M. Caliari a Abstract We discuss several applications
More informationAdaptive nested implicit Runge Kutta formulas of Gauss type
Applied Numerical Mathematics 59 (9) 77 7 www.elsevier.com/locate/apnum Adaptive nested implicit Runge Kutta formulas of Gauss type G.Yu. Kulikov, S.K. Shindin School of Computational and Applied Mathematics,
More informationMATH 2300 review problems for Exam 3 ANSWERS
MATH 300 review problems for Eam 3 ANSWERS. Check whether the following series converge or diverge. In each case, justif our answer b either computing the sum or b b showing which convergence test ou are
More informationConsistency and Convergence
Jim Lambers MAT 77 Fall Semester 010-11 Lecture 0 Notes These notes correspond to Sections 1.3, 1.4 and 1.5 in the text. Consistency and Convergence We have learned that the numerical solution obtained
More informationReal Analysis Math 125A, Fall 2012 Final Solutions
Real Analysis Math 25A, Fall 202 Final Solutions. (a) Suppose that f : [0, ] R is continuous on the closed, bounded interval [0, ] and f() > 0 for every 0. Prove that the reciprocal function /f : [0, ]
More informationResearch Article P-Stable Higher Derivative Methods with Minimal Phase-Lag for Solving Second Order Differential Equations
Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2011, Article ID 407151, 15 pages doi:10.1155/2011/407151 Research Article P-Stable Higher Derivative Methods with Minimal Phase-Lag
More informationLecture 4.2 Finite Difference Approximation
Lecture 4. Finite Difference Approimation 1 Discretization As stated in Lecture 1.0, there are three steps in numerically solving the differential equations. They are: 1. Discretization of the domain by
More informationThis theorem guarantees solutions to many problems you will encounter. exists, then f ( c)
Maimum and Minimum Values Etreme Value Theorem If f () is continuous on the closed interval [a, b], then f () achieves both a global (absolute) maimum and global minimum at some numbers c and d in [a,
More informationEigenvalues of Trusses and Beams Using the Accurate Element Method
Eigenvalues of russes and Beams Using the Accurate Element Method Maty Blumenfeld Department of Strength of Materials Universitatea Politehnica Bucharest, Romania Paul Cizmas Department of Aerospace Engineering
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 informationStarting Methods for Two-Step Runge Kutta Methods of Stage-Order 3 and Order 6
Cambridge International Science Publishing Cambridge CB1 6AZ Great Britain Journal of Computational Methods in Sciences and Engineering vol. 2, no. 3, 2, pp. 1 3 ISSN 1472 7978 Starting Methods for Two-Step
More informationChapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary
More informationSYMMETRY REDUCTION AND NUMERICAL SOLUTION OF A THIRD-ORDER ODE FROM THIN FILM FLOW
Mathematical and Computational Applications,Vol. 15, No. 4, pp. 709-719, 2010. c Association for Scientific Research SYMMETRY REDUCTION AND NUMERICAL SOLUTION OF A THIRD-ORDER ODE FROM THIN FILM FLOW E.
More informationThe stationary points will be the solutions of quadratic equation x
Calculus 1 171 Review In Problems (1) (4) consider the function f ( ) ( ) e. 1. Find the critical (stationary) points; establish their character (relative minimum, relative maimum, or neither); find intervals
More informationB.Tech. Theory Examination (Semester IV) Engineering Mathematics III
Solved Question Paper 5-6 B.Tech. Theory Eamination (Semester IV) 5-6 Engineering Mathematics III Time : hours] [Maimum Marks : Section-A. Attempt all questions of this section. Each question carry equal
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 information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
740 Chapter 16. Integration of Ordinary Differential Equations 16.7 Multistep, Multivalue, and Predictor-Corrector Methods The terms multistepand multivaluedescribe two different ways of implementing essentially
More informationarxiv:math-ph/ v1 10 Jan 2005
Asymptotic and eact series representations for the incomplete Gamma function arxiv:math-ph/5119v1 1 Jan 5 Paolo Amore Facultad de Ciencias, Universidad de Colima, Bernal Díaz del Castillo 34, Colima, Colima,
More informationDevelopment of a New One-Step Scheme for the Solution of Initial Value Problem (IVP) in Ordinary Differential Equations
International Journal of Theoretical and Applied Mathematics 2017; 3(2): 58-63 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20170302.12 Development of a New One-Step Scheme for the
More informationCourse code: 8D020. Date: Wednesday April 11, Time: 09h00 12h00. Place: MA Read this first!
EEXAMINATION MATHEMATICAL TECHNIQUES FO IMAGE ANALYSIS Course code: 8D00. Date: Wednesday April, 0. Time: 09h00 h00. Place: MA.46. ead this first! Write your name and student ID on each paper. The eam
More informationInterpolation and the Lagrange Polynomial
Interpolation and the Lagrange Polynomial MATH 375 J. Robert Buchanan Department of Mathematics Fall 2013 Introduction We often choose polynomials to approximate other classes of functions. Theorem (Weierstrass
More informationCOMPUTATIONAL METHODS AND ALGORITHMS Vol. I - Numerical Analysis and Methods for Ordinary Differential Equations - N.N. Kalitkin, S.S.
NUMERICAL ANALYSIS AND METHODS FOR ORDINARY DIFFERENTIAL EQUATIONS N.N. Kalitkin Institute for Mathematical Modeling, Russian Academy of Sciences, Moscow, Russia S.S. Filippov Keldysh Institute of Applied
More informationEpsilon Delta proofs
Epsilon Delta proofs Before reading this guide, please go over inequalities (if needed). Eample Prove lim(4 3) = 5 2 First we have to know what the definition of a limit is: i.e rigorous way of saying
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 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 information3 Interpolation and Polynomial Approximation
CHAPTER 3 Interpolation and Polynomial Approximation Introduction A census of the population of the United States is taken every 10 years. The following table lists the population, in thousands of people,
More informationSolution of First Order Initial Value Problem by Sixth Order Predictor Corrector Method
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 6 (2017), pp. 2277 2290 Research India Publications http://www.ripublication.com/gjpam.htm Solution of First Order Initial
More informationInvestigation on the Most Efficient Ways to Solve the Implicit Equations for Gauss Methods in the Constant Stepsize Setting
Applied Mathematical Sciences, Vol. 12, 2018, no. 2, 93-103 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.711340 Investigation on the Most Efficient Ways to Solve the Implicit Equations
More informationA NUMERICAL STUDY FOR THE PERFORMANCE OF THE RUNGE-KUTTA FINITE DIFFERENCE METHOD BASED ON DIFFERENT NUMERICAL HAMILTONIANS
A NUMERICAL STUDY FOR THE PERFORMANCE OF THE RUNGE-KUTTA FINITE DIFFERENCE METHOD BASED ON DIFFERENT NUMERICAL HAMILTONIANS HASEENA AHMED AND HAILIANG LIU Abstract. High resolution finite difference methods
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 informationApplied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight
Applied Numerical Analysis (AE0-I) R. Klees and R.P. Dwight February 018 Contents 1 Preliminaries: Motivation, Computer arithmetic, Taylor series 1 1.1 Numerical Analysis Motivation..........................
More information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
16.7 Multistep, Multivalue, and Predictor-Corrector Methods 747 } free_vector(ysav,1,nv); free_vector(yerr,1,nv); free_vector(x,1,kmaxx); free_vector(err,1,kmaxx); free_matrix(dfdy,1,nv,1,nv); free_vector(dfdx,1,nv);
More informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
More 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 informationDefinition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.
8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections.6 and.) 8. Equivalent Inequalities Definition 8. Two inequalities are equivalent
More informationA SYMBOLIC-NUMERIC APPROACH TO THE SOLUTION OF THE BUTCHER EQUATIONS
CANADIAN APPLIED MATHEMATICS QUARTERLY Volume 17, Number 3, Fall 2009 A SYMBOLIC-NUMERIC APPROACH TO THE SOLUTION OF THE BUTCHER EQUATIONS SERGEY KHASHIN ABSTRACT. A new approach based on the use of new
More informationEfficient path tracking methods
Efficient path tracking methods Daniel J. Bates Jonathan D. Hauenstein Andrew J. Sommese April 21, 2010 Abstract Path tracking is the fundamental computational tool in homotopy continuation and is therefore
More informationAP Exam Practice Questions for Chapter 3
AP Eam Practice Questions for Chapter AP Eam Practice Questions for Chapter f + 6 7 9 f + 7 0 + 6 0 ( + )( ) 0,. The critical numbers of f are and. So, the answer is B.. Evaluate each statement. I: Because
More informationMultistage Methods I: Runge-Kutta Methods
Multistage Methods I: Runge-Kutta Methods Varun Shankar January, 0 Introduction Previously, we saw that explicit multistep methods (AB methods) have shrinking stability regions as their orders are increased.
More informationRecurring Decimals. Mathswatch. Clip ) a) Convert the recurring decimal 036. to a fraction in its simplest form.
Clip Recurring Decimals ) a) Convert the recurring decimal 06. to a fraction in its simplest form. 8 b) Prove that the recurring decimal 07. = ) a) Change 4 9 to a decimal. 9 b) Prove that the recurring
More informationSOLVING QUADRATICS. Copyright - Kramzil Pty Ltd trading as Academic Teacher Resources
SOLVING QUADRATICS Copyright - Kramzil Pty Ltd trading as Academic Teacher Resources SOLVING QUADRATICS General Form: y a b c Where a, b and c are constants To solve a quadratic equation, the equation
More informationThe numerical stability of barycentric Lagrange interpolation
IMA Journal of Numerical Analysis (2004) 24, 547 556 The numerical stability of barycentric Lagrange interpolation NICHOLAS J. HIGHAM Department of Mathematics, University of Manchester, Manchester M13
More information(a) Show that there is a root α of f (x) = 0 in the interval [1.2, 1.3]. (2)
. f() = 4 cosec 4 +, where is in radians. (a) Show that there is a root α of f () = 0 in the interval [.,.3]. Show that the equation f() = 0 can be written in the form = + sin 4 Use the iterative formula
More informationComparative numerical solutions of stiff ordinary differential equations using Magnus series expansion method
NTMSCI, No. 1, 5-45 (215) 5 New Trends in Mathematical Sciences http://www.ntmsci.com Comparative numerical solutions of stiff ordinary differential equations using Magnus series expansion method Mehmet
More informationINTRODUCTION TO COMPUTER METHODS FOR O.D.E.
INTRODUCTION TO COMPUTER METHODS FOR O.D.E. 0. Introduction. The goal of this handout is to introduce some of the ideas behind the basic computer algorithms to approximate solutions to differential equations.
More informationTaylor series based nite dierence approximations of higher-degree derivatives
Journal of Computational and Applied Mathematics 54 (3) 5 4 www.elsevier.com/locate/cam Taylor series based nite dierence approximations of higher-degree derivatives Ishtiaq Rasool Khan a;b;, Ryoji Ohba
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 informationarxiv: v1 [stat.ot] 6 Apr 2017
A Mathematically Sensible Explanation of the Concept of Statistical Population Yiping Cheng Beijing Jiaotong University, China ypcheng@bjtu.edu.cn arxiv:1704.01732v1 [stat.ot] 6 Apr 2017 Abstract In statistics
More informationA Reverse Technique for Lumping High Dimensional Model Representation Method
A Reverse Technique for Lumping High Dimensional Model Representation Method M. ALPER TUNGA Bahçeşehir University Department of Software Engineering Beşiktaş, 34349, İstanbul TURKEY TÜRKİYE) alper.tunga@bahcesehir.edu.tr
More informationSolving systems of ODEs with Matlab
Solving systems of ODEs with Matlab James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 20, 2013 Outline 1 Systems of ODEs 2 Setting Up
More informationAPPLICATIONS OF DIFFERENTIATION
4 APPLICATIONS OF DIFFERENTIATION APPLICATIONS OF DIFFERENTIATION 4.8 Newton s Method In this section, we will learn: How to solve high degree equations using Newton s method. INTRODUCTION Suppose that
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 informationReducing round-off errors in symmetric multistep methods
Reducing round-off errors in symmetric multistep methods Paola Console a, Ernst Hairer a a Section de Mathématiques, Université de Genève, 2-4 rue du Lièvre, CH-1211 Genève 4, Switzerland. (Paola.Console@unige.ch,
More informationERROR IN LINEAR INTERPOLATION
ERROR IN LINEAR INTERPOLATION Let P 1 (x) be the linear polynomial interpolating f (x) at x 0 and x 1. Assume f (x) is twice continuously differentiable on an interval [a, b] which contains the points
More informationMath 1B, lecture 15: Taylor Series
Math B, lecture 5: Taylor Series Nathan Pflueger October 0 Introduction Taylor s theorem shows, in many cases, that the error associated with a Taylor approximation will eventually approach 0 as the degree
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA2501 Numerical Methods Spring 2015 Solutions to exercise set 7 1 Cf. Cheney and Kincaid, Exercise 4.1.9 Consider the data points
More informationDifferentiation. Table of contents Definition Arithmetics Composite and inverse functions... 5
Differentiation Table of contents. Derivatives................................................. 2.. Definition................................................ 2.2. Arithmetics...............................................
More informationOn the stability regions of implicit linear multistep methods
On the stability regions of implicit linear multistep methods arxiv:1404.6934v1 [math.na] 8 Apr 014 Lajos Lóczi April 9, 014 Abstract If we apply the accepted definition to determine the stability region
More information