University of Cambridge > Talks.cam > Applied and Computational Analysis > Through the Kaleidoscope; Symmetries, Groups and Chebyshev Approximations from a Computational Point of View

Through the Kaleidoscope; Symmetries, Groups and Chebyshev Approximations from a Computational Point of View

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

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.

Classical univariate Chebyshev polynomials are fundamental objects in computational mathematics. Their ubiquity in applications is summarized by the quote: “Chebyshev polynomials are everywhere dense in numerical analysis” (perhaps due to George Forsythe). Most of the useful properties of Chebyshev polynomials arise from their tight connections to group theory. From this perspective, multivariate Chebyshev polynomials appear as natural generalizations, constructed by a kaleidoscope of mirrors acting upon R^n (i.e. affine Weyl groups). Multivariate Chebyshev polynomials were first introduced by Koornwinder already in 1974, but they have only very recently been applied in computational mathematics. The fact that the multivariate polynomials are orthogonal on domains related to triangles, tetrahedra and higher dimensional simplexes, rises the important question of their applicability in triangle-based spectral element methods for PDEs. We have developed general software tools with such applications in mind.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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