摘要
It has been argued that Chebyshev polynomials are ideal to use as approximating functions to obtain solutions of integral equations and convolution integrals on account of their fast convergence. Using the standard deviation as a measure of the accuracy of the approximation and the CPU time as a measure of the speed, we find that for reasonable accuracy Legendre polynomials are more efficient. '
It has been argued that Chebyshev polynomials are ideal to use as approximating functions to obtain solutions of integral equations and convolution integrals on account of their fast convergence. Using the standard deviation as a measure of the accuracy of the approximation and the CPU time as a measure of the speed, we find that for reasonable accuracy Legendre polynomials are more efficient. '
