𝔖 Bobbio Scriptorium
✦   LIBER   ✦

D-optimal designs for weighted polynomial regression

✍ Scribed by Zhide Fang


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
214 KB
Volume
63
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

✦ Synopsis


By utilizing the equivalence theorem and Descartes's rule of signs, we construct D-optimal designs for a weighted polynomial regression model of degree k, with speciΓΏc weight function w(x) = 1=(a 2 -x 2 ) , on the compact interval [ -1; 1]. The main result shows that in most cases, the number of support points of the D-optimal design is k + 1, while in other cases, the D-optimal design has k + 2 support points.


πŸ“œ SIMILAR VOLUMES


D-optimal designs for weighted polynomia
✍ Fu-Chuen Chang; Ge-Chen Lin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 672 KB

Using an Equivalence Theorem and the theory of Sturm Liouville systems, we determine the D-optimal designs for some classes of weighted polynomial regression of degree d on the interval [-1., 1]. We also show that the number of the optimal support points for such models is d+ 1. and that the optimal

Exact D-optimal designs for weighted pol
✍ Ray-Bing Chen; Mong-Na Lo Huang πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 137 KB

In this work, the exact D-optimal designs for weighted polynomial regression are investigated. In Ga ke (1987, J. Statist. Planning Inference 15, 189 -204) a su cient condition has been given that Salaeveski Γ„ i's type of result about the exact D-optimal designs holds when sample size n is large eno

Exact D-optimal designs for polynomial r
✍ Fu-Chuen Chang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 86 KB

For the regression model f k (x) = (x; x 2 ; : : : ; x k ) T on [a; 1]; -16a ‘ 1, the exact n-point D-optimal designs are proved to be ones that put mass as equally as possible among the support points of the approximate D-optimal design for f k (x) if n¿k; a = -1 and k = 2; 4, if n¿k; a¿(2 -√ 10)=6

D-optimal designs for polynomial regress
✍ Zhide Fang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 119 KB

In this article we consider D-optimal designs for polynomial regression models with low-degree terms being missed, by applying the theory of canonical moments. It turns out that the optimal design places equal weight on each of the zeros of some Jacobi polynomial when the number of unknown parameter

E-optimal designs for polynomial spline
✍ Berthold Heiligers πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 145 KB

We give the E-optimal approximate designs for mean (sub-) parameters in dth degree totally positive polynomial spline regression with prescribed knots over an arbitrary compact real interval. Based on a duality between E-and scalar optimality, the optimal design is found to be supported by the extre