University of Cambridge > > Cambridge Centre for Analysis talks >  Polynomials, Rational Functions and Chebfun

Polynomials, Rational Functions and Chebfun

Add to your list(s) Download to your calendar using vCal

  • UserProfessor L N Trefethen, Oxford University Mathematical Institute World_link
  • ClockMonday 09 June 2014, 14:00-18:00
  • HouseMR2.

If you have a question about this talk, please contact CCA.

Short Course

Polynomials are among the oldest ideas in mathematics, and they are also one of the most powerful tools for practical computing. Rational functions generalize them in ways that give new power near singularities and on unbounded regions. This four-hour event will blend:

1) THEORY , based on the textbook Approximation Theory and Approximation Practice. Topics touched upon will include the barycentric interpolation formula, the Runge phenomenon, rootfinding via colleague matrices, the Remez algorithm for best approximation, Gauss quadrature, and analytic continuation;


2) PRACTICE , using Chebfun. Participants should bring lapops leaded with Matlab and plan to spend some enjoyable time working in pairs on some challenging computational problems, which will touch upon ODEs and PDEs as well as the topics mentioned above. No prior Chebfun experience is needed but you should be comfortable in Matlab.

This talk is part of the Cambridge Centre for Analysis talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2020, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity