A fast Chebyshev Legendre transform using an asymptotic formula
|
|
- Charles Cunningham
- 6 years ago
- Views:
Transcription
1 A fast Chebyshev Legendre transform using an asymptotic formula Alex Townsend MIT (Joint work with ick Hale) SIAM OPSFA, 5th June 2015
2 Introduction What is the Chebyshev Legendre transform? Suppose we have a degree 1 polynomial. It can be expressed in the Chebyshev or Legendre polynomial basis: p 1 pxq 1 ÿ k 0 The Chebyshev Legendre transform: c leg 0,..., cleg Applications in: Convolution [Hale & T., 14] Legendre-tau spectral methods QR of a quasimatrix [Trefethen, 08] best least squares approximation c leg 1 ÿ P k k pxq ðñ p 1 pxq forward transform ÝÝÝÝÝÝÝÝÝÝÝÝÝá k 0 c cheb k T k pxq Opplog q 2 { log log q c cheb,..., c cheb 1 0 âýýýýýýýýýýýýý inverse transform 1. Alex MIT 1/18
3 Introduction What is the Chebyshev Legendre transform? Suppose we have a degree 1 polynomial. It can be expressed in the Chebyshev or Legendre polynomial basis: p 1 pxq 1 ÿ k 0 The Chebyshev Legendre transform: c leg 0,..., cleg Applications in: Convolution [Hale & T., 14] Legendre-tau spectral methods QR of a quasimatrix [Trefethen, 08] best least squares approximation c leg 1 ÿ P k k pxq ðñ p 1 pxq forward transform ÝÝÝÝÝÝÝÝÝÝÝÝÝá k 0 c cheb k T k pxq Opplog q 2 { log log q c cheb,..., c cheb 1 0 âýýýýýýýýýýýýý inverse transform 1. Alex MIT 1/18
4 Introduction What is the Chebyshev Legendre transform? Suppose we have a degree 1 polynomial. It can be expressed in the Chebyshev or Legendre polynomial basis: p 1 pxq 1 ÿ k 0 The Chebyshev Legendre transform: c leg 0,..., cleg Applications in: Convolution [Hale & T., 14] Legendre-tau spectral methods QR of a quasimatrix [Trefethen, 08] best least squares approximation c leg 1 ÿ P k k pxq ðñ p 1 pxq forward transform ÝÝÝÝÝÝÝÝÝÝÝÝÝá k 0 c cheb k T k pxq Opplog q 2 { log log q c cheb,..., c cheb 1 0 âýýýýýýýýýýýýý inverse transform 1. Alex MIT 1/18
5 Introduction Related work Values at Chebyshev points Potts et al. O `plog q 2 Mori et al. O p log q discrete cosine transform O p log q Legendre coefficients Alpert & Rokhlin O pq Chebyshev coefficients Values in the complex plane Iserles O p log q Tygert O `plog q 2 Values at Legendre points ew features of our algorithms FFT-based approach Analysis-based o precomputation Alex MIT 2/18
6 Introduction The fast Fourier transform The FFT computes the DFT in Op log q operations: X k ř 1 n 0 x n e 2πink{, 0 ď k ď 1. Top 10 algorithm e 2πit sinp 2πtq Imag axis ; James Cooley t cosp 2πtq Real axis ; John Tukey Alex MIT 3/18
7 Introduction Many special functions are trigonometric-like Trigonometric functions cospωxq, sinpωxq Chebyshev polynomials T n pxq Legendre polynomials P n pxq Bessel functions J ν pzq Airy functions Aipxq Also, Jacobi polynomials, Hermite polynomials, cylinder functions, etc. Alex MIT 4/18
8 Introduction Many special functions are trigonometric-like Trigonometric functions cospωxq, sinpωxq Chebyshev polynomials T n pxq Legendre polynomials P n pxq Bessel functions J ν pzq Airy functions Aipxq Also, Jacobi polynomials, Hermite polynomials, cylinder functions, etc. Alex MIT 4/18
9 Introduction Many special functions are trigonometric-like Trigonometric functions cospωxq, sinpωxq Chebyshev polynomials T n pxq Legendre polynomials P n pxq Bessel functions J ν pzq Airy functions Aipxq Also, Jacobi polynomials, Hermite polynomials, cylinder functions, etc. Alex MIT 4/18
10 Introduction Many special functions are trigonometric-like Trigonometric functions cospωxq, sinpωxq Chebyshev polynomials T n pxq Legendre polynomials P n pxq Bessel functions J ν pzq Airy functions Aipxq Also, Jacobi polynomials, Hermite polynomials, cylinder functions, etc. Alex MIT 4/18
11 Introduction Many special functions are trigonometric-like Trigonometric functions cospωxq, sinpωxq Chebyshev polynomials T n pxq Legendre polynomials P n pxq Bessel functions J ν pzq Airy functions Aipxq Also, Jacobi polynomials, Hermite polynomials, cylinder functions, etc. Alex MIT 4/18
12 Introduction Many special functions are trigonometric-like Trigonometric functions cospωxq, sinpωxq Chebyshev polynomials T n pxq Legendre polynomials P n pxq Bessel functions J ν pzq Airy functions Aipxq Also, Jacobi polynomials, Hermite polynomials, cylinder functions, etc. Alex MIT 4/18
13 Introduction An asymptotic expansion of Legendre polynomials Legendre polynomials M 1 ÿ P n pcos θq C n C n m 0 cos`pm ` n ` 1 1 2qθ pm ` 2 h q π 2 m,n p2 sin θq m`1{2 c # 4 Γpn ` 1q π Γpn ` 3{2q, h m,n ś m j 1 ` R n,m pθq 1, m 0, pj 1{2q 2 jpn`j`1{2q, m ą 0. Thomas Stieltjes Boundary Region: Bessel like Interior Region: Trig like Alex MIT 5/18
14 Introduction umerical pitfalls of an asymptotic expansionist M 1 ÿ P n pcos θq C n m 0 cos`pm ` n ` 1 1 2qθ pm ` 2 h q π 2 m,n ` R p2 sin θq m`1{2 n,m pθq M 1 Rn,Mpθq M 3 M 5, 7 n 1,000 x Fix M. Where is the asymptotic expansion accurate? Alex MIT 6/18
15 Computing the Chebyshev Legendre transform The transform comes in two parts The Chebyshev Legendre transform naturally splits into two parts: This bit ÝÝÝÝÝÝÝá c leg 0,..., cleg p 1 1 px cheb q,..., p 0 1 px cheb âýýýýýýý IDCT ÝÝÝÝÝÝá 1 q ccheb DCT âýýýýýý 0,..., c cheb 1 Task: Compute the following matrix-vector product in quasilinear time? P 0 pcos θ 0 q... P 1 pcos θ 0 q c leg P c , θ k kπ 1 P 0 pcos θ 1 q... P 1 pcos θ 1 q c leg 1 Alex MIT 7/18
16 Computing the Chebyshev Legendre transform The transform comes in two parts The Chebyshev Legendre transform naturally splits into two parts: This bit ÝÝÝÝÝÝÝá c leg 0,..., cleg p 1 1 px cheb q,..., p 0 1 px cheb âýýýýýýý IDCT ÝÝÝÝÝÝá 1 q ccheb DCT âýýýýýý 0,..., c cheb 1 Task: Compute the following matrix-vector product in quasilinear time? P 0 pcos θ 0 q... P 1 pcos θ 0 q c leg P c , θ k kπ 1 P 0 pcos θ 1 q... P 1 pcos θ 1 q c leg 1 Alex MIT 7/18
17 Computing the Chebyshev Legendre transform Asymptotic expansions as a matrix decomposition The asymptotic expansion M 1 ÿ P n pcos θ k q C n m 0 cos`pm ` n ` 1 2 h qθ k pm ` 1 2 q π 2 m,n ` R p2 sin θ k q m`1{2 n,m pθ k q gives a matrix decomposition (sum of diagonally scaled DCTs and DSTs):» fi M 1 ÿ P D um C D Chm ` D vm 0 S 2 0fl D Chm ` R,M. m P ` P ASY R,M Alex MIT 8/18
18 Computing the Chebyshev Legendre transform Asymptotic expansions as a matrix decomposition The asymptotic expansion M 1 ÿ P n pcos θ k q C n m 0 cos`pm ` n ` 1 2 h qθ k pm ` 1 2 q π 2 m,n ` R p2 sin θ k q m`1{2 n,m pθ k q gives a matrix decomposition (sum of diagonally scaled DCTs and DSTs):» fi M 1 ÿ P D um C D Chm ` D vm 0 S 2 0fl D Chm ` R,M. m P ` P ASY R,M Alex MIT 8/18
19 Computing the Chebyshev Legendre transform Asymptotic expansions as a matrix decomposition The asymptotic expansion M 1 ÿ P n pcos θ k q C n m 0 cos`pm ` n ` 1 2 h qθ k pm ` 1 2 q π 2 m,n ` R p2 sin θ k q m`1{2 n,m pθ k q gives a matrix decomposition (sum of diagonally scaled DCTs and DSTs):» fi M 1 ÿ P D um C D Chm ` D vm 0 S 2 0fl D Chm ` R,M. m P ` P ASY R,M Alex MIT 8/18
20 Computing the Chebyshev Legendre transform Be careful and stay safe Error curve: R n,m pθ k q ɛ Fix M. Where is the asymptotic expansion accurate? R,M M 5 M 7 M 6 M 15 R n,m pθ k q ď 2C n h M,n p2 sin θ k q M`1{2 Alex MIT 9/18
21 Computing the Chebyshev Legendre transform Partitioning and balancing competing costs α 3 α 2 α P EVAL P P (3) P (2) P (1) Theorem The matrix-vector product f P c can be computed in Opplog q 2 { loglog q operations. α too small P EVAL c Op 2 q P (j) c Op log q Alex MIT 10/18
22 Computing the Chebyshev Legendre transform Partitioning and balancing competing costs α 3 α 2 α P EVAL P P (3) P (2) P (1) Theorem The matrix-vector product f P c can be computed in Opplog q 2 { loglog q operations. α too small P EVAL c Op 2 q P (j) c Op log q Alex MIT 10/18
23 Computing the Chebyshev Legendre transform Partitioning and balancing competing costs α 3 α 2 α P EVAL P P (3) P (2) P (1) Theorem The matrix-vector product f P c can be computed in Opplog q 2 { loglog q operations. α too small P EVAL c Op 2 q P (j) c Op log q Alex MIT 10/18
24 Computing the Chebyshev Legendre transform Partitioning and balancing competing costs α 3 α 2 α P EVAL P P (3) P (2) P (1) Theorem The matrix-vector product f P c can be computed in Opplog q 2 { loglog q operations. P (j) c α too large Op 2 log q P EVAL c Op log q Alex MIT 11/18
25 Computing the Chebyshev Legendre transform Partitioning and balancing competing costs α 3 α 2 α P EVAL P P (3) P (2) P (1) Theorem The matrix-vector product f P c can be computed in Opplog q 2 { loglog q operations. α Op1{ log q P (j) c Opplog q 2 { loglog q P EVAL c Opplog q 2 { loglog q Alex MIT 12/18
26 Computing the Chebyshev Legendre transform umerical results Mollification of rough signals Op 2 q Opplog q 2 { loglog q o precomputation. ż 1 1 d P pxqe iωx n dx i m 2π ω J m`1{2p ωq Alex MIT 13/18
27 Computing the Chebyshev Legendre transform The inverse Chebyshev Legendre transform The integral formula for Legendre coefficients gives the following relation: c leg j I `1 0 Ds2 P 2 px cheb 2 qt D w2 T 2 px cheb 2 q I`1 c 0 cheb, 2α 3 2α 2 2α i 1 1 i1 2 i 1 3 P EVAL T 2 P (3) T 2 P (2) T 2 P (1) T 2 Execution time Op 2 q Opplog q 2 { loglog q 2 P 2 px cheb 2 qt Alex MIT 14/18
28 Future work Fast spherical harmonic transform Spherical harmonic transform: fpθ, φq 1 ÿ lÿ l 0 m l α m l P m pcos θqe imφ l [Mohlenkamp, 1999], [Rokhlin & Tygert, 2006], [Tygert, 2008] A new generation of fast transforms with no precomputation. Alex MIT 15/18
29 Thank you Thank you Alex MIT 16/18
30 References D. H. Bailey, K. Jeyabalan, and X. S. Li, A comparison of three high-precision quadrature schemes, P. Baratella and I. Gatteschi, The bounds for the error term of an asymptotic approximation of Jacobi polynomials, Lecture notes in Mathematics, Z. Battels and L.. Trefethen, An extension of Matlab to continuous functions and operators, SISC, Iteration-free computation of Gauss Legendre quadrature nodes and weights, SISC, G. H. Golub and J. H. Welsch, Calculation of Gauss quadrature rules, Math. Comput., Hale and A. Townsend, Fast and accurate computation of Gauss Legendre and Gauss Jacobi quadrature nodes and weights, SISC, Hale and A. Townsend, A fast, simple, and stable Chebyshev Legendre transform using an asymptotic formula, SISC, Y. akatsukasa, V. oferini, and A. Townsend, Computing the common zeros of two bivariate functions via Bezout resultants, umerische Mathematik, Alex MIT 17/18
31 References F. W. J. Olver, Asymptotics and Special Functions, Academic Press, ew York, A. Townsend and L.. Trefethen, An extension of Chebfun to two dimensions, SISC, A. Townsend, T. Trogdon, and S. Olver, Fast computation of Gauss quadrature nodes and weights on the whole real line, to appear in IMA umer. Anal., A. Townsend, The race to compute high-order Gauss quadrature, SIAM ews, A. Townsend, A fast analysis-based discrete Hankel transform using asymptotics expansions, submitted, F. G. Tricomi, Sugli zeri dei polinomi sferici ed ultrasferici, Ann. Mat. Pura. Appl., Alex MIT 18/18
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 informationA fast analysis-based discrete Hankel transform using asymptotic expansions
A fast analysis-based discrete Hankel transform using asymptotic expansions Alex Townsend MIT IMA Leslie Fox Prize Meeting, 22nd June, 2015 Based on: T., A fast analysis-based discrete Hankel transform
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 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 informationKey words. Hankel transform, Bessel functions, asymptotic expansions, fast Fourier transform
A FAST AALYSIS-BASED DISCRETE HAKEL TRASFORM USIG ASYMPTOTIC EXPASIOS ALEX TOWSED Abstract. A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order 0 as
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 informationFast algorithms for Jacobi expansions via nonoscillatory phase functions
Fast algorithms for Jacobi expansions via nonoscillatory phase functions James Bremer a, Haizhao Yang b a Department of Mathematics, University of California, Davis b Department of Mathematics, National
More informationBeyond Chebyshev technology. Alex Townsend MIT
Beyond Chebyshev technology Strthclyde, 25th June 215 26th Biennil Numericl Anlysis Conference Alex Townsend MIT Joint work with Nick Hle nd Sheehn Olver Beyond Chebyshev technology Strthclyde, 25th June
More informationINTEGRAL TRANSFORMS and THEIR APPLICATIONS
INTEGRAL TRANSFORMS and THEIR APPLICATIONS Lokenath Debnath Professor and Chair of Mathematics and Professor of Mechanical and Aerospace Engineering University of Central Florida Orlando, Florida CRC Press
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. SCI. COMPUT. Vol. 7, No. 6, pp. 1903 198 c 006 Society for Industrial and Applied Mathematics FAST ALGORITHMS FOR SPHERICAL HARMONIC EXPANSIONS VLADIMIR ROKHLIN AND MARK TYGERT Abstract. An algorithm
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 informationFourier extension and sampling on the sphere
Fourier extension and sampling on the sphere Daniel Potts Technische Universität Chemnitz Faculty of Mathematics 97 Chemnitz, Germany Email: potts@mathematiktu-chemnitzde iel Van Buggenhout KU Leuven Faculty
More informationTowards a Faster Spherical Harmonic transform
Towards a Faster Spherical Harmonic transform Nathanaël Schaeffer LGIT / CNRS / Université Joseph Fourier IUGG CMG, Pisa, 7 May 2010 N. Schaeffer (LGIT/CNRS/UJF) Towards a faster SHT IUGG CMG, Pisa, 7
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 informationFast Algorithms for Spherical Harmonic Expansions
Fast Algorithms for Spherical Harmonic Expansions Vladimir Rokhlin and Mark Tygert Research Report YALEU/DCS/RR-1309 December 17, 004 Abstract An algorithm is introduced for the rapid evaluation at appropriately
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 informationCalculation of Highly Oscillatory Integrals by Quadrature Method
Calculation of Highly Oscillatory Integrals by Quadrature Methods Krishna Thapa Texas A&M University, College Station, TX May 18, 211 Outline Purpose Why Filon Type Quadrature Methods Our Expectations
More informationMA3232 Numerical Analysis Week 9. James Cooley (1926-)
MA umerical Analysis Week 9 James Cooley (96-) James Cooley is an American mathematician. His most significant contribution to the world of mathematics and digital signal processing is the Fast Fourier
More informationFast Structured Spectral Methods
Spectral methods HSS structures Fast algorithms Conclusion Fast Structured Spectral Methods Yingwei Wang Department of Mathematics, Purdue University Joint work with Prof Jie Shen and Prof Jianlin Xia
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 informationKey words. convolution, Legendre polynomial, spherical Bessel function, Fourier transform
AN ALGORITHM FOR THE CONVOLUTION OF LEGENDRE SERIES NICHOLAS HALE AND ALEX TOWNSEND Abstract. An O(N ) algorithm for the convolution of compactly supported Legendre series is described. The algorithm is
More informationA FAST SPHERICAL HARMONICS TRANSFORM ALGORITHM
MATHEMATICS OF COMPUTATION Volume 71, Number 238, Pages 703 715 S 0025-5718(01)01386-2 Article electronically published on November 28, 2001 A FAST SPHERICAL HARMONICS TRANSFORM ALGORITHM REIJI SUDA AND
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 informationA fast and well-conditioned spectral method: The US method
A fast and well-conditioned spectral method: The US method Alex Townsend University of Oxford Leslie Fox Prize, 24th of June 23 Partially based on: S. Olver & T., A fast and well-conditioned spectral method,
More informationExplicit construction of rectangular differentiation matrices
IMA Journal of Numerical Analysis (206) 36, 68 632 doi:0.093/imanum/drv03 Advance Access publication on April 26, 205 Explicit construction of rectangular differentiation matrices Kuan Xu Mathematical
More informationFast Multipole Methods for The Laplace Equation. Outline
Fast Multipole Methods for The Laplace Equation Ramani Duraiswami Nail Gumerov Outline 3D Laplace equation and Coulomb potentials Multipole and local expansions Special functions Legendre polynomials Associated
More informationChebfun2: Exploring Constant Coefficient PDEs on Rectangles
Chebfun2: Exploring Constant Coefficient PDEs on Rectangles Alex Townsend Oxford University with Sheehan Olver, Sydney University FUN13 workshop, 11th of April 2013 Alex Townsend Constant coefficient PDEs
More informationarxiv: v1 [math.na] 4 Nov 2015
ON WELL-CONDITIONED SPECTRAL COLLOCATION AND SPECTRAL METHODS BY THE INTEGRAL REFORMULATION KUI DU arxiv:529v [mathna 4 Nov 25 Abstract Well-conditioned spectral collocation and spectral methods have recently
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 informationA Fast Spherical Filter with Uniform Resolution
JOURNAL OF COMPUTATIONAL PHYSICS 136, 580 584 (1997) ARTICLE NO. CP975782 A Fast Spherical Filter with Uniform Resolution Rüdiger Jakob-Chien*, and Bradley K. Alpert *Department of Computer Science & Engineering,
More informationQuadrature Formula for Computed Tomography
Quadrature Formula for Computed Tomography orislav ojanov, Guergana Petrova August 13, 009 Abstract We give a bivariate analog of the Micchelli-Rivlin quadrature for computing the integral of a function
More informationExamples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.
s of the Fourier Theorem (Sect. 1.3. The Fourier Theorem: Continuous case. : Using the Fourier Theorem. The Fourier Theorem: Piecewise continuous case. : Using the Fourier Theorem. The Fourier Theorem:
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 informationLecture 4.6: Some special orthogonal functions
Lecture 4.6: Some special orthogonal functions Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4340, Advanced Engineering Mathematics
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 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 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 informationFFTs for the 2-Sphere Improvements and Variations
FFTs for the -Sphere Improvements and Variations D.M. Healy Jr., D. Rockmore and P. J. Kostelec Department of Mathematics Dartmouth College Hanover, NH 03755 Sean S. B. Moore BBN Systems and Technologies
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 informationAsymptotic Analysis 1: Limits and Asymptotic Equality
Asymptotic Analysis 1: Limits and Asymptotic Equality Andreas Klappenecker and Hyunyoung Lee Texas A&M University 1 / 15 Motivation In asymptotic analysis, our goal is to compare a function f pnq with
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 informationOrthogonal polynomials
Orthogonal polynomials Gérard MEURANT October, 2008 1 Definition 2 Moments 3 Existence 4 Three-term recurrences 5 Jacobi matrices 6 Christoffel-Darboux relation 7 Examples of orthogonal polynomials 8 Variable-signed
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 informationFast Fourier Transform
Why Fourier Transform? Fast Fourier Transform Jordi Cortadella and Jordi Petit Department of Computer Science Polynomials: coefficient representation Divide & Conquer Dept. CS, UPC Polynomials: point-value
More informationRapidly Computing Sparse Chebyshev and Legendre Coefficient Expansions via SFTs
Rapidly Computing Sparse Chebyshev and Legendre Coefficient Expansions via SFTs Mark Iwen Michigan State University October 18, 2014 Work with Janice (Xianfeng) Hu Graduating in May! M.A. Iwen (MSU) Fast
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 informationThe Fast Multipole Method: Numerical Implementation
Journal of Computational Physics 160, 195 240 (2000) doi:10.1006/jcph.2000.6451, available online at http://www.idealibrary.com on The Fast Multipole Method: Numerical Implementation Eric Darve Center
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 informationContinuous analogues of matrix factorizations NASC seminar, 9th May 2014
Continuous analogues of matrix factorizations NSC seminar, 9th May 2014 lex Townsend DPhil student Mathematical Institute University of Oxford (joint work with Nick Trefethen) Many thanks to Gil Strang,
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 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 informationComputing the common zeros of two bivariate functions via Bézout resultants Colorado State University, 26th September 2013
Work supported by supported by EPSRC grant EP/P505666/1. Computing the common zeros of two bivariate functions via Bézout resultants Colorado State University, 26th September 2013 Alex Townsend PhD student
More informationA generalized Prony method for sparse approximation
A generalized Prony method for sparse approximation Gerlind Plonka and Thomas Peter Institute for Numerical and Applied Mathematics University of Göttingen Dolomites Research Week on Approximation September
More informationFast Convolution; Strassen s Method
Fast Convolution; Strassen s Method 1 Fast Convolution reduction to subquadratic time polynomial evaluation at complex roots of unity interpolation via evaluation at complex roots of unity 2 The Master
More informationReconstruction of sparse Legendre and Gegenbauer expansions
Reconstruction of sparse Legendre and Gegenbauer expansions Daniel Potts Manfred Tasche We present a new deterministic algorithm for the reconstruction of sparse Legendre expansions from a small number
More informationJacobi-Angelesco multiple orthogonal polynomials on an r-star
M. Leurs Jacobi-Angelesco m.o.p. 1/19 Jacobi-Angelesco multiple orthogonal polynomials on an r-star Marjolein Leurs, (joint work with Walter Van Assche) Conference on Orthogonal Polynomials and Holomorphic
More informationChapter 5 Fast Multipole Methods
Computational Electromagnetics; Chapter 1 1 Chapter 5 Fast Multipole Methods 5.1 Near-field and far-field expansions Like the panel clustering, the Fast Multipole Method (FMM) is a technique for the fast
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 informationNumerical Solution of Two-Dimensional Volterra Integral Equations by Spectral Galerkin Method
Journal of Applied Mathematics & Bioinformatics, vol.1, no.2, 2011, 159-174 ISSN: 1792-6602 (print), 1792-6939 (online) International Scientific Press, 2011 Numerical Solution of Two-Dimensional Volterra
More informationSPECIAL FUNCTIONS OF MATHEMATICS FOR ENGINEERS
SPECIAL FUNCTIONS OF MATHEMATICS FOR ENGINEERS Second Edition LARRY C. ANDREWS OXFORD UNIVERSITY PRESS OXFORD TOKYO MELBOURNE SPIE OPTICAL ENGINEERING PRESS A Publication of SPIE The International Society
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 informationSpectral Methods and Inverse Problems
Spectral Methods and Inverse Problems Omid Khanmohamadi Department of Mathematics Florida State University Outline Outline 1 Fourier Spectral Methods Fourier Transforms Trigonometric Polynomial Interpolants
More informationA Spectral Time-Domain Method for Computational Electrodynamics
A Spectral Time-Domain Method for Computational Electrodynamics James V. Lambers Abstract Block Krylov subspace spectral (KSS) methods have previously been applied to the variable-coefficient heat equation
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 informationStability of Krylov Subspace Spectral Methods
Stability of Krylov Subspace Spectral Methods James V. Lambers Department of Energy Resources Engineering Stanford University includes joint work with Patrick Guidotti and Knut Sølna, UC Irvine Margot
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 informationBessel Functions Michael Taylor. Lecture Notes for Math 524
Bessel Functions Michael Taylor Lecture Notes for Math 54 Contents 1. Introduction. Conversion to first order systems 3. The Bessel functions J ν 4. The Bessel functions Y ν 5. Relations between J ν and
More informationComputational Methods CMSC/AMSC/MAPL 460
Computational Methods CMSC/AMSC/MAPL 460 Fourier transform Balaji Vasan Srinivasan Dept of Computer Science Several slides from Prof Healy s course at UMD Last time: Fourier analysis F(t) = A 0 /2 + A
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 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 informationSpeeding up numerical computations via conformal maps
Speeding up numerical computations via conformal maps Nick Trefethen, Oxford University Thanks to Nick Hale, Nick Higham and Wynn Tee 1/35 SIAM 1997 SIAM 2000 Cambridge 2003 2/35 Princeton 2005 Bornemann
More informationGalactic Astronomy 2016
10 Potential theory The study of dynamics is fundamental to any understanding of galaxies. The following few chapters provide a brief summary of the most important results. More details can be found in
More informationThe automatic solution of PDEs using a global spectral method
The automatic solution of PDEs using a global spectral method 2014 CBMS-NSF Conference, 29th June 2014 Alex Townsend PhD student University of Oxford (with Sheehan Olver) Supervised by Nick Trefethen,
More informationSingular integral operators and the Riesz transform
Singular integral operators and the Riesz transform Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 17, 017 1 Calderón-Zygmund kernels Let ω n 1 be the measure
More informationPARTIAL DIFFERENTIAL EQUATIONS and BOUNDARY VALUE PROBLEMS
PARTIAL DIFFERENTIAL EQUATIONS and BOUNDARY VALUE PROBLEMS NAKHLE H. ASMAR University of Missouri PRENTICE HALL, Upper Saddle River, New Jersey 07458 Contents Preface vii A Preview of Applications and
More informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
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 informationNumerical Methods I: Numerical Integration/Quadrature
1/20 Numerical Methods I: Numerical Integration/Quadrature Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 umerical integration 2/20 We want to approximate the definite integral
More informationElectrodynamics I Midterm - Part A - Closed Book KSU 2005/10/17 Electro Dynamic
Electrodynamics I Midterm - Part A - Closed Book KSU 5//7 Name Electro Dynamic. () Write Gauss Law in differential form. E( r) =ρ( r)/ɛ, or D = ρ, E= electricfield,ρ=volume charge density, ɛ =permittivity
More informationQuadrature Based Approximations of Non-integer Order Integrator on Finite Integration Interval
Quadrature Based Approximations of Non-integer Order Integrator on Finite Integration Interval Jerzy Baranowski Abstract Implementation of non-integer order systems is the subject of an ongoing research.
More informationENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS. Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS
ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS Preface page xiii 1 The Gamma and Beta Functions 1 1.1 The Gamma
More informationFourier Series and Fourier Transforms
Fourier Series and Fourier Transforms EECS2 (6.082), MIT Fall 2006 Lectures 2 and 3 Fourier Series From your differential equations course, 18.03, you know Fourier s expression representing a T -periodic
More informationA FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS
Proceedings of ALGORITMY 2005 pp. 222 229 A FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS ELENA BRAVERMAN, MOSHE ISRAELI, AND ALEXANDER SHERMAN Abstract. Based on a fast subtractional
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 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 informationThe Asymptotic Eigenvalues of First-Order Spectral Differentiation Matrices
Journal of Applied Mathematics and Physics, 4,, 76-88 Published Online April 4 in SciRes. http://www.scirp.org/journal/jamp http://dx.doi.org/.436/jamp.4.5 The Asymptotic Eigenvalues of First-Order Spectral
More information`an cos nπx. n 1. L `b
4 Fourier Series A periodic function on a range p,q may be decomposed into a sum of sinusoidal (sine or cosine) functions. This can be written as follows gpxq 1 2 a ` ř8 `b (4.1) The aim of this chapter
More informationLecture 16 Methods for System of Linear Equations (Linear Systems) Songting Luo. Department of Mathematics Iowa State University
Lecture 16 Methods for System of Linear Equations (Linear Systems) Songting Luo Department of Mathematics Iowa State University MATH 481 Numerical Methods for Differential Equations Songting Luo ( Department
More informationThe spectral transform method
The spectral transform method by Nils Wedi European Centre for Medium-Range Weather Forecasts wedi@ecmwf.int Advanced Numerical Methods for Earth-System Modelling Slide 1 Advanced Numerical Methods for
More informationFaster integer multiplication using short lattice vectors
Faster integer multiplication using short lattice vectors David Harvey and Joris van der Hoeven ANTS XIII, University of Wisconsin, Madison, July 2018 University of New South Wales / CNRS, École Polytechnique
More informationSparse and Fast Fourier Transforms in Biomedical Imaging
Sparse and Fast Fourier Transforms in Biomedical Imaging Stefan Kunis 1 1 joint work with Ines Melzer, TU Chemnitz and Helmholtz Center Munich, supported by DFG and Helmholtz association Outline 1 Trigonometric
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 information5.6 Convolution and FFT
5.6 Convolution and FFT Fast Fourier Transform: Applications Applications. Optics, acoustics, quantum physics, telecommunications, control systems, signal processing, speech recognition, data compression,
More informationFast inverse transform sampling in one and two dimensions
Fast inverse transform sampling in one and two dimensions Sheehan Olver Alex Townsend Abstract We develop a computationally efficient and robust algorithm for generating pseudo-random samples from a broad
More informationAn Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations
An Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations Moshe Israeli Computer Science Department, Technion-Israel Institute of Technology, Technion city, Haifa 32000, ISRAEL Alexander
More informationKrylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms
Krylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms 2. First Results and Algorithms Michael Eiermann Institut für Numerische Mathematik und Optimierung Technische
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 informationExponentials of Symmetric Matrices through Tridiagonal Reductions
Exponentials of Symmetric Matrices through Tridiagonal Reductions Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A simple and efficient numerical algorithm
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 informationCONVERGENCE ANALYSIS OF THE JACOBI SPECTRAL-COLLOCATION METHODS FOR VOLTERRA INTEGRAL EQUATIONS WITH A WEAKLY SINGULAR KERNEL
COVERGECE AALYSIS OF THE JACOBI SPECTRAL-COLLOCATIO METHODS FOR VOLTERRA ITEGRAL EQUATIOS WITH A WEAKLY SIGULAR KEREL YAPIG CHE AD TAO TAG Abstract. In this paper, a Jacobi-collocation spectral method
More information