Calculation of Highly Oscillatory Integrals by Quadrature Method
|
|
- Elvin Reed
- 5 years ago
- Views:
Transcription
1 Calculation of Highly Oscillatory Integrals by Quadrature Methods Krishna Thapa Texas A&M University, College Station, TX May 18, 211
2 Outline Purpose Why Filon Type Quadrature Methods Our Expectations Strategy Questions and/or Suggestions References
3 Purpose In the model of steeply rising potential, λz α, Fulling et al. came across the following oscillatory integral: T (z) = 1 π 3 dρ 1 du 1 u 2 cos(2zρu 2δ(ρu)) (1) Todd Zapattas thesis on WKB approximation for linear potentials also has highly oscillatory integrals that are difficult to calculate numerically. Airy functions with higher frequencies that are much more difficult to approximate numerically arise in both cases. Ψ(x, t) = e i Et ψ(y)u(x, E)u(y, E)ρ(E)dEdy (2)
4 Filon Type Quadrature Method We want to approximate an integral of the type I [f ] = 1 where f and g are smooth functions. f (x)e iωg(x) dx (3) Usually, the numerical integration of these type of integrals is acheived by using Gauss-Christoffel Quadrature methods. The integrand is interpolated at distinct nodes c 1 < c 2 < c 3...c ν by a polynomial p of degree ν 1. I [f ] Q GC = 1 p(x)dx (4) This method fails to give appropriate result when ω 1.
5 Filon Type Quadrature Method An alternative approach to this is to use the method developed by Louis Napoleon George Filon(1928). The function f(x) is interpolated instead of the whole integrand. Q F 1 [f ] = 1 f (x)e iωx dx = ν b k (ω)f (c k ) (5) k=1 where b k (ω) = 1 l k(x)e iωx dx and one needs to know first few moments 1 x m (x)e iωx dx in explicit form. Higher frequency ω ensures smaller error, in the order of O(ω 2 ) as ω
6 Filon Type Quadrature Method Iserles et. al use this Filon-type quadrature method to do the integration. Instead of polynomial expansion, they let the integrating polynomial depend on the derivatives of f. The error further decreases with increased frequency Q F s [f ] I [f ] O(ω s 1 ) (6) They further define a generalized Filon method, Q F s [f ] = 1 f (x)e iωx dx = θ ν j b l,j (ω)f j (c l ) (7) l=1 j= where θ i, θj s and b i,j = 1 α l,j(x)e iωg(x) dx
7 Example Iserles et al. give an example of implementation of this method. with g(x) = x, s = 2, ν = 2, c 1 =, c 2 = 1, and θ 1 = θ 2 =, we get Q A 2 [f ] = eiω f (1) f () iω + eiω f (1) f () ω 2 (8) Q F 2 [f ] = (...)f () + (...)f (1) + (...)f () + (...)f (1) +... (9)
8 Strategy My plan is to apply various methods developed by Iserles et al. to simpler problems whose answer we already know Need to know more about asymptotic behaviour of the functions that I want to integrate Need to know more about stationary points and/or the behaviour at the endpoints Do the required calculation os Power wall problem and WKB approximation problem.
9 Questions Any questions and Suggestions?
10 References A. Iserles and S. Nørsett Efficient quadrature of highly oscillatory integrals using derivatives Proceedings of the Royal Society A (25) Fulling et. al Investigating the Spectral Geometry of a Soft Wall S. Olver Moment-free numerical integration of highly oscillatory functions IMA Journal of Numerical Analysis 26 (26) T. A. Zapata The WKB approximation for linear potential and ceiling Master s Thesis. Texas AM University, 27.
A Numerical Approach To The Steepest Descent Method
A Numerical Approach To The Steepest Descent Method K.U. Leuven, Division of Numerical and Applied Mathematics Isaac Newton Institute, Cambridge, Feb 15, 27 Outline 1 One-dimensional oscillatory integrals
More informationOn the quadrature of multivariate highly oscillatory integrals over non-polytope domains
On the quadrature of multivariate highly oscillatory integrals over non-polytope domains Sheehan Olver February 16, 2006 Abstract In this paper, we present a Levin-type method for approximating multivariate
More informationTHE MAGNUS METHOD FOR SOLVING OSCILLATORY LIE-TYPE ORDINARY DIFFERENTIAL EQUATIONS
THE MAGNUS METHOD FOR SOLVING OSCILLATORY LIE-TYPE ORDINARY DIFFERENTIAL EQUATIONS MARIANNA KHANAMIRYAN Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Wilberforce Road,
More informationHighly oscillatory quadrature and its applications
UNIVERSITY OF CAMBRIDGE CENTRE FOR MATHEMATICAL SCIENCES DEPARTMENT OF APPLIED MATHEMATICS & THEORETICAL PHYSICS Highly oscillatory quadrature and its applications Arieh Iserles & Syvert Nørsett Report
More informationA combined Filon/asymptotic quadrature method for highly oscillatory problems
BIT Numerical Mathematics (26)46:- c Springer 26. DOI:.7/s543---x A combined Filon/asymptotic quadrature method for highly oscillatory problems A. Asheim Abstract. Department of Mathematical Sciences,
More informationPreconditioned GMRES for oscillatory integrals
Report no. 08/9 Preconditioned GMRES for oscillatory integrals Sheehan Olver Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, UK Sheehan.Olver@sjc.ox.ac.uk Abstract None of
More informationComplex Gaussian quadrature of oscillatory integrals
Complex Gaussian quadrature of oscillatory integrals Alfredo Deaño Daan Huybrechs. March 18, 28 Abstract We construct and analyze Gauss-type quadrature rules with complexvalued nodes and weights to approximate
More informationNumerical Approximation of Highly Oscillatory Integrals
Numerical Approximation of Highly Oscillatory Integrals Sheehan Olver Trinity Hall University of Cambridge 14 June 2008 This dissertation is submitted for the degree of Doctor of Philosophy Abstract The
More informationAn Efficient Adaptive Levin-type Method for Highly Oscillatory Integrals
Applied Mathematical Sciences, Vol. 8, 2014, no. 138, 6889-6908 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.49720 An Efficient Adaptive Levin-type Method for Highly Oscillatory Integrals
More informationHighly Oscillatory Problems: Computation, Theory and Applications
Highly Oscillatory Problems: Computation, Theory and Applications Isaac Newton Institute for Mathematical Sciences Edited by 1 Rapid function approximation by modified Fourier series Daan Huybrechs and
More informationNumerical Methods for Highly Oscillatory Problems
Andreas Asheim Numerical Methods for Highly Oscillatory Problems Doctoral thesis for the degree of philosophiae doctor Trondheim, May 2010 Norwegian University of Science and Technology Faculty of Information
More informationEcient computation of highly oscillatory integrals by using QTT tensor approximation
Ecient computation of highly oscillatory integrals by using QTT tensor approximation Boris Khoromskij Alexander Veit Abstract We propose a new method for the ecient approximation of a class of highly oscillatory
More informationThe kissing polynomials and their Hankel determinants
The kissing polynomials and their Hankel determinants Alfredo Deaño, Daan Huybrechs and Arieh Iserles April 28, 2015 Abstract We study a family of polynomials that are orthogonal with respect to the weight
More informationAnton ARNOLD. with N. Ben Abdallah (Toulouse), J. Geier (Vienna), C. Negulescu (Marseille) TU Vienna Institute for Analysis and Scientific Computing
TECHNISCHE UNIVERSITÄT WIEN Asymptotically correct finite difference schemes for highly oscillatory ODEs Anton ARNOLD with N. Ben Abdallah (Toulouse, J. Geier (Vienna, C. Negulescu (Marseille TU Vienna
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 information5 Numerical Integration & Dierentiation
5 Numerical Integration & Dierentiation Department of Mathematics & Statistics ASU Outline of Chapter 5 1 The Trapezoidal and Simpson Rules 2 Error Formulas 3 Gaussian Numerical Integration 4 Numerical
More informationResearch Article The Approximate Solution of Fredholm Integral Equations with Oscillatory Trigonometric Kernels
Applied Mathematics, Article ID 72327, 7 pages http://ddoiorg/055/204/72327 Research Article The Approimate Solution of Fredholm Integral Equations with Oscillatory Trigonometric Kernels Qinghua Wu School
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 informationOn the convergence rate of a modified Fourier series [PREPRINT]
On the convergence rate of a modified Fourier series [PREPRINT Sheehan Olver St John s College St Giles Oxford OX1 3JP United Kingdom Sheehan.Olver@sjc.ox.ac.uk 18 April 008 Abstract The rate of convergence
More informationCUBATURE FORMULA FOR APPROXIMATE CALCULATION OF INTEGRALS OF TWO-DIMENSIONAL IRREGULAR HIGHLY OSCILLATING FUNCTIONS
U.P.B. Sci. Bull., Series A, Vol. 80, Iss. 3, 08 ISSN 3-707 CUBATURE FORMULA FOR APPROXIMATE CALCULATION OF INTEGRALS OF TWO-DIMENSIONAL IRREGULAR HIGHLY OSCILLATING FUNCTIONS Vitaliy MEZHUYEV, Oleg M.
More informationHigh Frequency Scattering by Convex Polygons Stephen Langdon
Bath, October 28th 2005 1 High Frequency Scattering by Convex Polygons Stephen Langdon University of Reading, UK Joint work with: Simon Chandler-Wilde Steve Arden Funded by: Leverhulme Trust University
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 informationON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT
ON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT Received: 31 July, 2008 Accepted: 06 February, 2009 Communicated by: SIMON J SMITH Department of Mathematics and Statistics La Trobe University,
More informationGENERALIZED GALERKIN VARIATIONAL INTEGRATORS
GENERALIZED GALERKIN VARIATIONAL INTEGRATORS MELVIN LEOK Abstract. We introduce generalized Galerin variational integrators, which are a natural generalization of discrete variational mechanics, whereby
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 informationformulas with complex poles
Computing rational Gauss-Chebyshev quadrature formulas with complex poles Karl Deckers Joris Van Deun Adhemar Bultheel Department of Computer Science K.U.Leuven Augustus 7, 2006 Rational Gauss-Chebyshev
More informationFast and accurate methods for the discretization of singular integral operators given on surfaces
Fast and accurate methods for the discretization of singular integral operators given on surfaces James Bremer University of California, Davis March 15, 2018 This is joint work with Zydrunas Gimbutas (NIST
More informationON THE CONVERGENCE RATE OF A MODIFIED FOURIER SERIES
MATHEMATICS OF COMPUTATION Volume 78, Number 67, July 9, Pages 169 1645 S 5-5718(9)4- Article electronically published on February 18, 9 ON THE CONVERGENCE RATE OF A MODIFIED FOURIER SERIES SHEEHAN OLVER
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 information12.0 Properties of orthogonal polynomials
12.0 Properties of orthogonal polynomials In this section we study orthogonal polynomials to use them for the construction of quadrature formulas investigate projections on polynomial spaces and their
More informationLecture 4: Fourier Transforms.
1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 ()
More informationDifferentiation Shortcuts
Differentiation Shortcuts Sections 10-5, 11-2, 11-3, and 11-4 Prof. Nathan Wodarz Math 109 - Fall 2008 Contents 1 Basic Properties 2 1.1 Notation............................... 2 1.2 Constant Functions.........................
More informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationConvergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Milan Korda 1, Didier Henrion,3,4 Draft of December 1, 016 Abstract Moment-sum-of-squares hierarchies
More informationFast Numerical Methods for Stochastic Computations
Fast AreviewbyDongbinXiu May 16 th,2013 Outline Motivation 1 Motivation 2 3 4 5 Example: Burgers Equation Let us consider the Burger s equation: u t + uu x = νu xx, x [ 1, 1] u( 1) =1 u(1) = 1 Example:
More informationComputing Gauss-Jacobi quadrature rules
.... Computing Gauss-Jacobi quadrature rules Alex Townsend Joint work with Nick Hale NA Internal Seminar Trinity Term 2012 . Gauss Jacobi Quadrature An n-point Gauss Jacobi quadrature rule: 1 1 w(x)f (x)dx
More informationExamination paper for TMA4125 Matematikk 4N
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 4N Academic contact during examination: Anne Kværnø a, Louis-Philippe Thibault b Phone: a 9 66 38 4, b 9 3 0 95 Examination date:
More informationUNIFORM BOUNDS FOR BESSEL FUNCTIONS
Journal of Applied Analysis Vol. 1, No. 1 (006), pp. 83 91 UNIFORM BOUNDS FOR BESSEL FUNCTIONS I. KRASIKOV Received October 8, 001 and, in revised form, July 6, 004 Abstract. For ν > 1/ and x real we shall
More informationarxiv: v1 [math.cv] 18 Aug 2015
arxiv:508.04376v [math.cv] 8 Aug 205 Saddle-point integration of C bump functions Steven G. Johnson, MIT Applied Mathematics Created November 23, 2006; updated August 9, 205 Abstract This technical note
More informationIntegration. Topic: Trapezoidal Rule. Major: General Engineering. Author: Autar Kaw, Charlie Barker.
Integration Topic: Trapezoidal Rule Major: General Engineering Author: Autar Kaw, Charlie Barker 1 What is Integration Integration: The process of measuring the area under a function plotted on a graph.
More informationMAE294B/SIOC203B: Methods in Applied Mechanics Winter Quarter sgls/mae294b Solution IV
MAE9B/SIOC3B: Methods in Applied Mechanics Winter Quarter 8 http://webengucsdedu/ sgls/mae9b 8 Solution IV (i The equation becomes in T Applying standard WKB gives ɛ y TT ɛte T y T + y = φ T Te T φ T +
More informationPolynomial Approximation: The Fourier System
Polynomial Approximation: The Fourier System Charles B. I. Chilaka CASA Seminar 17th October, 2007 Outline 1 Introduction and problem formulation 2 The continuous Fourier expansion 3 The discrete Fourier
More informationFast 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 informationQuantum Physics III (8.06) Spring 2007 FINAL EXAMINATION Monday May 21, 9:00 am You have 3 hours.
Quantum Physics III (8.06) Spring 2007 FINAL EXAMINATION Monday May 21, 9:00 am You have 3 hours. There are 10 problems, totalling 180 points. Do all problems. Answer all problems in the white books provided.
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
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 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 informationMATHEMATICAL METHODS AND APPLIED COMPUTING
Numerical Approximation to Multivariate Functions Using Fluctuationlessness Theorem with a Trigonometric Basis Function to Deal with Highly Oscillatory Functions N.A. BAYKARA Marmara University Department
More informationAPPM/MATH Problem Set 6 Solutions
APPM/MATH 460 Problem Set 6 Solutions This assignment is due by 4pm on Wednesday, November 6th You may either turn it in to me in class or in the box outside my office door (ECOT ) Minimal credit will
More information3. (12 points) Find an equation for the line tangent to the graph of f(x) =
April 8, 2015 Name The total number of points available is 168 Throughout this test, show your work Throughout this test, you are expected to use calculus to solve problems Graphing calculator solutions
More informationResearch Statement. James Bremer Department of Mathematics, University of California, Davis
Research Statement James Bremer Department of Mathematics, University of California, Davis Email: bremer@math.ucdavis.edu Webpage: https.math.ucdavis.edu/ bremer I work in the field of numerical analysis,
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationNUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS. Sheehan Olver NA Group, Oxford
NUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS Sheehan Olver NA Group, Oxford We are interested in numerically computing eigenvalue statistics of the GUE ensembles, i.e.,
More informationIndex. for Ɣ(a, z), 39. convergent asymptotic representation, 46 converging factor, 40 exponentially improved, 39
Index Abramowitz function computed by Clenshaw s method, 74 absolute error, 356 Airy function contour integral for, 166 Airy functions algorithm, 359 asymptotic estimate of, 18 asymptotic expansions, 81,
More informationIntegration by Substitution
November 22, 2013 Introduction 7x 2 cos(3x 3 )dx =? 2xe x2 +5 dx =? Chain rule The chain rule: d dx (f (g(x))) = f (g(x)) g (x). Use the chain rule to find f (x) and then write the corresponding anti-differentiation
More informationMATH 3150: PDE FOR ENGINEERS FINAL EXAM (VERSION A)
MAH 35: PDE FOR ENGINEERS FINAL EXAM VERSION A). Draw the graph of 2. y = tan x labelling all asymptotes and zeros. Include at least 3 periods in your graph. What is the period of tan x? See figure. Asymptotes
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 informationFinite Elements. Colin Cotter. January 15, Colin Cotter FEM
Finite Elements January 15, 2018 Why Can solve PDEs on complicated domains. Have flexibility to increase order of accuracy and match the numerics to the physics. has an elegant mathematical formulation
More informationExponential integrators
Exponential integrators Marlis Hochbruck Heinrich-Heine University Düsseldorf, Germany Alexander Ostermann University Innsbruck, Austria Helsinki, May 25 p.1 Outline Time dependent Schrödinger equations
More informationA High-Order Galerkin Solver for the Poisson Problem on the Surface of the Cubed Sphere
A High-Order Galerkin Solver for the Poisson Problem on the Surface of the Cubed Sphere Michael Levy University of Colorado at Boulder Department of Applied Mathematics August 10, 2007 Outline 1 Background
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 informationSection 6.6 Gaussian Quadrature
Section 6.6 Gaussian Quadrature Key Terms: Method of undetermined coefficients Nonlinear systems Gaussian quadrature Error Legendre polynomials Inner product Adapted from http://pathfinder.scar.utoronto.ca/~dyer/csca57/book_p/node44.html
More informationImplicitly Defined High-Order Operator Splittings for Parabolic and Hyperbolic Variable-Coefficient PDE Using Modified Moments
Implicitly Defined High-Order Operator Splittings for Parabolic and Hyperbolic Variable-Coefficient PDE Using Modified Moments James V. Lambers September 24, 2008 Abstract This paper presents a reformulation
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 informationAdvanced Mathematical Methods for Scientists and Engineers I
Carl M. Bender Steven A. Orszag Advanced Mathematical Methods for Scientists and Engineers I Asymptotic Methods and Perturbation Theory With 148 Figures Springer CONTENTS! Preface xiii PART I FUNDAMENTALS
More informationDipartimento di Matematica
Dipartimento di Matematica L. SCUDERI ON THE COMPUTATION OF NEARLY SINGULAR INTEGRALS IN 3D BEM COLLOCATION Rapporto interno N. 14, giugno 2006 Politecnico di Torino Corso Duca degli Abruzzi, 24-10129
More informationMath background. Physics. Simulation. Related phenomena. Frontiers in graphics. Rigid fluids
Fluid dynamics Math background Physics Simulation Related phenomena Frontiers in graphics Rigid fluids Fields Domain Ω R2 Scalar field f :Ω R Vector field f : Ω R2 Types of derivatives Derivatives measure
More informationAnswers and expectations
Answers and expectations For a function f(x) and distribution P(x), the expectation of f with respect to P is The expectation is the average of f, when x is drawn from the probability distribution P E
More informationSubstitutions and by Parts, Area Between Curves. Goals: The Method of Substitution Areas Integration by Parts
Week #7: Substitutions and by Parts, Area Between Curves Goals: The Method of Substitution Areas Integration by Parts 1 Week 7 The Indefinite Integral The Fundamental Theorem of Calculus, b a f(x) dx =
More informationChange of variable formulæ for regularizing slowly decaying and oscillatory Cauchy and Hilbert transforms
Change of variable formulæ for regularizing slowly decaying and oscillatory Cauchy and Hilbert transforms Sheehan Olver November 11, 2013 Abstract Formulæ are derived for expressing Cauchy and Hilbert
More informationEach problem is worth 34 points. 1. Harmonic Oscillator Consider the Hamiltonian for a simple harmonic oscillator. 2ml 2 0. d 2
Physics 443 Prelim # with solutions March 7, 8 Each problem is worth 34 points.. Harmonic Oscillator Consider the Hamiltonian for a simple harmonic oscillator H p m + mω x (a Use dimensional analysis to
More informationThe moment-generating function of the log-normal distribution using the star probability measure
Noname manuscript No. (will be inserted by the editor) The moment-generating function of the log-normal distribution using the star probability measure Yuri Heymann Received: date / Accepted: date Abstract
More informationToday s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm
Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier
More informationMath 142, Final Exam. 12/7/10.
Math 4, Final Exam. /7/0. No notes, calculator, or text. There are 00 points total. Partial credit may be given. Write your full name in the upper right corner of page. Number the pages in the upper right
More informationDRAFT: Integration of oscillatory integrals, a computer-algebra approach
DRAFT: Integration of oscillatory integrals, a computer-algebra approach Richard Fateman Computer Science University of California Berkeley, CA, USA November 30, 2012 Abstract The numerical integration
More informationStat 451 Lecture Notes Numerical Integration
Stat 451 Lecture Notes 03 12 Numerical Integration Ryan Martin UIC www.math.uic.edu/~rgmartin 1 Based on Chapter 5 in Givens & Hoeting, and Chapters 4 & 18 of Lange 2 Updated: February 11, 2016 1 / 29
More information5.2.2 Planar Andronov-Hopf bifurcation
138 CHAPTER 5. LOCAL BIFURCATION THEORY 5.. Planar Andronov-Hopf bifurcation What happens if a planar system has an equilibrium x = x 0 at some parameter value α = α 0 with eigenvalues λ 1, = ±iω 0, ω
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Linear Multistep methods Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the
More informationThe Intermediate Value Theorem If a function f (x) is continuous in the closed interval [ a,b] then [ ]
Lecture 2 5B Evaluating Limits Limits x ---> a The Intermediate Value Theorem If a function f (x) is continuous in the closed interval [ a,b] then [ ] the y values f (x) must take on every value on the
More informationEvolution of semiclassical Wigner function (the higher dimensio
Evolution of semiclassical Wigner function (the higher dimensional case) Workshop on Fast Computations in Phase Space, WPI-Vienna, November 2008 Dept. Appl. Math., Univ. Crete & IACM-FORTH 1 2 3 4 5 6
More informationExamination paper for TMA4122/TMA4123/TMA4125/TMA4130 Matematikk 4M/N
Department of Mathematical Sciences Examination paper for TMA4122/TMA4123/TMA4125/TMA4130 Matematikk 4M/N Academic contact during examination: Markus Grasmair Phone: 97 58 04 35 Code C): Basic calculator.
More informationA Survey of Computational High Frequency Wave Propagation I
A Survey of Computational High Frequency Wave Propagation I Bjorn Engquist University of Texas at Austin CSCAMM Workshop on High Frequency Wave Propagation, University of Maryland, September 19-22, 2005
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
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 informationSection 5.5 More Integration Formula (The Substitution Method) 2 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus I
Section 5.5 More Integration Formula (The Substitution Method) 2 Lectures College of Science MATHS : Calculus I (University of Bahrain) Integrals / 7 The Substitution Method Idea: To replace a relatively
More informationAnnouncements. Topics: Homework:
Announcements Topics: - sections 7.3 (the definite integral +area), 7.4 (FTC), 7.5 (additional techniques of integration) * Read these sections and study solved examples in your textbook! Homework: - review
More informationIntroduction to Aspects of Multiscale Modeling as Applied to Porous Media
Introduction to Aspects of Multiscale Modeling as Applied to Porous Media Part III Todd Arbogast Department of Mathematics and Center for Subsurface Modeling, Institute for Computational Engineering and
More informationMathematics for Engineers. Numerical mathematics
Mathematics for Engineers Numerical mathematics Integers Determine the largest representable integer with the intmax command. intmax ans = int32 2147483647 2147483647+1 ans = 2.1475e+09 Remark The set
More informationSimultaneous Gaussian quadrature for Angelesco systems
for Angelesco systems 1 KU Leuven, Belgium SANUM March 22, 2016 1 Joint work with Doron Lubinsky Introduced by C.F. Borges in 1994 Introduced by C.F. Borges in 1994 (goes back to Angelesco 1918). Introduced
More informationhttp://www.springer.com/3-540-30725-7 Erratum Spectral Methods Fundamentals in Single Domains C. Canuto M.Y. Hussaini A. Quarteroni T.A. Zang Springer-Verlag Berlin Heidelberg 2006 Due to a technical error
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More informationGAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES
GAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES RICHARD J. MATHAR Abstract. The manuscript provides tables of abscissae and weights for Gauss- Laguerre integration on 64, 96 and 128
More informationOutline. 1 Numerical Integration. 2 Numerical Differentiation. 3 Richardson Extrapolation
Outline Numerical Integration Numerical Differentiation Numerical Integration Numerical Differentiation 3 Michael T. Heath Scientific Computing / 6 Main Ideas Quadrature based on polynomial interpolation:
More informationNumerical Integra/on
Numerical Integra/on Applica/ons The Trapezoidal Rule is a technique to approximate the definite integral where For 1 st order: f(a) f(b) a b Error Es/mate of Trapezoidal Rule Truncation error: From Newton-Gregory
More informationOn the Lebesgue constant of barycentric rational interpolation at equidistant nodes
On the Lebesgue constant of barycentric rational interpolation at equidistant nodes by Len Bos, Stefano De Marchi, Kai Hormann and Georges Klein Report No. 0- May 0 Université de Fribourg (Suisse Département
More informationFourier reconstruction of univariate piecewise-smooth functions from non-uniform spectral data with exponential convergence rates
Fourier reconstruction of univariate piecewise-smooth functions from non-uniform spectral data with exponential convergence rates Rodrigo B. Platte a,, Alexander J. Gutierrez b, Anne Gelb a a School of
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 informationA note on multivariate Gauss-Hermite quadrature
A note on multivariate Gauss-Hermite quadrature Peter Jäckel 1th May 5 1 Introduction Gaussian quadratures are an ingenious way to approximate the integral of an unknown function f(x) over a specified
More informationJoint Parameter Estimation of the Ornstein-Uhlenbeck SDE driven by Fractional Brownian Motion
Joint Parameter Estimation of the Ornstein-Uhlenbeck SDE driven by Fractional Brownian Motion Luis Barboza October 23, 2012 Department of Statistics, Purdue University () Probability Seminar 1 / 59 Introduction
More informationOn the Chebyshev quadrature rule of finite part integrals
Journal of Computational and Applied Mathematics 18 25) 147 159 www.elsevier.com/locate/cam On the Chebyshev quadrature rule of finite part integrals Philsu Kim a,,1, Soyoung Ahn b, U. Jin Choi b a Major
More information