Module 10.2: nag nlin eqn Roots of a Single Nonlinear Equation. Contents
|
|
- Dylan Small
- 6 years ago
- Views:
Transcription
1 Nonlinear Equations Module Contents Module 10.2: nag nlin eqn Roots of a Single Nonlinear Equation nag nlin eqn provides a procedure for computing a single root of a continuous function in a given interval. Contents Procedures nag nlin eqn sol Finds a solution of a single nonlinear equation Examples Example 1: Solution of a single transcendental equation Additional Examples References [NP3245/3/pdf] Module 10.2: nag nlin eqn
2 Module Contents Nonlinear Equations Module 10.2: nag nlin eqn [NP3245/3/pdf]
3 Nonlinear Equations nag nlin eqn sol Procedure: nag nlin eqn sol 1 Description nag nlin eqn sol attempts to obtain an approximation to a simple root of the continuous function f(x) given an initial interval [a, b] such that f(a) f(b) 0. This condition implies that there is at least one root of f in the interval [a, b]. The procedure combines the methods of bisection, linear interpolation and linear extrapolation (see Dahlquist and Björck [2]), to find a sequence of subintervals [a i,b i ] of the initial interval such that the final interval contains the root. The approximation, x, totheroot, α, is such that one or both of the following criteria are satisfied: x α < x tol, f(x) < f tol. Since the intervals [a i,b i ] are determined only so that f(a i ) f(b i ) 0, it is possible that the final interval may contain a discontinuity or a pole of f (violating the requirement that f be continuous). This procedure also checks if the sign change is likely to correspond to a pole of f. 2 Usage USE nag nlin eqn CALL nag nlin eqn sol(f, x, a, b [, optional arguments]) 3 A rguments 3.1 Mandatory Arguments f function f must evaluate the function f at the point x. function f(x) real(kind=wp), intent(in) :: x Input: the point x at which the function must be evaluated. real(kind=wp) :: f Result: the value of the function at the point x. x real(kind=wp), intent(out) Output: the approximation to the root. a real(kind=wp), intent(in) b real(kind=wp), intent(in) Input: the lower bound, a, and the upper bound, b, oftheinterval. Constraints: a b, f(a) f(b) 0. [NP3245/3/pdf] Module 10.2: nag nlin eqn
4 nag nlin eqn sol Nonlinear Equations 3.2 Optional Arguments Note. Optional arguments must be supplied by keyword, not by position. The order in which they are described below may differ from the order in which they occur in the argument list. x tol real(kind=wp), intent(in), optional Input: the absolute tolerance to which the root is required (see Section 1). Constraints: x tol > 0.0. Default: x tol = SQRT(EPSILON(1.0 wp)). f tol real(kind=wp), intent(in), optional Input: a value such that if f(x) < f tol, x is accepted as the root (see Section 6.2). Constraints: f tol 0.0. Default: f tol =0.0. error type(nagerror), intent(inout), optional The NAG fl 90 error-handling argument. See the Essential Introduction, or the module document nag error handling (1.2). You are recommended to omit this argument if you are unsure how to use it. If this argument is supplied, it must be initialized by a call to nag set error before this procedure is called. 4 Error Codes Fatal errors (error%level = 3): error%code Description 301 An input argument has an invalid value. 399 An unexpected Library error. Check all procedure calls. If you cannot find any error in your calling program, please report this error to NAG. Failures (error%level = 2): error%code Description 201 f(x) changes sign at a pole. A change in sign of f(x) has been determined as occurring near the point defined by the final value of x. There is some evidence that this sign change corresponds to a pole of f(x). Warnings (error%level = 1): error%code Description 101 Too much accuracy requested. x tol is too small for the computer being used. The final value of x is an accurate approximation to the root. 5 Examples of Usage A complete example of the use of this procedure appears in Example 1 of this module document Module 10.2: nag nlin eqn [NP3245/3/pdf]
5 Nonlinear Equations nag nlin eqn sol 6 Further Comments 6.1 Algorithmic Detail This procedure is a modified version of procedure ZEROIN given in Bus and Dekker [1]. 6.2 Accuracy This depends on the values of x tol and f tol. If full machine accuracy is required, x tol and f tol may be set very small, resulting in an error exit with error%code = 101. This may involve more iterations than are required for a less accurate solution. You should use x tol to control the accuracy (with the default value for f tol) unless you have considerable knowledge of the size of f(x) for values of x near the root. [NP3245/3/pdf] Module 10.2: nag nlin eqn
6 nag nlin eqn sol Nonlinear Equations Module 10.2: nag nlin eqn [NP3245/3/pdf]
7 Nonlinear Equations Example 1 Example 1: Solution of a single transcendental equation To calculate the root of e x x within the interval [0,1]. 1 Program Text Note. The listing of the example program presented below is double precision. Single precision users are referred to Section 5.2 of the Essential Introduction for further information. MODULE nlin_eqn_ex01_mod!.. Implicit None Statement.. IMPLICIT NONE!.. Intrinsic Functions.. INTRINSIC KIND!.. Parameters.. INTEGER, PARAMETER :: wp = KIND(1.0D0) CONTAINS FUNCTION f(x)!.. Implicit None Statement.. IMPLICIT NONE!.. Intrinsic Functions.. INTRINSIC EXP!.. Scalar Arguments.. REAL (wp), INTENT (IN) :: x!.. Function Return Value.. REAL (wp) :: f!.. Executable Statements.. f = EXP(-x) - x END FUNCTION f END MODULE nlin_eqn_ex01_mod PROGRAM nag_nlin_eqn_ex01! Example Program Text for nag_nlin_eqn! NAG fl90, Release 3. NAG Copyright 1997.!.. Use Statements.. USE nag_examples_io, ONLY : nag_std_out USE nag_nlin_eqn, ONLY : nag_nlin_eqn_sol USE nlin_eqn_ex01_mod, ONLY : f, wp!.. Implicit None Statement.. IMPLICIT NONE!.. Local Scalars.. REAL (wp) :: a, b, x!.. Executable Statements.. WRITE (nag_std_out,*) Example Program Results for nag_nlin_eqn_ex01 a = 0.0_wp b = 1.0_wp! Find a zero of the function in the interval [a,b] CALL nag_nlin_eqn_sol(f,x,a,b) [NP3245/3/pdf] Module 10.2: nag nlin eqn
8 Example 1 Nonlinear Equations WRITE (nag_std_out, (/,1X,A,F12.5) ) Zero =, x END PROGRAM nag_nlin_eqn_ex01 2 Program Data None. 3 Program Results Example Program Results for nag_nlin_eqn_ex01 Zero = Module 10.2: nag nlin eqn [NP3245/3/pdf]
9 Nonlinear Equations Additional Examples Additional Examples Not all example programs supplied with NAG fl 90 appear in full in this module document. The following additional examples, associated with this module, are available. nag nlin eqn ex02 Solution of a single transcendental equation, with user-supplied x tol. [NP3245/3/pdf] Module 10.2: nag nlin eqn
10 References Nonlinear Equations References [1] Bus J C P and Dekker T J (1975) Two efficient algorithms with guaranteed convergence for finding a zero of a function ACM Trans. Math. Software [2] Dahlquist G and Björck Å (1974) Numerical Methods Prentice-Hall Module 10.2: nag nlin eqn [NP3245/3/pdf]
Module 10.1: nag polynom eqn Roots of Polynomials. Contents
Nonlinear Equations Module Contents Module 10.1: nag polynom eqn Roots of Polynomials nag polynom eqn provides a procedure for computing the roots of a polynomial with real or complex coefficients. Contents
More informationModule 3.9: nag kelvin fun Kelvin Functions. Contents
Special Functions Module Contents Module 3.9: nag kelvin fun Kelvin Functions nag kelvin fun contains procedures for approximating Kelvin functions. Contents Introduction... 3.9.3 Procedures nag kelvin
More informationModule 5.2: nag sym lin sys Symmetric Systems of Linear Equations. Contents
Linear Equations Module Contents Module 5.2: nag sym lin sys Symmetric Systems of Linear Equations nag sym lin sys provides a procedure for solving real or complex, symmetric or Hermitian systems of linear
More informationModule 6.6: nag nsym gen eig Nonsymmetric Generalized Eigenvalue Problems. Contents
Eigenvalue and Least-squares Problems Module Contents Module 6.6: nag nsym gen eig Nonsymmetric Generalized Eigenvalue Problems nag nsym gen eig provides procedures for solving nonsymmetric generalized
More informationModule 29.3: nag tsa spectral Time Series Spectral Analysis. Contents
Time Series Analysis Module Contents Module 29.3: nag tsa spectral Time Series Spectral Analysis nag tsa spectral calculates the smoothed sample spectrum of a univariate and bivariate time series. Contents
More informationModule 11.4: nag quad util Numerical Integration Utilities. Contents
Qudrture Module Contents Module 11.4: ng qud util Numericl Integrtion Utilities ng qud util provides utility procedures for computtion involving integrtion of functions, e.g., the computtion of the weights
More informationChapter 2 Solutions of Equations of One Variable
Chapter 2 Solutions of Equations of One Variable 2.1 Bisection Method In this chapter we consider one of the most basic problems of numerical approximation, the root-finding problem. This process involves
More informationD03PEF NAG Fortran Library Routine Document
D03 Partial Differential Equations D03PEF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised
More informationF04JGF NAG Fortran Library Routine Document
F4 Simultaneous Linear Equations F4JGF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised
More informationComments on An Improvement to the Brent s Method
Comments on An Improvement to the Brent s Method Steven A. Stage IEM 8550 United Plaza Boulevard, Suite 501 Baton Rouge, Louisiana 70808-000, United States of America steve.stage@iem.com Abstract Zhang
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 informationSOLVING EQUATIONS OF ONE VARIABLE
1 SOLVING EQUATIONS OF ONE VARIABLE ELM1222 Numerical Analysis Some of the contents are adopted from Laurene V. Fausett, Applied Numerical Analysis using MATLAB. Prentice Hall Inc., 1999 2 Today s lecture
More informationD02TYF NAG Fortran Library Routine Document
D02TYF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationNAG Library Routine Document F08JDF (DSTEVR)
F08 Least-squares and Eigenvalue Problems (LAPACK) NAG Library Routine Document (DSTEVR) Note: before using this routine, please read the Users Note for your implementation to check the interpretation
More informationNAG Fortran Library Routine Document D02JAF.1
D02 Ordinary Differential Equations NAG Fortran Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised
More informationNAG Library Routine Document F08UBF (DSBGVX)
NAG Library Routine Document (DSBGVX) Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationNAG Library Routine Document F08FPF (ZHEEVX)
NAG Library Routine Document (ZHEEVX) Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationNAG Library Routine Document D02JAF.1
D02 Ordinary Differential Equations NAG Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms
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 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 informationNAG Library Routine Document F08FAF (DSYEV)
NAG Library Routine Document (DSYEV) Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
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 informationNAG Library Routine Document C02AGF.1
NAG Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationNAG Library Routine Document F08PNF (ZGEES)
F08 Least-squares and Eigenvalue Problems (LAPACK) F08PNF NAG Library Routine Document F08PNF (ZGEES) Note: before using this routine, please read the Users Note for your implementation to check the interpretation
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 informationSolutions of Equations in One Variable. Newton s Method
Solutions of Equations in One Variable Newton s Method Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011 Brooks/Cole,
More informationNAG Library Routine Document F07HAF (DPBSV)
NAG Library Routine Document (DPBSV) Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationScientific Computing. Roots of Equations
ECE257 Numerical Methods and Scientific Computing Roots of Equations Today s s class: Roots of Equations Bracketing Methods Roots of Equations Given a function f(x), the roots are those values of x that
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 informationNonlinear Equations and Continuous Optimization
Nonlinear Equations and Continuous Optimization Sanzheng Qiao Department of Computing and Software McMaster University March, 2014 Outline 1 Introduction 2 Bisection Method 3 Newton s Method 4 Systems
More informationNAG Library Routine Document F08QUF (ZTRSEN)
F08 Least-squares and Eigenvalue Problems (LAPACK) F08QUF NAG Library Routine Document F08QUF (ZTRSEN) Note: before using this routine, please read the Users Note for your implementation to check the interpretation
More informationNAG Library Routine Document F08FNF (ZHEEV).1
NAG Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationINTRODUCTION, FOUNDATIONS
1 INTRODUCTION, FOUNDATIONS ELM1222 Numerical Analysis Some of the contents are adopted from Laurene V. Fausett, Applied Numerical Analysis using MATLAB. Prentice Hall Inc., 1999 2 Today s lecture Information
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 informationNonlinear Equations. Chapter The Bisection Method
Chapter 6 Nonlinear Equations Given a nonlinear function f(), a value r such that f(r) = 0, is called a root or a zero of f() For eample, for f() = e 016064, Fig?? gives the set of points satisfying y
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 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 informationTHE SECANT METHOD. q(x) = a 0 + a 1 x. with
THE SECANT METHOD Newton s method was based on using the line tangent to the curve of y = f (x), with the point of tangency (x 0, f (x 0 )). When x 0 α, the graph of the tangent line is approximately the
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 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 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 informationUNCONSTRAINED OPTIMIZATION
UNCONSTRAINED OPTIMIZATION 6. MATHEMATICAL BASIS Given a function f : R n R, and x R n such that f(x ) < f(x) for all x R n then x is called a minimizer of f and f(x ) is the minimum(value) of f. We wish
More information[k,g,gfin] = hinfsyn(p,nmeas,ncon,gmin,gmax,tol)
8 H Controller Synthesis: hinfsyn The command syntax is k,g,gfin = hinfsyn(p,nmeas,ncon,gmin,gmax,tol) associated with the general feedback diagram below. e y P d u e G = F L (P, K) d K hinfsyn calculates
More informationDiscontinuous Distributions in Mechanics of Materials
Discontinuous Distributions in Mechanics of Materials J.E. Akin, Rice University 1. Introduction The study of the mechanics of materials continues to change slowly. The student needs to learn about software
More informationG01NBF NAG Fortran Library Routine Document
G01NBF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationToday s class. Numerical differentiation Roots of equation Bracketing methods. Numerical Methods, Fall 2011 Lecture 4. Prof. Jinbo Bi CSE, UConn
Today s class Numerical differentiation Roots of equation Bracketing methods 1 Numerical Differentiation Finite divided difference First forward difference First backward difference Lecture 3 2 Numerical
More informationLine Search Methods. Shefali Kulkarni-Thaker
1 BISECTION METHOD Line Search Methods Shefali Kulkarni-Thaker Consider the following unconstrained optimization problem min f(x) x R Any optimization algorithm starts by an initial point x 0 and performs
More informationPractical Information
MA2501 Numerical Methods Spring 2018 Norwegian University of Science and Technology Department of Mathematical Sciences Semester Project Practical Information This project counts for 30 % of the final
More informationNAG Toolbox for Matlab. g08cd.1
G08 Nonparametric Statistics NAG Toolbox for Matlab 1 Purpose performs the two sample Kolmogorov Smirnov distribution test. 2 Syntax [d, z, p, sx, sy, ifail] = (x, y, ntype, n1, n1, n2, n2) 3 Description
More informationNAG Fortran Library Routine Document F04CFF.1
F04 Simultaneous Linear Equations NAG Fortran Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised
More informationNAG Library Routine Document F08VAF (DGGSVD)
NAG Library Routine Document (DGGSVD) Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
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 informationF08BEF (SGEQPF/DGEQPF) NAG Fortran Library Routine Document
NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationG13CCF NAG Fortran Library Routine Document
G13 Time Series Analysis G13CCF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms
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 informationNAG Library Routine Document F02HDF.1
F02 Eigenvalues and Eigenvectors NAG Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and
More informationComputational Methods for Engineers Programming in Engineering Problem Solving
Computational Methods for Engineers Programming in Engineering Problem Solving Abu Hasan Abdullah January 6, 2009 Abu Hasan Abdullah 2009 An Engineering Problem Problem Statement: The length of a belt
More informationNAG Library Routine Document F08QVF (ZTRSYL)
F8 Least-squares and Eigenvalue Problems (LAPAK) F8QVF NAG Library Routine Document F8QVF (ZTRSYL) Note: before using this routine, please read the Users Note for your implementation to check the interpretation
More informationExtended Introduction to Computer Science CS1001.py. Lecture 8 part A: Finding Zeroes of Real Functions: Newton Raphson Iteration
Extended Introduction to Computer Science CS1001.py Lecture 8 part A: Finding Zeroes of Real Functions: Newton Raphson Iteration Instructors: Benny Chor, Amir Rubinstein Teaching Assistants: Yael Baran,
More information15 Nonlinear Equations and Zero-Finders
15 Nonlinear Equations and Zero-Finders This lecture describes several methods for the solution of nonlinear equations. In particular, we will discuss the computation of zeros of nonlinear functions f(x).
More informationMAT 275 Laboratory 4 MATLAB solvers for First-Order IVP
MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP In this laboratory session we will learn how to. Use MATLAB solvers for solving scalar IVP 2. Use MATLAB solvers for solving higher order ODEs and
More informationG12MAN Mathematical Analysis Fully-justified answers to Revision Quiz questions
G12MAN Mathematical Analysis Fully-justified answers to Revision Quiz questions Remember that, unless otherwise specified or not applicable for some reason), you MUST justify your answers to questions
More informationMAT 275 Laboratory 4 MATLAB solvers for First-Order IVP
MATLAB sessions: Laboratory 4 MAT 275 Laboratory 4 MATLAB solvers for First-Order IVP In this laboratory session we will learn how to. Use MATLAB solvers for solving scalar IVP 2. Use MATLAB solvers for
More informationNumerical Integration
Numerical Integration Sanzheng Qiao Department of Computing and Software McMaster University February, 2014 Outline 1 Introduction 2 Rectangle Rule 3 Trapezoid Rule 4 Error Estimates 5 Simpson s Rule 6
More informationG03ACF NAG Fortran Library Routine Document
G03 Multivariate Methods G03ACF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms
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 informationMAT 275 Laboratory 4 MATLAB solvers for First-Order IVP
MAT 75 Laboratory 4 MATLAB solvers for First-Order IVP In this laboratory session we will learn how to. Use MATLAB solvers for solving scalar IVP. Use MATLAB solvers for solving higher order ODEs and systems
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 1.4.2, 1.4.4, 1.4.9, 1.4.11,
More informationSECTION 1. Introduction to MD NASTRAN SOL 400
SECTION 1 Introduction to MD NASTRAN SOL 400 S1-1 S1-2 What is "MD NASTRAN"? Evolution of engineering challenges: Complex systems vs. "just parts" Interacting environments Disparate tools and databases
More informationSingle Variable Minimization
AA222: MDO 37 Sunday 1 st April, 2012 at 19:48 Chapter 2 Single Variable Minimization 2.1 Motivation Most practical optimization problems involve many variables, so the study of single variable minimization
More information6.3 METHODS FOR ADVANCED MATHEMATICS, C3 (4753) A2
6.3 METHODS FOR ADVANCED MATHEMATICS, C3 (4753) A2 Objectives To build on and develop the techniques students have learnt at AS Level, with particular emphasis on the calculus. Assessment Examination (72
More informationNumerical Methods Dr. Sanjeev Kumar Department of Mathematics Indian Institute of Technology Roorkee Lecture No 7 Regula Falsi and Secant Methods
Numerical Methods Dr. Sanjeev Kumar Department of Mathematics Indian Institute of Technology Roorkee Lecture No 7 Regula Falsi and Secant Methods So welcome to the next lecture of the 2 nd unit of this
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More informationIf you like us, please share us on social media. The latest UCD Hyperlibrary newsletter is now complete, check it out.
Sign In Forgot Password Register username username password password Sign In If you like us, please share us on social media. The latest UCD Hyperlibrary newsletter is now complete, check it out. ChemWiki
More informationG13BAF NAG Fortran Library Routine Document
G13BAF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationDelay Differential Equations Part II: Time and State dependent Lags
Delay Differential Equations Part II: Time and State dependent Lags L.F. Shampine Department of Mathematics Southern Methodist University Dallas, Texas 75275 shampine@smu.edu www.faculty.smu.edu/shampine
More informationG13BHF NAG Fortran Library Routine Document
G13BHF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent
More informationMotor-CAD combined electromagnetic and thermal model (January 2015)
Motor-CAD combined electromagnetic and thermal model (January 2015) Description The Motor-CAD allows the machine performance, losses and temperatures to be calculated for a BPM machine. In this tutorial
More informationG13CGF NAG Fortran Library Routine Document
G13 Time Series Analysis G13CGF NAG Fortran Library Routine Document Note. Before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms
More informationMA 137: Calculus I for the Life Sciences
MA 137: Calculus I for the Life Sciences David Murrugarra Department of Mathematics, University of Kentucky http://www.ms.uky.edu/~ma137/ Spring 2018 David Murrugarra (University of Kentucky) MA 137: Lecture
More informationEDSA IEC 909 SHORT CIRCUIT ANALYSIS
1.0 Tutorial Exercise This tutorial exercise will serve as a validation and verification test for the EDSA IEC 909 short circuit program. The tutorial will be based on two examples documented in the IEC
More informationOn Iterated Numerical Integration
On Iterated Numerical Integration Shujun Li, Elise de Doncker, and Karlis Kaugars Computer Science, Western Michigan University {sli, elise, kkaugars}@cs.wmich.edu http://www.cs.wmich.edu/ parint Abstract.
More information4 Nonlinear Equations
4 Nonlinear Equations lecture 27: Introduction to Nonlinear Equations lecture 28: Bracketing Algorithms The solution of nonlinear equations has been a motivating challenge throughout the history of numerical
More informationNumerical Study of Some Iterative Methods for Solving Nonlinear Equations
International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 5 Issue 2 February 2016 PP.0110 Numerical Study of Some Iterative Methods for Solving Nonlinear
More informationNAG Library Chapter Introduction d02 Ordinary Differential Equations
NAG Library Chapter Introduction d02 Ordinary Differential Equations Contents 1 Scope of the Chapter.... 2 2 Background to the Problems... 2 2.1 Initial Value Problems... 3 2.2 Boundary Value Problems...
More informationNumerical differentiation
Chapter 3 Numerical differentiation 3.1 Introduction Numerical integration and differentiation are some of the most frequently needed methods in computational physics. Quite often we are confronted with
More informationLecture 44. Better and successive approximations x2, x3,, xn to the root are obtained from
Lecture 44 Solution of Non-Linear Equations Regula-Falsi Method Method of iteration Newton - Raphson Method Muller s Method Graeffe s Root Squaring Method Newton -Raphson Method An approximation to the
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 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 informationNAG Library Routine Document F08YUF (ZTGSEN).1
F08 Least-squares and Eigenvalue Problems (LAPACK) NAG Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised
More informationCHAPTER 1: Functions
CHAPTER 1: Functions 1.1: Functions 1.2: Graphs of Functions 1.3: Basic Graphs and Symmetry 1.4: Transformations 1.5: Piecewise-Defined Functions; Limits and Continuity in Calculus 1.6: Combining Functions
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 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 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 informationAIMMS Function Reference - GMPLinearization Procedures and Functions
AIMMS Function Reference - Linearization Procedures and Functions This file contains only one chapter of the book. For a free download of the complete book in pdf format, please visit www.aimms.com Aimms
More informationSection 4.2 The Mean Value Theorem
Section 4.2 The Mean Value Theorem Ruipeng Shen October 2nd Ruipeng Shen MATH 1ZA3 October 2nd 1 / 11 Rolle s Theorem Theorem (Rolle s Theorem) Let f (x) be a function that satisfies: 1. f is continuous
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationBEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations
BEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations Ser Lee Loh a, Wei Sen Loi a a Fakulti Kejuruteraan Elektrik Universiti Teknikal Malaysia Melaka Lesson Outcome Upon completion of this lesson,
More informationFind all points where the function is discontinuous. 1) Find all vertical asymptotes of the given function. x(x - 1) 2) f(x) =
Math 90 Final Review Find all points where the function is discontinuous. ) Find all vertical asymptotes of the given function. x(x - ) 2) f(x) = x3 + 4x Provide an appropriate response. 3) If x 3 f(x)
More information