Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 1729287, 10 pages
https://doi.org/10.1155/2017/1729287
Research Article

Accurate and Efficient Evaluation of Chebyshev Tensor Product Surface

1School of Science, National University of Defense Technology, Changsha, China
2College of Computer, National University of Defense Technology, Changsha, China
3State Key Laboratory of Astronautic Dynamics, Xi’an, China

Correspondence should be addressed to Hao Jiang; nc.ude.tdun@gnaijoah

Received 10 March 2017; Accepted 3 July 2017; Published 27 September 2017

Academic Editor: Elisa Francomano

Copyright © 2017 Keshan He et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Fox and I. Parker, Chebyshev Polynomials in Numerical Analysis, Oxford University Press, 1968.
  2. D. H. Bailey, R. Barrio, and J. M. Borwein, “High-precision computation: mathematical physics and dynamics,” Applied Mathematics and Computation, vol. 218, no. 20, pp. 10106–10121, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. T. J. Rivlin and J. Theodore, “The chebyshev polynomials,” vol. 30, no. 134, p. 374, 1974. View at Google Scholar
  4. R. Barrio and A. Elipe, “Integration of orbital motions with chebyshev polynomial,” in Dynamics and Astrometry of Natural and Artificial Celestial Bodies, pp. 419–424, Springer, 1997. View at Google Scholar
  5. R. Mukundan, S. H. Ong, and P. A. Lee, “Image analysis by Tchebichef moments,” IEEE Transactions on Image Processing, vol. 10, no. 9, pp. 1357–1364, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. H. Rahmalan, N. A. Abu, and S. L. Wong, “Using tchebichef moment for fast and efficient image compression,” Pattern Recognition and Image Analysis, vol. 20, no. 4, pp. 505–512, 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. Z. Omar, N. Mitianoudis, and T. Stathaki, “Two-dimensional chebyshev polynomials for image fusion,” in Proceedings of the 28th Picture Coding Symposium (PCS '10), pp. 426–429, Japan, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. N. A. Abu, N. Suryana, and R. Mukundan, “Perfect image reconstruction using discrete orthogonal moments,” in Proceedings of the Fourth IASTED International Conference on Visualization, Imaging, and Image Processing (VIIP '04), pp. 903–907, September 2004. View at Scopus
  9. N. A. Abu and M. R. K. Ariffin, “A novel psychovisual model on an independent video frame for an almost lossless compression,” in Proceedings of the 2014 10th International Conference on Information Assurance and Security (IAS '14), pp. 60–65, Japan, November 2014. View at Publisher · View at Google Scholar · View at Scopus
  10. W. Guobao and W. Shigang, “Recursive computation of Tchebichef moment and its inverse transform,” Pattern Recognition, vol. 39, no. 1, pp. 47–56, 2006. View at Publisher · View at Google Scholar · View at Scopus
  11. X. S. Li, J. W. Demmel, D. H. Bailey et al., “Design, implementation and testing of extended and mixed precision blas,” ACM Transactions on Mathematical Software, vol. 28, no. 2, pp. 152–205, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  12. T. Ogita, S. M. Rump, and S. Oishi, “Accurate sum and dot product,” SIAM Journal on Scientific Computing, vol. 26, no. 6, pp. 1955–1988, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. S. Graillat, P. Langlois, and N. Louvet, “Compensated horner scheme,” in Proceedings of the In Algebraic and Numerical Algorithms and Computer-Assisted Proofs, B. Buchberger, S. Oishi, M. Plum, and S. M. Rump, Eds., p. 05391, 2005.
  14. H. Jiang, S. Li, L. Cheng, and F. Su, “Accurate evaluation of a polynomial and its derivative in Bernstein form,” Computers & Mathematics with Applications, vol. 60, no. 3, pp. 744–755, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. H. Jiang, R. Barrio, H. Li, X. Liao, L. Cheng, and F. Su, “Accurate evaluation of a polynomial in Chebyshev form,” Applied Mathematics and Computation, vol. 217, no. 23, pp. 9702–9716, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. C. W. Clenshaw, “A note on the summation of chebyshev series,” Mathematics of Computation, vol. 9, no. 51, pp. 118–120, 1955. View at Publisher · View at Google Scholar · View at Scopus
  17. IEEE Standards Committee and others, 754-2008 IEEE standard for floating-point arithmetic. IEEE Computer Society Std, 2008. View at Publisher · View at Google Scholar
  18. N. J. Higham, Accuracy and stability of numerical algorithms, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, USA, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  19. R. Barrio, H. Jiang, and S. Serrano, “A general condition number for polynomials,” SIAM Journal on Numerical Analysis, vol. 51, no. 2, pp. 1280–1294, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. E. K. Donald et al., “The art of computer programming,” Sorting and Searching, vol. 3, pp. 426–458, 1999. View at Google Scholar
  21. T. J. Dekker, “A floating-point technique for extending the available precision,” Numerische Mathematik, vol. 18, pp. 224–242, 1971/72. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. Y. Hida, X. S. Li, and D. H. Bailey, “Algorithms for quad-double precision floating point arithmetic,” in Proceedings of the 15th IEEE Symposium on Computer Arithmetic, pp. 155–162, Vail, Colo, USA, June 2001. View at Scopus
  23. P. Langlois and N. Louvet, “More instruction level parallelism explains the actual efficiency of compensated algorithms,” Tech. Rep., DALI Research Team (2007), http://hal.archives-ouvertes.fr/hal-00165020.
  24. N. Louvet, Compensated algorithms in floating point arithmetic: accuracy, validation, performances [Ph.D. thesis], Université de Perpignan Via Domitia, 2007.
  25. D. H. Bailey, High-precision software directory: QD library, double-double library, Berkeley National Laboratory, 2008, http://www.nersc.gov/dhbailey/mpdist/mpdist.html.