On improving the accuracy of Horner's and Goertzel's algorithms
Alicja Smoktunowicz, Iwona Wróbel
Abstract
It is known that Goertzel's algorithm is much less numerically accurate than the Fast Fourier Transform (FFT)(Cf. gen:69). In order to improve accuracy we propose modifications of both Goertzel's and Horner's algorithms based on the divide-and-conquer techniques. The proof of the numerical stability of these two modified algorithms is given. The numerical tests in Matlab demonstrate the computational advantages of the proposed modifications. The appendix contains the proof of numerical stability of Goertzel's algorithm of polynomial evaluation.
Create a lesson
Related papers
To lift or not to lift: Operator inference for nonlinear PDEs with boundary control
Zhuoyuan Wang, Yorie Nakahira, Wael H. Ali et al.
Sobolev--Poincaré inequalities for piecewise W2,p functions over general polytopic meshes
Michele Botti, Lorenzo Mascotto
Robust Multigrid on Adaptive Meshes for the Integral Fractional Laplacian
Markus Faustmann, Paula Hilbert, Ani Miraçi et al.
A Tensor-Network Chebyshev-Galerkin Method for Boundary-Value Problems in Computational Mechanics
Juan José Rodríguez-Aldavero, Ángel de la Rosa Velasco, Juan José García-Ripoll
A volume-conserving ALE continuous Galerkin method with residual-based Dirichlet--Neumann fluxes for nonlinear free-surface waves
Fan Wang, Yinhua Xia, Yan Xu
A weak Galerkin finite element method for the coupled Stokess-Biot problem
Rui Li, Hui Peng, Xiuli Wang