University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Chebyshev polynomial approximations for some hypergeometric systems

Chebyshev polynomial approximations for some hypergeometric systems

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

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

Discrete Integrable Systems

The hypergeometric type differential equations of the second order with polynomial coefficients and their systems are considered. The realization of the Lanczos Tau method with minimal residue is proposed for the approximate solution of the second order differential equations with polynomial coefficients. The scheme of Tau method is extended for the systems of hypergeometric type differential equations. A Tau method computational scheme is applied to the approximate solution of a system of differential equations related to the differential equation of hypergeometric type. The case of the discrete systems may be considered also. Various vector perturbations are discussed. Our choice of the perturbation term is a shifted Chebyshev polynomial with a special form of selected transition and normalization. The minimality conditions for the perturbation term are found for one equation. They are sufficiently simple for the verification in a number of important cases. Several approaches for the approximation of kernels of Kontorovich-Lebedev integral transforms—modified Bessel functions of the second kind with pure imaginary order and with complex order are elaborated. The codes of the evaluation are constructed and tables of the modified Bessel functions are published. The advantages of discussed algorithms in accuracy and timing are shown. The effective applications for the solution of some mixed boundary value problems in wedge domains are given.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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