Computing Gauss-Jacobi quadrature rules
|
|
- Dominick Donald McKinney
- 6 years ago
- Views:
Transcription
1 .... Computing Gauss-Jacobi quadrature rules Alex Townsend Joint work with Nick Hale NA Internal Seminar Trinity Term 2012
2 . Gauss Jacobi Quadrature An n-point Gauss Jacobi quadrature rule: 1 1 w(x)f (x)dx n w k f (x k ) k=1 with w(x) = (1 x) α (1 + x) β, α, β > 1. x k = simple roots of P (α,β) n. w k = C n,α,β [ ] 2, k = 1,..., n. (1 xk 2) P n (α,β) (x k ) Many formulae for the weights: Swarztrauber (2002), Yakimiv (1996).
3 . How many can you compute? How many Gauss Legendre nodes can be computed? Coalescing nodes GLR Newton n By Hand Iterative methods Golub Welsch How Many? Accurate Inaccurate Year
4 . Golub Welsch method A set of Jacobi polynomials satisfy a 3-term recurrence A n P n (x) = (x B n )P n 1 (x) C n P n 2 (x). The zeros of P n (x) are the eigenvalues of the tridiagonal matrix B n C n A n 1 B n 1 C n 1 A n 2 B n 2 C n A 2 B 2 C 2 A 1 B 1. It is a comrade matrix and hence, a strong linearisation (Mackay et al, 2007). It can be made symmetric tridiagonal. Requires O(n 2 ) operations for nodes and weights. Best not to compute weights from eigenvectors.
5 . Glaser Liu Rokhlin method A set of Jacobi polynomials satisfy a second-order differential equation (1 x 2 )P n (x) + a n (x)p n(x) + b n (x)p n (x) = 0. Predictor-corrector method: Once at a root, step to the next by predicting with Runge Kutta and then correcting with local Taylor approximations and Newton. Runge Kutta Local Taylor Newton iterates Requires O(n) operations for nodes and weights.
6 . Our method Newton s method in θ-space, x = cos(θ). Newton s method in θ space We will need:..1 Fast and accurate Jacobi polynomial evaluation asymptotic approximations...2 Fast and accurate evaluation of derivative recurrence relations...3 Sufficiently good initial guesses asymptotic approximations.
7 . What does a Legendre polynomial look like? Boundary Region: Bessel like Interior Region: Trig like cos(5π/6) cos(π/6) We use two asymptotic expansions: interior and boundary.
8 . Interior Asymptotic Formulae M 1 P n (cos θ) 2( 1) n m=0 ( 1 2 m )( m 1) 2 cos(αn,m ) n (2 sin θ) m+ 1 2 where α n,m = ( n + m + 1 2) θ ( m + 1 2) π 2 and C R n,m. (2 sin θ) M+ 1 2 n M R n,m Log error 10 0 Absolute error of interior asymptotic for n= Max Absolute error Convergence of Interior Asy formula 10 0 n=10 n=20 n=50 n=100 n=200 n= x Terms
9 . Boundary Asymptotic Formulae ( θ P n (cos θ) J 0 (ρθ) sin(θ) M m=0 A m (θ) ρ 2m ) M 1 + θj B m (θ) 1(ρθ) ρ 2m+1, m=0 where ρ = n Only the first few terms are known explictly. ( ) θo n 2M 3 c 2 n error = θ π ( ) 2 θ 3 O n 2M θ c n Absolute error of boundary asymptotic for n= Log error x
10 . Derivative Evaluation A recurrence relation for the derivative of P n is (1 x 2 )P n(x) = nxp n (x) + np n 1 (x), or in θ-space sin(θ) d dθ P n(cos(θ)) = n cos(θ)p n (cos(θ)) + np n 1 (cos(θ)). Many quantities can be reused for derivative evaluation.
11 . Initial Guesses Sufficiently good = quadratically clustering near endpoints. (Petras, 1998) Initial guesses come from the asymptotic formulae. Analogously, there are interior and boundary initial guesses. (Lether and Wenston, 1995) Max error in the initial guesses Caused by the 5th node changing from interior to boundary Max Error n = n
12 . Evaluating J 0 (ρθ) near Legendre nodes Inbuilt bessel evaluation only gets 15-digits of absolute accuracy, we need one bit more. Instead, we evaluate the asymptotic expansion: J 0 (ρθ) ( ) 1 ( 2 2 cos ω πρθ ( 1) k a 2k (ρθ) 2k sin ω ( 1) k a 2k+1 k=0 k=0 (ρθ) 2k+1 (1) where ω = ρθ 1 4π and do the argument reduction by ourselves. Relative error Absolute error Inbuilt Formula (1) )
13 . Gauss Legendre nodes and weights Gauss Legendre nodes and weights (α = 0, β = 0) Error in nodes for degree 1000 GLR Asy GW Absolute error in weights for degree GLR Asy GW
14 . Gauss Jacobi nodes and weights Gauss Jacobi nodes and weights (α = 0.1, β = 0.3). Error in nodes for degree 1000 Absolute Error in weights for degree GLR Asy GW GLR Asy GW
15 . Error as a quadrature rule Gauss quadrature integrates polynomials exactly. Approximate the error 1 n error = max w(x)x j dx w j=0,...,10 k x j k. 1 k= Error as a quadrature rule GLR Asy GW 10 3 CPU timings in array based language 10 2 GLR Asy GW Est. quad error Seconds n n
16 . Conclusions..1 Golub Welsch method can be accurate, but has O(n 2 ) complexity...2 GLR method is fast, but a little inaccurate for n > The method described here is fast and accurate for n > 200, but currently only implemented for Gauss Jacobi nodes and weights.
Fast algorithms based on asymptotic expansions of special functions
Fast algorithms based on asymptotic expansions of special functions Alex Townsend MIT Cornell University, 23rd January 2015, CAM Colloquium Introduction Two trends in the computing era Tabulations Software
More informationDownloaded 08/07/13 to Redistribution subject to SIAM license or copyright; see
SIAM J. SCI. COMPUT. Vol. 35, No., pp. A65 A674 c 03 Society for Industrial and Applied Mathematics FAST AND ACCURATE COMPUTATION OF GAUSS LEGENDRE AND GAUSS JACOBI QUADRATURE NODES AND WEIGHTS NICHOLAS
More informationFast and Accurate Computation of Gauss-Legendre and Gauss-Jacobi Quadrature Nodes and Weights N. Hale A. Townsend
Fast and Accurate Computation of Gauss-Legendre and Gauss-Jacobi Quadrature Nodes and Weights by N. Hale A. Townsend OCCAM Preprint Number /79 FAST AND ACCURATE COMPUTATION OF GAUSS LEGENDRE AND GAUSS
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 informationA fast Chebyshev Legendre transform using an asymptotic formula
A fast Chebyshev Legendre transform using an asymptotic formula Alex Townsend MIT (Joint work with ick Hale) SIAM OPSFA, 5th June 2015 Introduction What is the Chebyshev Legendre transform? Suppose we
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 informationb n x n + b n 1 x n b 1 x + b 0
Math Partial Fractions Stewart 7.4 Integrating basic rational functions. For a function f(x), we have examined several algebraic methods for finding its indefinite integral (antiderivative) F (x) = f(x)
More informationProgram : M.A./M.Sc. (Mathematics) M.A./M.Sc. (Final) Paper Code:MT-08 Numerical Analysis Section A (Very Short Answers Questions)
Program : M../M.Sc. (Mathematics) M../M.Sc. (Final) Paper Code:MT-08 Numerical nalysis Section (Very Short nswers Questions) 1. Write two examples of transcendental equations. (i) x 3 + sin x = 0 (ii)
More informationarxiv: v3 [math.na] 30 Nov 2012
arxiv:1202.0154v3 [math.na] 30 Nov 2012 Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials Haiyong Wang, Daan Huybrechs and Stefan Vandewalle
More informationFast variants of the Golub and Welsch algorithm for symmetric weight functions
Fast variants of the Golub and Welsch algorithm for symmetric weight functions Gérard Meurant 3 rue du sergent Bauchat, 7512 Paris, France Alvise Sommariva University of Padua, Italy. Abstract In this
More informationPHYS 404 Lecture 1: Legendre Functions
PHYS 404 Lecture 1: Legendre Functions Dr. Vasileios Lempesis PHYS 404 - LECTURE 1 DR. V. LEMPESIS 1 Legendre Functions physical justification Legendre functions or Legendre polynomials are the solutions
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationITERATION-FREE COMPUTATION OF GAUSS-LEGENDRE QUADRATURE NODES AND WEIGHTS
ITERATION-FREE COMPUTATION OF GAUSS-LEGENDRE QUADRATURE NODES AND WEIGHTS I. BOGAERT Abstract. Gauss-Legendre quadrature rules are of considerable theoretical and practical interest because of their role
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 informationSECTION A. f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes.
SECTION A 1. State the maximal domain and range of the function f(x) = ln(x). Sketch the graph of y = f(x), indicating the coordinates of any points where the graph crosses the axes. 2. By evaluating f(0),
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 informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationThis ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0
Legendre equation This ODE arises in many physical systems that we shall investigate We choose We then have Substitution gives ( x 2 ) d 2 u du 2x 2 dx dx + ( + )u u x s a λ x λ a du dx λ a λ (λ + s)x
More informationComputational methods of elementary particle physics
Computational methods of elementary particle physics Markus Huber Lecture in SS017 Version: March 7, 017 Contents 0.0 Preface................................... 3 1 Introduction 4 1.1 Overview of computational
More informationA Riemann Hilbert approach to Jacobi operators and Gaussian quadrature
A Riemann Hilbert approach to Jacobi operators and Gaussian quadrature Thomas Trogdon trogdon@cims.nyu.edu Courant Institute of Mathematical Sciences New York University 251 Mercer St. New York, NY, 112,
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 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 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 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationProblem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.
Problem 1A Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1 (Hint: 1 1 (something)dz) Solution: The volume is 1 1 4xydz where x = y = 1 z 2 This integral has value 16/3 Problem 2A Let f(x)
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationChebfun and numerical quadrature
SCIENCE CHINA Mathematics. ARTICLES. doi: 1.17/s11425-12-4474-z Chebfun and numerical quadrature HALE Nicholas & TREFETHEN Lloyd N. Mathematical Institute, University of Oxford, Oxford OX1 3LB, UK Email:
More informationScientific Computing: Numerical Integration
Scientific Computing: Numerical Integration Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Fall 2015 Nov 5th, 2015 A. Donev (Courant Institute) Lecture
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 information256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.
56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =
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 informationFinal Year M.Sc., Degree Examinations
QP CODE 569 Page No Final Year MSc, Degree Examinations September / October 5 (Directorate of Distance Education) MATHEMATICS Paper PM 5: DPB 5: COMPLEX ANALYSIS Time: 3hrs] [Max Marks: 7/8 Instructions
More informationNUMERICAL COMPUTATION IN SCIENCE AND ENGINEERING
NUMERICAL COMPUTATION IN SCIENCE AND ENGINEERING C. Pozrikidis University of California, San Diego New York Oxford OXFORD UNIVERSITY PRESS 1998 CONTENTS Preface ix Pseudocode Language Commands xi 1 Numerical
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 informationBessel Functions and Their Application to the Eigenvalues of the Laplace Operator
Bessel Functions and Their Application to the Eigenvalues of the Laplace Operator Matthew Jin June 1, 2014 1 Introduction Bessel functions of the first kind, J n, are the solutions of Bessel s differential
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 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 informationIntroduction. Chapter One
Chapter One Introduction The aim of this book is to describe and explain the beautiful mathematical relationships between matrices, moments, orthogonal polynomials, quadrature rules and the Lanczos and
More informationarxiv: v1 [math.ca] 27 Sep 2017
arxiv:1709.09656v1 [math.ca] 27 Sep 2017 Asymptotic approximations to the nodes and weights of Gauss Hermite and Gauss Laguerre quadratures A. Gil Departamento de Matemática Aplicada y CC. de la Computación.
More informationComparison of Clenshaw-Curtis and Gauss Quadrature
WDS'11 Proceedings of Contributed Papers, Part I, 67 71, 211. ISB 978-8-7378-184-2 MATFYZPRESS Comparison of Clenshaw-Curtis and Gauss Quadrature M. ovelinková Charles University, Faculty of Mathematics
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 informationSection 5.2 Series Solution Near Ordinary Point
DE Section 5.2 Series Solution Near Ordinary Point Page 1 of 5 Section 5.2 Series Solution Near Ordinary Point We are interested in second order homogeneous linear differential equations with variable
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 informationarxiv: v1 [math.na] 20 Oct 2014
FAST COMPUTATION OF GAUSS QUADRATURE NODES AND WEIGHTS ON THE WHOLE REAL LINE ALEX TOWNSEND, THOMAS TROGDON, AND SHEEHAN OLVER arxiv:1410.586v1 [math.na] 0 Oct 014 Abstract. A fast and accurate algorithm
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 informationPower Series Solutions to the Legendre Equation
Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre s equation. When α Z +, the equation has polynomial
More informationAn Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence
An Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence John Pearson MSc Special Topic Abstract Numerical approximations of
More informationNUMERICAL ANALYSIS PROBLEMS
NUMERICAL ANALYSIS 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 Problem.
More informationModule 6: Implicit Runge-Kutta Methods Lecture 17: Derivation of Implicit Runge-Kutta Methods(Contd.) The Lecture Contains:
The Lecture Contains: We continue with the details about the derivation of the two stage implicit Runge- Kutta methods. A brief description of semi-explicit Runge-Kutta methods is also given. Finally,
More informationAM205: Assignment 3 (due 5 PM, October 20)
AM25: Assignment 3 (due 5 PM, October 2) For this assignment, first complete problems 1, 2, 3, and 4, and then complete either problem 5 (on theory) or problem 6 (on an application). If you submit answers
More informationCOMPUTATION OF BESSEL AND AIRY FUNCTIONS AND OF RELATED GAUSSIAN QUADRATURE FORMULAE
BIT 6-85//41-11 $16., Vol. 4, No. 1, pp. 11 118 c Swets & Zeitlinger COMPUTATION OF BESSEL AND AIRY FUNCTIONS AND OF RELATED GAUSSIAN QUADRATURE FORMULAE WALTER GAUTSCHI Department of Computer Sciences,
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 informationThe Hardy-Littlewood Function
Hardy-Littlewood p. 1/2 The Hardy-Littlewood Function An Exercise in Slowly Convergent Series Walter Gautschi wxg@cs.purdue.edu Purdue University Hardy-Littlewood p. 2/2 OUTLINE The Hardy-Littlewood (HL)
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 informationFixed point iteration and root finding
Fixed point iteration and root finding The sign function is defined as x > 0 sign(x) = 0 x = 0 x < 0. It can be evaluated via an iteration which is useful for some problems. One such iteration is given
More informationENGINEERING MATHEMATICS I. CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 PART-A
ENGINEERING MATHEMATICS I CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 Total Hrs: 52 Exam Marks:100 PART-A Unit-I: DIFFERENTIAL CALCULUS - 1 Determination of n th derivative of standard functions-illustrative
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 informationContents. Preface to the Third Edition (2007) Preface to the Second Edition (1992) Preface to the First Edition (1985) License and Legal Information
Contents Preface to the Third Edition (2007) Preface to the Second Edition (1992) Preface to the First Edition (1985) License and Legal Information xi xiv xvii xix 1 Preliminaries 1 1.0 Introduction.............................
More informationNumerical Analysis. Introduction to. Rostam K. Saeed Karwan H.F. Jwamer Faraidun K. Hamasalh
Iraq Kurdistan Region Ministry of Higher Education and Scientific Research University of Sulaimani Faculty of Science and Science Education School of Science Education-Mathematics Department Introduction
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 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 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 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 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 informationEXAM. Practice for Second Exam. Math , Fall Nov 4, 2003 ANSWERS
EXAM Practice for Second Eam Math 135-006, Fall 003 Nov 4, 003 ANSWERS i Problem 1. In each part, find the integral. A. d (4 ) 3/ Make the substitution sin(θ). d cos(θ) dθ. We also have Then, we have d/dθ
More informationLecture IV: Time Discretization
Lecture IV: Time Discretization Motivation Kinematics: continuous motion in continuous time Computer simulation: Discrete time steps t Discrete Space (mesh particles) Updating Position Force induces acceleration.
More informationTen things you should know about quadrature. Nick Trefethen, Vanderbilt, Wed. 28 May 8:35 PM
Ten things you should know about quadrature Nick Trefethen, Vanderbilt, Wed. 28 May 2014 @ 8:35 PM 1. If the integrand is analytic, Gauss quadrature converges geometrically. f is analytic and bounded by
More informationPower Series Solutions We use power series to solve second order differential equations
Objectives Power Series Solutions We use power series to solve second order differential equations We use power series expansions to find solutions to second order, linear, variable coefficient equations
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 informationa k 0, then k + 1 = 2 lim 1 + 1
Math 7 - Midterm - Form A - Page From the desk of C. Davis Buenger. https://people.math.osu.edu/buenger.8/ Problem a) [3 pts] If lim a k = then a k converges. False: The divergence test states that if
More information(x x 0 )(x x 1 )... (x x n ) (x x 0 ) + y 0.
> 5. Numerical Integration Review of Interpolation Find p n (x) with p n (x j ) = y j, j = 0, 1,,..., n. Solution: p n (x) = y 0 l 0 (x) + y 1 l 1 (x) +... + y n l n (x), l k (x) = n j=1,j k Theorem Let
More informationAn Overly Simplified and Brief Review of Differential Equation Solution Methods. 1. Some Common Exact Solution Methods for Differential Equations
An Overly Simplified and Brief Review of Differential Equation Solution Methods We will be dealing with initial or boundary value problems. A typical initial value problem has the form y y 0 y(0) 1 A typical
More informationUnit I (Testing of Hypothesis)
SUBJECT NAME : Statistics and Numerical Methods SUBJECT CODE : MA645 MATERIAL NAME : Part A questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) Unit I (Testing of Hypothesis). State level
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 informationZernike Polynomials: Evaluation, Quadrature, and Interpolation. Philip Greengard, Kirill Serkh, Technical Report YALEU/DCS/TR-1539 February 20, 2018
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric
More informationModule 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction
Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction 1 Introduction In this module, we develop solution techniques for numerically solving ordinary
More informationNumerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018
Numerical Analysis Preliminary Exam 0.00am.00pm, January 9, 208 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationSPECTRAL METHODS: ORTHOGONAL POLYNOMIALS
SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS 31 October, 2007 1 INTRODUCTION 2 ORTHOGONAL POLYNOMIALS Properties of Orthogonal Polynomials 3 GAUSS INTEGRATION Gauss- Radau Integration Gauss -Lobatto Integration
More informationNonlinear Integral Equation Formulation of Orthogonal Polynomials
Nonlinear Integral Equation Formulation of Orthogonal Polynomials Eli Ben-Naim Theory Division, Los Alamos National Laboratory with: Carl Bender (Washington University, St. Louis) C.M. Bender and E. Ben-Naim,
More informationNotes for CS542G (Iterative Solvers for Linear Systems)
Notes for CS542G (Iterative Solvers for Linear Systems) Robert Bridson November 20, 2007 1 The Basics We re now looking at efficient ways to solve the linear system of equations Ax = b where in this course,
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationAngular Momentum. Classically the orbital angular momentum with respect to a fixed origin is. L = r p. = yp z. L x. zp y L y. = zp x. xpz L z.
Angular momentum is an important concept in quantum theory, necessary for analyzing motion in 3D as well as intrinsic properties such as spin Classically the orbital angular momentum with respect to a
More informationReview I: Interpolation
Review I: Interpolation Varun Shankar January, 206 Introduction In this document, we review interpolation by polynomials. Unlike many reviews, we will not stop there: we will discuss how to differentiate
More informationReview Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester
HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE
More informationIterative Methods for Ax=b
1 FUNDAMENTALS 1 Iterative Methods for Ax=b 1 Fundamentals consider the solution of the set of simultaneous equations Ax = b where A is a square matrix, n n and b is a right hand vector. We write the iterative
More informationTen things you should know about quadrature
Ten things you should know about quadrature Nick Trefethen, March 2016 With thanks to André Weideman for #2, #5, #8, #9 Nick Hale for #4, #5, #7, #8 Nick Higham for #5, #8 Folkmar Bornemann for #6. 1/26
More informationPLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 2. (a) (b) (c) (d) (e) (a) (b) (c) (d) (e) 4. (a) (b) (c) (d) (e)...
Math, Exam III November 6, 7 The Honor Code is in effect for this examination. All work is to be your own. No calculators. The exam lasts for hour and min. Be sure that your name is on every page in case
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 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 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 informationMTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.
MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:
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 informationExperimental mathematics and integration
Experimental mathematics and integration David H. Bailey http://www.davidhbailey.com Lawrence Berkeley National Laboratory (retired) Computer Science Department, University of California, Davis October
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More informationZERO DISTRIBUTION OF POLYNOMIALS ORTHOGONAL ON THE RADIAL RAYS IN THE COMPLEX PLANE* G. V. Milovanović, P. M. Rajković and Z. M.
FACTA UNIVERSITATIS (NIŠ) Ser. Math. Inform. 12 (1997), 127 142 ZERO DISTRIBUTION OF POLYNOMIALS ORTHOGONAL ON THE RADIAL RAYS IN THE COMPLEX PLANE* G. V. Milovanović, P. M. Rajković and Z. M. Marjanović
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationCalculus First Semester Review Name: Section: Evaluate the function: (g o f )( 2) f (x + h) f (x) h. m(x + h) m(x)
Evaluate the function: c. (g o f )(x + 2) d. ( f ( f (x)) 1. f x = 4x! 2 a. f( 2) b. f(x 1) c. f (x + h) f (x) h 4. g x = 3x! + 1 Find g!! (x) 5. p x = 4x! + 2 Find p!! (x) 2. m x = 3x! + 2x 1 m(x + h)
More information1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),
1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on
More informationFinal Exam Review Quesitons
Final Exam Review Quesitons. Compute the following integrals. (a) x x 4 (x ) (x + 4) dx. The appropriate partial fraction form is which simplifies to x x 4 (x ) (x + 4) = A x + B (x ) + C x + 4 + Dx x
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More information