首页 | 本学科首页   官方微博 | 高级检索  
     


Convex Optimal Designs for Compound Polynomial Extrapolation
Authors:Holger Dette  Mong-Na Lo Huang
Affiliation:(1) Fakultät für Mathematik, Ruhr-Universität Bochum, 44780 Bochum, Germany;(2) Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, 80424, Taiwan R.O.C
Abstract:The extrapolation design problem for polynomial regression model on the design space [–1,1] is considered when the degree of the underlying polynomial model is with uncertainty. We investigate compound optimal extrapolation designs with two specific polynomial models, that is those with degrees |m, 2m}. We prove that to extrapolate at a point z, |z| > 1, the optimal convex combination of the two optimal extrapolation designs |xgrm* (z), xgr2m* (z)} for each model separately is a compound optimal extrapolation design to extrapolate at z. The results are applied to find the compound optimal discriminating designs for the two polynomial models with degree |m, 2m}, i.e., discriminating models by estimating the highest coefficient in each model. Finally, the relations between the compound optimal extrapolation design problem and certain nonlinear extremal problems for polynomials are worked out. It is shown that the solution of the compound optimal extrapolation design problem can be obtained by maximizing a (weighted) sum of two squared polynomials with degree m and 2m evaluated at the point z, |z| > 1, subject to the restriction that the sup-norm of the sum of squared polynomials is bounded.
Keywords:Chebyshev polynomials  convex combination  extremal problems for polynomials  Lagrange interpolation polynomial  optimal discrimination designs
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号