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

Abstract

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 causes 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 was 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. © 2009 Springer Science+Business Media LLC. © 2011 Elsevier B.V., All rights reserved.