Orthogonal Polynomials, Quadratures & Sparse-Grid Methods for Probability Integrals
|
|
- Hannah Flowers
- 5 years ago
- Views:
Transcription
1 1/31 Orthogonal Polynomials, Quadratures & Sparse-Grid Methods for Probability Integrals Dr. Abebe Geletu May, 2010 Technische Universität Ilmenau, Institut für Automatisierungs- und Systemtechnik Fachgebiet Simulation und Optimale Prozesse
2 2/31 Topics Interpolatory Quadrature Rules Orthogonal Polynomials Embedded Quadrature Rules Quadrature Rules and Probability Integrals Full-Grid Tensor Product Multidimensional Integration Sparse-Grid Tensor Product Multidimensional Integration Part - I: Quadrature Rules; Part - II: Sparse-Grid Integration Methods
3 3/31 1. Interpolatory Quadrature Rules For an integrable function f : R R to compute the integral I[f] = b a f(x)φ(x)dx, where - [a, b] R is a bounde or unbounde interval; - φ : R R is a nonnegative weight function. Sometimes the weight function need to be adjusted to conform to the the properties of the integrand f, e.g. oscillatory behaviors, etc.; and the interval of integration Ω 1.
4 4/ Some integrals with standard weight functions and intervals of integration (a) I 1 [f] = (b) I 2 [f] = (c) I 3 [f] = f(x)dx φ(x) = 1;Ω 1 = [ 1, 1] f(x)(1 x) α (1+x) β dx φ(x) = (1 x) α (1+x) β,α,β > 1; ( f(x) 1 x 2) 1 2 dx φ(x) = Ω 1 = [ 1, 1] ( 1 x 2) 1 2 ;Ω 1 = [ 1, 1]
5 5/31 (d) I 4 [f] = (e) I 5 [f] = Note: f(x)x α e x dx φ(x) = x α e x,α > 1;Ω 1 = [0,+ ) f(x)e x2 dx φ(x) = e x2 ;Ω 1 = [0,+ ) transform other types of integrals to the standard ones. Example: 1 1 sin(x)e x2 dx 1 1 (sin(x)e x2 1 x 2 ) } {{ } =f(x) ( 1 x 2) 1 2 dx
6 6/ Interpolatory Quadrature Formulas To construct an N-point quadrature formula (rule): N Q 1 N [f] := w k f(x k ), k=1 where the integration nodesx = {x 1, x 2,...,x N } and weights {w 1, w 2,...w N } are constructed based on Ω 1 = [a, b] and the weight function φ. Question: How to determine the 2N unknowns x 1,..., x N and w 1,...,w N? Requirement: the weights w 1, w 2,..., w N should be non-negative to avoid numerical cancelations.
7 7/ Efficient interpolatory quadrature rules 1 Gauss qudrature rules and their extensions 2 Curtis-Clenshaw quadrature rules
8 8/ Polynomial Exactness One measure of quality for a quadrature rule is its polynomial exactness. The N-point quadrature QN 1 [ ] is said to be exact for a polynomial p m of degree m if I[p m ] = b a p m (x)φ(x)dx = Q 1 N [p m] = N w k p m (x k ) k=1 the degree of exactness or degree of accuracy d of an N-point quadrature rule is equal to the maximum degree polynomial for which QN 1 is exact.
9 1.6.Gauss Quadrature Rules and Orthogonal Polynomials An N-point Gauss quadrature rule is constructed to achieve the largest possible polynomial exactness. Theorem (see Davis & Rabinowitz [1]) An N-point quadrature formula QN 1 has degree of exactness d = 2N 1 if the integration nodes x 1, x 2,...,x N are zeros of the N th degree orthogonal polynomial p N (x) w.r.t. φ and Ω 1 = [a, b]. Hence, there is a polynomial p m with degree m > 2N 1, such that I[p m ] = Q 1 N [p m]. Example: a) A 3-point Gauss quadrature rule Q 1 3 has a polynomial exactness d = = 5 9/31
10 10/31 Orthogonal Polynomials Two polynomials p n and p m are orthogonal w.r.t. φ and Ω 1 = [a, b] if < p n, p m >:= b a p n (x)p m (x)φ(x)dx = 0. In Theorem 1, the N th degree orthogonal polynomial p N is orthogonal to all polynomials p m degree m N 1. Examples: (a) p 0 = 1, p 1 (x) = x are orthogonal w.r.t. φ(x) = 1 and Ω 1 = [ 1, 1]. (b) H 1 = 2x, H 2 (x) = 4x 2 2 are orthogonal w.r.t. φ(x) = e x2 and Ω 1 = (,+ ).
11 11/31 Characterization of Orthogonal Polynomials Theorem (Recurrence relationship, see Gatushi [2]) Suppose that p 0 = 1, p 1,... are orthogonal polynomials with deg(p n ) = n and leading coefficient equal to 1. For every integer n where p n+1 (x) = (x a n )p n (x) b n p n 1 (x), n = 1, 2... ( ) a n = b n = b a xp2 n (x)φ(x)dx b a p2 n(x)φ(x)dx, n = 1,...; b a xp2 n(x)φ(x)dx b n = 1,... a p2 n 1 (x)φ(x)dx,
12 12/31 (Continued...) Characterization of Orthogonal Polynomials Theorem (Continued...Recurrence relation) and p 1 (x) = (x a 0 )p 0 (x) = x a 0, b a a 0 = xp2 0 (x)φ(x)dx b b a p2 0 (x)φ(x)dx = a xφ(x)dx b a φ(x)dx. Remark: Given a nonnegative weight function φ and a set Ω, you can construct your own set of orthogonal polynomials if you can efficiently compute the recurrence coefficients a 0, a n, b n, n = 1, 2,...
13 13/ Algorithms to determine the recurrence coefficients Algorithms for the computation of the recurrence coefficients are commonly known as Steleje s Procedures. Currently an efficient and stable algorithm for the computation of the coefficients a 0, a n, b n, n = 1, 2,... is given by Gander & Karp [5]. Software: FORTRAN: ORTHOPOL by Gatushi [4] C++ implmentation of ORTHOPOL Fernandes & Atchley [4]. Various Matlab codes by Gatushi [1]
14 14/31 Some known sets of orthogonal polynomials Jacobi polynomials orthogonal w.r.t. φ(x) = (1 x) α (1+x) β,α,β > 1 and Ω 1 = [ 1, 1]: p (α,β) n (x) = 1 2 n n ( n+α k k=0 )( n+β n k ) (x 1) n k (1+x) k, n = 0, 1, 2,... Lagendre polynomials are the Jacobi polynomials for α = β = 0; i.e. φ(x) = 1: L n (x) = 1 2 n n k=0 ( )( ) n n (x 1) n k (1+x) k, k n k n = 0, 1, 2,...
15 15/31 Hermite Polynomials w.r.t. φ = e x2 and Ω 1 = (,+ ) [n/2] ( 1) k H n (x) = n! k!(n 2k)! (2x)n 2k, n = 0, 1, 2,... k=1 The first 6 terms of Hermite polynomials: H 0 (x) = 1, H 1 (x) = 2x, H 2 (x) = 4x 2 2 H 3 (x) = 8x 3 12x, H 4 (x) = 16x 4 48x , H 5 (x) = 32x 5 160x x H 6 (x) = 64x 6 480x x 2 120, etc.
16 16/31 Chebychev Polynomials orthogonal w.r.t. φ(x) = (1 x 2 ) 1 2 and Ω 1 = [ 1, 1] C 0 (x) = 1 2 T 0 (x), C n (x) = π π T n(x), n = 1, 2,... where T n (x) = cos(n acrcos(x)), known as Chebychev polynomials of first kind. Few terms are given by T 0 (x) = 1, T 1 (x) = x, T 2 (x) = 2x 2 1, T 3 (x) = 4x 3 3x, T 4 (x) = 8x 4 8x T 5 (x) = 16x 5 = 8x 4 20x 3 + 5x, T 6 (x) = 32x 6 48x x 2 1 Corresponding to each set of orthogonal polynomials we have the quadrature rules: Gauss-Jacobi, Gauss-Legendre, Gauss-Hermite, Gauss-Chebychev, etc.
17 17/ Computation of quadrature nodes and weights Theorem (see Gatushi [2, 3]) The quadrature nodes x 1,...,x N and weights w 1, w 2,...,w N can be obtained from the spectral factorization J n = V ΛV; Λ = diag(λ 1,λ 2,...,λ N ), VV = I N ; of the symmetric matrix tridiagonal Jacobi matrix a 0 b1 b1 a 1 b2 J n =. b an 2 bn 1 bn 1 a N 1,
18 18/31 Theorem (continued...) where a k, b k, k = 1, 2,...,N 1 are known coefficients from the recurrence relation ( ). In particular x k = λ k, k = 1, 2,...,N; ( 2, w k = e1 k) Ve k = 1, 2,...,N. Observe that: all the weights w k obtained above are nonnegative. Exercise: Write a Matlab code not longer than 10 lines to compute x k s and w k s.
19 19/ Gauss Quadrature Rules with Preassigned nodes In some application integration nodes need to be prefixed (pre-given), eg. due to boundary conditions, constraints, etc. Such nodes are usually needed in collocation methods in the solution of ODEs and PDEs. Objective: To construct an N point quadrature rule Q 1 N with x 1,...,x m, m N, are preassigned (fixed) nodes in [a, b]: determine the remaining N m nodes ; correspoindg weights w 1, w 2,..., w N so that QN 1 has the maximum possible degree of exactness d.
20 20/31 Classical Gauss quadrature rules with preassigned nodes In a closed bounded interval [a, b]: 1 Gauss-Radau rule: - One end point of [a, b] is prefixed to be a node; i.e. either x 1 = a or x N = b; the rest of the nodes x 2, x 3,...,x N (a, b). - Degree of polynomial exactness d = 2N 2. 2 Gauss-Lobatto rule: - Both end points of the interval [a, b] are prefixed to be nodes; i.e. x 1 = a and x N = b. There rest x 2,...,x N (a, n). - Degree of polynomial exactness d = 2N 3. In general, prefixing nodes reduces the degree of polynomial exactness by the number of integration nodes prefixed.
21 21/31 Recently, Bultheel et. al. [2] give Gauss qudrature rules with prefixed nodes and positive weights in any interval Ω 1 R bounded or unbounded. Software: See Gatushi [1] for Matlab codes.
22 1.10 How good are Gauss Quadrature Rules? Disadvantage: Different Gauss quadrature rules Q 1 N 1 and Q 1 N 2 have only a few common nodes, for N 1 < N 2 ; i.e. the set of nodes X 1 = {x 1, x 2,..., x N1 } [a, b] and X 2 = {z 1, z 2,..., z N2 } [a, b]. = it is difficult to estimate the convergence of the limit: lim I[f] QN 1. [f] N Note that: had it been X 1 X 2, we could have obtained I[f] QN 1 2 [f] I[f] QN 1 1 [f]. Solution: Either extended Gauss quadrature rules so that the nodes for a lower accuracy can be reused to construct quadrature rules of higher accuracy; or construct embedded quadrature rules from the start. 22/31
23 Hence, X N X 2N+1. 23/ Embedded quadrature rules - Extensions of Gauss quadrature rules A) Kronord s extension [6]: Given Gauss quadrature nodes x 1, x 2,..., x N, between every two nodes add one new node: z 1 (a, x 1 ), z 2 (x 1, x 2 ),... z N (x N 1, x n ), z n+1 (x N, b) so that the N + N + 1 = 2N + 1 points z 1, x 1, z 2, x 2,..., x N 1, z N, x N, z N+1 are the nodes of the new quadrature rules; and and the new weights w 1, w 2,..., w 2N+1 are all nonnegative. = The degree to exactness of a Gauss-Kronord rule is: { 3N + 1, if N is even d = 3N + 2, if N is odd
24 B) Patterson s extension [2]: To an existing N Gauss quadrature nodes x 1, x 2,...,x N, add m new integration nodes z 1, z 2,...,z m so the new quadrature rule has the maximum degree of accuracy d = 2(m+N) N 1 = N + 2m 1 and the weights w 1, w 2,..., w N+m are nonnegative. Hence, X N X N+m. Note: In general, for a given weight function φ and integration domain [a, b], the construction of convenient embedded Gauss-quadrature rules is not a trivial task.(see, [3, 3, 5]) Software: FORTRAN, C++, Matlab codes in the book of Kythe & Schäferkotter [1]. 24/31
25 Embedded quadrature rules- the Curtis-Clenshaw quadrature rule For integrals on [ 1, 1] (in general on a closed and bounded interval [a, b]) the set of nodes { } (k 1)π X N = x k x k = cos, k = 1, 2,..., N N 1 and the weights are computed from the orthogonal Chebychev polynomials of first type T n (x) = cos(n acrcos(x)) using Theorem 4. Properties: degree accuracy N 1; X N X 2N 1 ; nodes and weight are very simple to compute; (see Trefethen [3],Waldvogel[4] for Matlab codes) despite lower polynomial exactness, comparable efficiency with Gauss quadrature rules ( Trefethen [3]); extensive applications in spectral and pseudo-spectral 25/31
26 26/ Quadrature Rules and Probability Integrals For a well behaved nonnegative function ρ(x), if ρ(x)dx = 1, then the expression μ(x) = ρ(x)dx defines a probability measure. And ρ is termed a probability density function of x. In particular, for a random set A where Pr{x A} = μ(x A) = 1 A (x) = { 1, if x A 0, if x / A. 1 A (x)ρ(x)dx, For function f of the random variable x, its expected value is E[f] = f(x)ρ(x)dx.
27 27/31 Standard probability density functions Given a nonnegative weight function φ(x) with the property { > 0, for x [a, b] φ(x) = 0, if x / [a, b]. such that φ 0 = b a φ(x) φ(x)dx set ρ(x) := φ 0, then the expression μ(x) = ρ(x)dx defines a probability measure. Example: For φ(x) = 1 on [a, b]: φ 0 = b a ρ(x) = 1 = 1 the uniform density function. φ 0 b a
28 28/31 For φ(x) = e x2 on (,+ ): φ 0 = + e x2 = π ρ(x) = φ(x) φ 0 = e x2. π Hence, F(x) = x e z2 x e 1 2 ( 2z) 2 dz = 2dz π 2 π Setting u = 2z we have du = 2dz and F(x) = x e z2 x e 1 2 u2 dz = du. π 2π F defines the standard normal distribution.
29 29/31 Literature Davis, P. J.; Rabinowitz, P. Methods of numerical integration. Dover Publications, 2nd ed., Bultheel, A.; Cruz-Barroso, R.; Van Barel, M. On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line. Calcolo, 47(2010) Elhay, S.; Kautsky J. Generalized Kronrod Patterson type embedded quadratures. Aplikace Matematiky, 37(1992) Fernandes, A. D.; Atchley, W. R. Gaussian quadrature formulae for arbitrary positive measure. Evolutionary Bioinformatics, 2(2006) Gander, M. J.; Karp, A. H. Stable computation of high order Gauss quadrature rules using discretization for measures in radiation transfer. J. of Molecular Evolution, 53(4-5):47.
30 30/31 Gatushi, W. Orthogonal polynomials (in Matlab). J. Comp. Appl. Math. 178(2005) Gatushi, W. Orthogonal polynomials: computation and approximation. Oxford University Press, New York, Gatushi, W. Orthogonal polynomials and quadrature. Electronic Trans. of Num. Math. 9(1999) Gatushi, W. Algorithm 726: ORTHOPOL - A package of routines for generating orhtogonal polynomials and Gauss-type quadrature rules. ACM Trans. on Math. Software, 20(1994) Laurie, D. P. Calculation of Gauss-Kronord quadrature rules. Math. Comp. 66(1997) Kronord, A. S. Nodes and weights of quadrature formulas. Consultants Bureau, New York, 1965.
31 31/31 Kythe, P. K.; Schäferkotter, M. R. Handbook of computational methods for integration. Chapman & Hall/CRC, Patterson, T. N. L. The optimum addition of points to quadrature formulae. Math. Comp. 22(1968) Errata: Math. Comp. 23(1969) 892. Trefethen, L. N. Is Gauss Better than Clenshaw-Curtis? SIAM Review 50(2008) Waldvogel, J. Fast construction of the Fejer and Clenshaw-Curtis quadrature rules. BIT Numerical Mathematics 43(2004) 1 18.
Orthogonal Polynomials, Quadratures & Sparse-Grid Methods for Probability Integrals
1/33 Orthogonal Polynomials, Quadratures & Sparse-Grid Methods for Probability Integrals Dr. Abebe Geletu May, 2010 Technische Universität Ilmenau, Institut für Automatisierungs- und Systemtechnik Fachgebiet
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 informationInstructions for Matlab Routines
Instructions for Matlab Routines August, 2011 2 A. Introduction This note is devoted to some instructions to the Matlab routines for the fundamental spectral algorithms presented in the book: Jie Shen,
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 informationSlow Growth for Gauss Legendre Sparse Grids
Slow Growth for Gauss Legendre Sparse Grids John Burkardt, Clayton Webster April 4, 2014 Abstract A sparse grid for multidimensional quadrature can be constructed from products of 1D rules. For multidimensional
More informationOn Gauss-type quadrature formulas with prescribed nodes anywhere on the real line
On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line Adhemar Bultheel, Ruymán Cruz-Barroso,, Marc Van Barel Department of Computer Science, K.U.Leuven, Celestijnenlaan 2 A,
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 informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationCOMPUTATION OF GAUSS-KRONROD QUADRATURE RULES
MATHEMATICS OF COMPUTATION Volume 69, Number 231, Pages 1035 1052 S 0025-5718(00)01174-1 Article electronically published on February 17, 2000 COMPUTATION OF GAUSS-KRONROD QUADRATURE RULES D.CALVETTI,G.H.GOLUB,W.B.GRAGG,ANDL.REICHEL
More informationCALCULATION OF GAUSS-KRONROD QUADRATURE RULES. 1. Introduction A(2n+ 1)-point Gauss-Kronrod integration rule for the integral.
MATHEMATICS OF COMPUTATION Volume 66, Number 219, July 1997, Pages 1133 1145 S 0025-5718(97)00861-2 CALCULATION OF GAUSS-KRONROD QUADRATURE RULES DIRK P. LAURIE Abstract. The Jacobi matrix of the (2n+1)-point
More informationPHYS-4007/5007: Computational Physics Course Lecture Notes Appendix G
PHYS-4007/5007: Computational Physics Course Lecture Notes Appendix G Dr. Donald G. Luttermoser East Tennessee State University Version 7.0 Abstract These class notes are designed for use of the instructor
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 informationIn numerical analysis quadrature refers to the computation of definite integrals.
Numerical Quadrature In numerical analysis quadrature refers to the computation of definite integrals. f(x) a x i x i+1 x i+2 b x A traditional way to perform numerical integration is to take a piece of
More informationFully Symmetric Interpolatory Rules for Multiple Integrals over Infinite Regions with Gaussian Weight
Fully Symmetric Interpolatory ules for Multiple Integrals over Infinite egions with Gaussian Weight Alan Genz Department of Mathematics Washington State University ullman, WA 99164-3113 USA genz@gauss.math.wsu.edu
More informationSlow Exponential Growth for Clenshaw Curtis Sparse Grids jburkardt/presentations/... slow growth paper.
Slow Exponential Growth for Clenshaw Curtis Sparse Grids http://people.sc.fsu.edu/ jburkardt/presentations/...... slow growth paper.pdf John Burkardt, Clayton Webster April 30, 2014 Abstract A widely used
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 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 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 informationSTRONGLY NESTED 1D INTERPOLATORY QUADRATURE AND EXTENSION TO ND VIA SMOLYAK METHOD
6th European Conference on Computational Mechanics (ECCM 6) 7th European Conference on Computational Fluid Dynamics (ECFD 7) 1115 June 2018, Glasgow, UK STRONGLY NESTED 1D INTERPOLATORY QUADRATURE AND
More informationGENERALIZED GAUSS RADAU AND GAUSS LOBATTO FORMULAE
BIT 0006-3835/98/3804-0101 $12.00 2000, Vol., No., pp. 1 14 c Swets & Zeitlinger GENERALIZED GAUSS RADAU AND GAUSS LOBATTO FORMULAE WALTER GAUTSCHI 1 1 Department of Computer Sciences, Purdue University,
More informationIntroduction to Uncertainty Quantification in Computational Science Handout #3
Introduction to Uncertainty Quantification in Computational Science Handout #3 Gianluca Iaccarino Department of Mechanical Engineering Stanford University June 29 - July 1, 2009 Scuola di Dottorato di
More informationSpectral Representation of Random Processes
Spectral Representation of Random Processes Example: Represent u(t,x,q) by! u K (t, x, Q) = u k (t, x) k(q) where k(q) are orthogonal polynomials. Single Random Variable:! Let k (Q) be orthogonal with
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 informationAccuracy, Precision and Efficiency in Sparse Grids
John, Information Technology Department, Virginia Tech.... http://people.sc.fsu.edu/ jburkardt/presentations/ sandia 2009.pdf... Computer Science Research Institute, Sandia National Laboratory, 23 July
More informationGAUSS-KRONROD QUADRATURE FORMULAE A SURVEY OF FIFTY YEARS OF RESEARCH
Electronic Transactions on Numerical Analysis. Volume 45, pp. 371 404, 2016. Copyright c 2016,. ISSN 1068 9613. ETNA GAUSS-KRONROD QUADRATURE FORMULAE A SURVEY OF FIFTY YEARS OF RESEARCH SOTIRIOS E. NOTARIS
More informationGauss Hermite interval quadrature rule
Computers and Mathematics with Applications 54 (2007) 544 555 www.elsevier.com/locate/camwa Gauss Hermite interval quadrature rule Gradimir V. Milovanović, Alesandar S. Cvetović Department of Mathematics,
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 9, 1999, pp. 39-52. Copyright 1999,. ISSN 1068-9613. ETNA QUADRATURE FORMULAS FOR RATIONAL FUNCTIONS F. CALA RODRIGUEZ, P. GONZALEZ VERA, AND M. JIMENEZ
More informationDifferentiation and Integration
Differentiation and Integration (Lectures on Numerical Analysis for Economists II) Jesús Fernández-Villaverde 1 and Pablo Guerrón 2 February 12, 2018 1 University of Pennsylvania 2 Boston College Motivation
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 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 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 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 informationOn the remainder term of Gauss Radau quadratures for analytic functions
Journal of Computational and Applied Mathematics 218 2008) 281 289 www.elsevier.com/locate/cam On the remainder term of Gauss Radau quadratures for analytic functions Gradimir V. Milovanović a,1, Miodrag
More informationSzegő-Lobatto quadrature rules
Szegő-Lobatto quadrature rules Carl Jagels a,, Lothar Reichel b,1, a Department of Mathematics and Computer Science, Hanover College, Hanover, IN 47243, USA b Department of Mathematical Sciences, Kent
More informationBeyond Wiener Askey Expansions: Handling Arbitrary PDFs
Journal of Scientific Computing, Vol. 27, Nos. 1 3, June 2006 ( 2005) DOI: 10.1007/s10915-005-9038-8 Beyond Wiener Askey Expansions: Handling Arbitrary PDFs Xiaoliang Wan 1 and George Em Karniadakis 1
More informationSparse Grids for Stochastic Integrals
John, Information Technology Department, Virginia Tech.... http://people.sc.fsu.edu/ jburkardt/presentations/ fsu 2009.pdf... Department of Scientific Computing, Florida State University, 08 October 2009.
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 informationOn the solution of integral equations of the first kind with singular kernels of Cauchy-type
International Journal of Mathematics and Computer Science, 7(202), no. 2, 29 40 M CS On the solution of integral equations of the first kind with singular kernels of Cauchy-type G. E. Okecha, C. E. Onwukwe
More informationPascal s Triangle on a Budget. Accuracy, Precision and Efficiency in Sparse Grids
Covering : Accuracy, Precision and Efficiency in Sparse Grids https://people.sc.fsu.edu/ jburkardt/presentations/auburn 2009.pdf... John Interdisciplinary Center for Applied Mathematics & Information Technology
More informationDimension-adaptive sparse grid for industrial applications using Sobol variances
Master of Science Thesis Dimension-adaptive sparse grid for industrial applications using Sobol variances Heavy gas flow over a barrier March 11, 2015 Ad Dimension-adaptive sparse grid for industrial
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 informationRational Gauss-Radau and rational Szegő-Lobatto quadrature on the interval and the unit circle respectively
Rational Gauss-Radau and rational Szegő-Lobatto quadrature on the interval and the unit circle respectively Francisco Perdomo-Pio Departament of Mathematical Analysis. La Laguna University. 38271 La Laguna.
More informationA Note on Extended Gaussian Quadrature
MATHEMATICS OF COMPUTATION, VOLUME 30, NUMBER 136 OCTOBER 1976, PAGES 812-817 A Note on Extended Gaussian Quadrature Rules By Giovanni Monegato* Abstract. Extended Gaussian quadrature rules of the type
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 informationA collocation method for solving the fractional calculus of variation problems
Bol. Soc. Paran. Mat. (3s.) v. 35 1 (2017): 163 172. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v35i1.26333 A collocation method for solving the fractional
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 informationSection 5.3, Exercise 22
The Legendre equation is where α is a constant. Section 5.3, Exercise 22 (1 x 2 ) 2x + α(α + 1) 0 Determine two linearl independent solutions in powers of x for x < 1. Assume (x) a n x n and substitute
More informationOn the Computation of Confluent Hypergeometric Functions for Large Imaginary Part of Parameters b and z
On the Computation of Confluent Hypergeometric Functions for Large Imaginary Part of Parameters b and z Guillermo Navas-Palencia 1 and Argimiro Arratia 2 1 Numerical Algorithms Group Ltd, UK, and Dept.
More informationApproximation Theory
Approximation Theory Function approximation is the task of constructing, for a given function, a simpler function so that the difference between the two functions is small and to then provide a quantifiable
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 informationQuadrature Rules With an Even Number of Multiple Nodes and a Maximal Trigonometric Degree of Exactness
Filomat 9:10 015), 39 55 DOI 10.98/FIL151039T Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Quadrature Rules With an Even Number
More informationGaussian interval quadrature rule for exponential weights
Gaussian interval quadrature rule for exponential weights Aleksandar S. Cvetković, a, Gradimir V. Milovanović b a Department of Mathematics, Faculty of Mechanical Engineering, University of Belgrade, Kraljice
More informationThe inverse of a tridiagonal matrix
Linear Algebra and its Applications 325 (2001) 109 139 www.elsevier.com/locate/laa The inverse of a tridiagonal matrix Ranjan K. Mallik Department of Electrical Engineering, Indian Institute of Technology,
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 informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 39, pp. 1-11, 1. Copyright 1,. ISSN 168-9613. ETNA TRIGONOMETRIC GAUSSIAN QUADRATURE ON SUBINTERVALS OF THE PERIOD GASPARE DA FIES AND MARCO VIANELLO
More informationRomberg Integration and Gaussian Quadrature
Romberg Integration and Gaussian Quadrature P. Sam Johnson October 17, 014 P. Sam Johnson (NITK) Romberg Integration and Gaussian Quadrature October 17, 014 1 / 19 Overview We discuss two methods for integration.
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 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 informationQuadrature for Uncertainty Analysis Stochastic Collocation. What does quadrature have to do with uncertainty?
Quadrature for Uncertainty Analysis Stochastic Collocation What does quadrature have to do with uncertainty? Quadrature for Uncertainty Analysis Stochastic Collocation What does quadrature have to do with
More informationNumerische Mathematik
Numer. Math. (2000) 86: 617 633 Digital Object Identifier (DOI) 10.1007/s002110000186 Numerische Mathematik Quadrature rules for rational functions Walter Gautschi 1, Laura Gori 2, M. Laura Lo Cascio 2
More informationMa 530 Power Series II
Ma 530 Power Series II Please note that there is material on power series at Visual Calculus. Some of this material was used as part of the presentation of the topics that follow. Operations on Power Series
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 informationMONOTONICITY OF THE ERROR TERM IN GAUSS TURÁN QUADRATURES FOR ANALYTIC FUNCTIONS
ANZIAM J. 48(27), 567 581 MONOTONICITY OF THE ERROR TERM IN GAUSS TURÁN QUADRATURES FOR ANALYTIC FUNCTIONS GRADIMIR V. MILOVANOVIĆ 1 and MIODRAG M. SPALEVIĆ 2 (Received March 19, 26) Abstract For Gauss
More informationA Product Integration Approach Based on New Orthogonal Polynomials for Nonlinear Weakly Singular Integral Equations
Acta Appl Math (21) 19: 861 873 DOI 1.17/s144-8-9351-y A Product Integration Approach Based on New Orthogonal Polynomials for Nonlinear Weakly Singular Integral Equations M. Rasty M. Hadizadeh Received:
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 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 informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
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 informationWaves on 2 and 3 dimensional domains
Chapter 14 Waves on 2 and 3 dimensional domains We now turn to the studying the initial boundary value problem for the wave equation in two and three dimensions. In this chapter we focus on the situation
More informationComputation of Rational Szegő-Lobatto Quadrature Formulas
Computation of Rational Szegő-Lobatto Quadrature Formulas Joint work with: A. Bultheel (Belgium) E. Hendriksen (The Netherlands) O. Njastad (Norway) P. GONZÁLEZ-VERA Departament of Mathematical Analysis.
More informationGauss-Lobatto to Bernstein polynomials transformation
Gauss-Lobatto to Bernstein polynomials transformation Loredana Coluccio, Alfredo Eisinberg, Giuseppe Fedele Dip. Elettronica Informatica e Sistemistica, Università degli Studi della Calabria, 87036, Rende
More informationIntroduction. Finite and Spectral Element Methods Using MATLAB. Second Edition. C. Pozrikidis. University of Massachusetts Amherst, USA
Introduction to Finite and Spectral Element Methods Using MATLAB Second Edition C. Pozrikidis University of Massachusetts Amherst, USA (g) CRC Press Taylor & Francis Group Boca Raton London New York CRC
More informationMultidimensional interpolation. 1 An abstract description of interpolation in one dimension
Paul Klein Department of Economics University of Western Ontario FINNISH DOCTORAL PROGRAM IN ECONOMICS Topics in Contemporary Macroeconomics August 2008 Multidimensional interpolation 1 An abstract description
More informationNumerical Programming I (for CSE)
Technische Universität München WT 1/13 Fakultät für Mathematik Prof. Dr. M. Mehl B. Gatzhammer January 1, 13 Numerical Programming I (for CSE) Tutorial 1: Iterative Methods 1) Relaxation Methods a) Let
More information14 EE 2402 Engineering Mathematics III Solutions to Tutorial 3 1. For n =0; 1; 2; 3; 4; 5 verify that P n (x) is a solution of Legendre's equation wit
EE 0 Engineering Mathematics III Solutions to Tutorial. For n =0; ; ; ; ; verify that P n (x) is a solution of Legendre's equation with ff = n. Solution: Recall the Legendre's equation from your text or
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 informationNumerical integration formulas of degree two
Applied Numerical Mathematics 58 (2008) 1515 1520 www.elsevier.com/locate/apnum Numerical integration formulas of degree two ongbin Xiu epartment of Mathematics, Purdue University, West Lafayette, IN 47907,
More informationarxiv: v2 [math.na] 21 Apr 2016
GENERATING NESTED QUADRATURE FORMULAS FOR GENERAL WEIGHT FUNCTIONS WITH KNOWN MOMENTS arxiv:1203.1554v2 [math.na] 21 Apr 2016 SANJAY MEHROTRA AND DÁVID PAPP Abstract. We revisit the problem of extending
More informationTrigonometric Gaussian quadrature on subintervals of the period
Trigonometric Gaussian quadrature on subintervals of the period Gaspare Da Fies and Marco Vianello 1 April 24, 212 Abstract We construct a quadrature formula with angles and positive weights, exact in
More informationSlow Growth for Sparse Grids
Slow Growth for Sparse Grids John Burkardt, Clayton Webster, Guannan Zhang... http://people.sc.fsu.edu/ jburkardt/presentations/... slow growth 2014 savannah.pdf... SIAM UQ Conference 31 March - 03 April
More informationIntegration using Gaussian Quadrature
Integration using Gaussian Quadrature Tutorials November 25, 2017 Department of Aeronautics, Imperial College London, UK Scientific Computing and Imaging Institute, University of Utah, USA 2 Chapter 1
More informationThe Derivation of Interpolants for Nonlinear Two-Point Boundary Value Problems
European Society of Computational Methods in Sciences and Engineering ESCMSE) Journal of Numerical Analysis, Industrial and Applied Mathematics JNAIAM) vol. 1, no. 1, 2006, pp. 49-58 ISSN 1790 8140 The
More informationSlow Exponential Growth for Clenshaw Curtis Sparse Grids
Slow Exponential Growth for Clenshaw Curtis Sparse Grids John Burkardt Interdisciplinary Center for Applied Mathematics & Information Technology Department Virginia Tech... http://people.sc.fsu.edu/ burkardt/presentations/sgmga
More informationTaylor Series. Math114. March 1, Department of Mathematics, University of Kentucky. Math114 Lecture 18 1/ 13
Taylor Series Math114 Department of Mathematics, University of Kentucky March 1, 2017 Math114 Lecture 18 1/ 13 Given a function, can we find a power series representation? Math114 Lecture 18 2/ 13 Given
More informationA new class of highly accurate differentiation schemes based on the prolate spheroidal wave functions
We introduce a new class of numerical differentiation schemes constructed for the efficient solution of time-dependent PDEs that arise in wave phenomena. The schemes are constructed via the prolate spheroidal
More informationThe Optimum Addition of Points to Quadrature Formulae*
The Optimum Addition of Points to Quadrature Formulae* By T. N. L. Patterson Abstract. Methods are developed for the addition of points in an optimum manner to the Gauss, Lobatto and general quadrature
More informationResearch Computing with Python, Lecture 7, Numerical Integration and Solving Ordinary Differential Equations
Research Computing with Python, Lecture 7, Numerical Integration and Solving Ordinary Differential Equations Ramses van Zon SciNet HPC Consortium November 25, 2014 Ramses van Zon (SciNet HPC Consortium)Research
More informationCh. 03 Numerical Quadrature. Andrea Mignone Physics Department, University of Torino AA
Ch. 03 Numerical Quadrature Andrea Mignone Physics Department, University of Torino AA 2017-2018 Numerical Quadrature In numerical analysis quadrature refers to the computation of definite integrals. y
More informationSolving the steady state diffusion equation with uncertainty Final Presentation
Solving the steady state diffusion equation with uncertainty Final Presentation Virginia Forstall vhfors@gmail.com Advisor: Howard Elman elman@cs.umd.edu Department of Computer Science May 6, 2012 Problem
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 information(f,g) = f Wix)fix)gix) dx.
GAUSSIAN QUADRATURE FORMULAE FOR In ix)fix) dx 477 Gaussian Quadrature,1 Formulae for / In (x)f(x) dx By Donald G. Anderson 1. Introduction. The table of Gaussian quadrature formulae for integrals of the
More informationNumerical quadratures and orthogonal polynomials
Stud. Univ. Babeş-Bolyai Math. 56(2011), No. 2, 449 464 Numerical quadratures and orthogonal polynomials Gradimir V. Milovanović Abstract. Orthogonal polynomials of different kinds as the basic tools play
More informationNEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE
NEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE Quoc T. Le Gia Ian H. Sloan Yu Guang Wang Robert S. Womersley School of Mathematics and Statistics University of New South Wales, Australia
More informationPositive Denite Matrix. Ya Yan Lu 1. Department of Mathematics. City University of Hong Kong. Kowloon, Hong Kong. Abstract
Computing the Logarithm of a Symmetric Positive Denite Matrix Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A numerical method for computing the logarithm
More informationCOURSE Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method
COURSE 7 3. Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method The presence of derivatives in the remainder difficulties in applicability to practical problems
More informationOverlapping Schwarz preconditioners for Fekete spectral elements
Overlapping Schwarz preconditioners for Fekete spectral elements R. Pasquetti 1, L. F. Pavarino 2, F. Rapetti 1, and E. Zampieri 2 1 Laboratoire J.-A. Dieudonné, CNRS & Université de Nice et Sophia-Antipolis,
More informationConvergence and Stability of a New Quadrature Rule for Evaluating Hilbert Transform
Convergence and Stability of a New Quadrature Rule for Evaluating Hilbert Transform Maria Rosaria Capobianco CNR - National Research Council of Italy Institute for Computational Applications Mauro Picone,
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 informationNumerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.
Unit IV Numerical Integration and Differentiation Numerical integration and differentiation quadrature classical formulas for equally spaced nodes improper integrals Gaussian quadrature and orthogonal
More informationOutline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation
Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data
More information