Computational complexity investigations for high dimensional model representation algorithms used in multivariate interpolation problems

TUNGA M. A., Demiralp M.

12th WSEAS International Conference on APPLIED MATHEMATICS, Cairo, Egypt, 29 - 31 December 2007, pp.133-134 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • City: Cairo
  • Country: Egypt
  • Page Numbers: pp.133-134
  • Istanbul Technical University Affiliated: Yes


In multivariate interpolation problems, increase in both the number of independent variables of the sought function and the number of nodes appearing in the data set cause computational and mathematical difficulties. It may be a better way to deal with less variate partitioned data sets instead of an N-dimensional data set in a multivariate interpolation problem. New algorithms such as High Dimensional Model Representation (HDMR), Generalized HDMR, Factorized HDMR, Hybrid HDMR are developed or rearranged for these types of problems. Up to now, the efficiency of the methods in mathematical sense were discussed in several papers. In this work, the efficiency of these methods in computational sense will be discussed. This investigation will be done by using several numerical implementations.