MS-Mo-E-31
Numerical Computation with Functions and Chebfun - Part II of III
For Part I, see MS-Mo-D-31
For Part III, see MS-Tu-D-31

Date: August 10
Time: 16:00--18:00
Room: 405

(Note: Click title to show the abstract.)

Organizer:
Trefethen, Lloyd N. (Univ. of Oxford)
Guettel, Stefan (The Univ. of Manchester)

Abstract: A recent theme in algorithms and software is efficient numerical computation with functions in a manner that "feels symbolic" since the accuracy is high and underlying discretizations (Chebyshev, Fourier,...) are hidden from the user. Projects of this kind include Chebfun, pychebfun, ApproxFun, and PaCAL. A pervasive theme in this work is the use of continuous analogues of familiar discrete mathematical objects and algorithms. This minisymposium will
present new developments in the areas of (1) differential and integral equations, (2) working with functions, and (3) rootfinding and linear algebra.


MS-Mo-E-31-1
16:00--16:30
A fast and well-conditioned spectral method for solving singular integral equations
Slevinsky, Richard Mikael (Univ. of Oxford)


MS-Mo-E-31-2
16:30--17:00
Rectangular differentiation matrices
Xu, Kuan (Univ. of Oxford)


MS-Mo-E-31-3
17:00--17:30
High accuracy Chebyshev coefficients via contour integrals
Austin, Anthony (Universtiy of Oxford)
Trefethen, Lloyd N. (Univ. of Oxford)


MS-Mo-E-31-4
17:30--18:00
Linearizations for computing roots of rational functions
Nakatsukasa, Yuji (Univ. of Tokyo)
Vanni, Noferini (Univ. of Manchester)
Townsend, Alex (MIT)

Return


Footnote:
Code: Type-Date-Time-Room No.
Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters
Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday
Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00
Room No.: TBA