A new sequential sampling method for constructing the high-order polynomial surrogate models

Publication Type:
Journal Article
Engineering Computations, 2017, 34 (7), pp. 1 - 21
Issue Date:
Filename Description Size
EC-05-2016-0160.R1.pdfAccepted Manuscript Version2.33 MB
Adobe PDF
Full metadata record
Purpose - The sampling methods (or design of experiments) which have large influence on the performance of the surrogate model will be mainly studied. To improve the adaptability of modelling, a new sequential sampling method termed as sequential Chebyshev sampling method (SCSM) is proposed in this study. Design/methodology/approach - The high-order polynomials are used to construct the global surrogated model, which retains the advantages of the traditional low-order polynomial models while overcoming their disadvantage in accuracy. Firstly, the zeros of Chebyshev polynomials with the highest allowable order will be used as sampling candidates to improve the stability and accuracy of the high-order polynomial model. In the second step, some initial sampling points will be selected from the candidates by using a coordinate alternation algorithm, which keeps the initial sampling set be uniformly distributed. Thirdly, a fast sequential sampling scheme based on the space-filling principle is developed to collect more samples from the candidates, and the order of polynomial model is also updated in this procedure. The final surrogate model will be determined as the polynomial that has the largest adjusted R-square after the sequential sampling is terminated. Findings - The SCSM has better performance in efficiency, accuracy, and stability compared with several popular sequential sampling methods, e.g. LOLA-Voronoi algorithm and global Monte Carlo method from the SED toolbox, and the Halton sequence. Originality/value – The SCSM has good performance in building the high-order surrogate model, including the high stability and accuracy, which may save a large amount of cost in solving complicated engineering design or optimization problems.
Please use this identifier to cite or link to this item: