Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Global Selection Procedure for Polynomial Interpolators

Ron A. Bates, Beatrice Giglio and Henry P. Wynn
Technometrics
Vol. 45, No. 3 (Aug., 2003), pp. 246-255
Stable URL: http://www.jstor.org/stable/25047051
Page Count: 10
  • Download ($14.00)
  • Cite this Item
A Global Selection Procedure for Polynomial Interpolators
Preview not available

Abstract

The drive for efficient methods of testing design ideas and prototypes, particularly in engineering, has led to a rapid increase in the field of numerical simulation methods using computers, such as finite-element analysis. This increase in popularity has fueled the need for empirical models that interpolate data collected from these simulations. We propose a selection algorithm to efficiently explore an appropriate class of polynomial interpolators. The storage of polynomial models is made efficient and effective thanks to a special coding. Finally, the last stage of the algorithm returns a model that is no longer an interpolator but, having a smaller number of terms, is simpler and easier to handle and understand. In this way, a trade-off between accuracy and simplicity of the model is attained.

Page Thumbnails

  • Thumbnail: Page 
246
    246
  • Thumbnail: Page 
247
    247
  • Thumbnail: Page 
248
    248
  • Thumbnail: Page 
249
    249
  • Thumbnail: Page 
250
    250
  • Thumbnail: Page 
251
    251
  • Thumbnail: Page 
252
    252
  • Thumbnail: Page 
253
    253
  • Thumbnail: Page 
254
    254
  • Thumbnail: Page 
255
    255