Numerical Analysis Seminars: A fast and simple algorithm for the computation of Legendre coefficients
11 February 2011 15:15 in CG85
In this talk we address ourselves to a long-standing challenge, to compute in O(n log n) operations the first n coefficients of a Legendre expansion. We demonstrate how a fairly complicated chain of reasoning, involving the complex plane and special function theory leads to a simple, effective and robust algorithm for fast computation of Legendre expansions.
Contact David.Bourne@durham.ac.uk for more information