Almost optimal points for rational interpolation with prescribed poles, and rational Gauss-Chebyshev quadrature

This matlab program computes the nodes and weights in rational Gauss-Chebyshev quadrature formulas. Under certain conditions on the poles, these nodes are almost optimal points for rational interpolation with prescribed poles (in the same sense that Chebyshev points are almost optimal for polynomial interpolation)

References

The matlab programe can be downloaded here.

Contact

Joris Van Deun Karl Deckers Adhemar Bultheel
U. Antwerpen, Dept. Math and Computer Science    K.U.Leuven, Dept. Computer Science    K.U.Leuven, Dept. Computer Science   
Middelheimlaan, 1 Celestijnenlaan 200A Celestijnenlaan 200A
B-2020 Antwerpen B-3001 Leuven B-3001 Leuven
Joris.VanDeun ’a’ ua.ac.be Karl.Deckers ’a’ cs.kuleuven.be Adhemar.Bultheel ’a’ cs.kuleuven.be
home Joris home Karl home Adhemar
Copyright © 2010 K.U.Leuven-Department Computer Science
This file is maintained by our webmaster.
Last modified: May 30, 2010
URL: http://www.cs.kuleuven.be/research/software/rcheb/index.html
Click here to print this page: Click here to print this page