𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact D-optimal designs for polynomial regression without intercept

✍ Scribed by Fu-Chuen Chang


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
86 KB
Volume
44
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

✦ Synopsis


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 and k = 2, and if n¿2k; -0:08769916a6( √ 5 -1)=2 √ 5 and k = 3. For the other cases, the properties of exact D-optimal designs are discussed on the basis of an intensive numerical study.


πŸ“œ SIMILAR VOLUMES


E-optimal designs for polynomial regress
✍ Fu-Chuen Chang; Berthold Heiligers πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 863 KB

We give all E-optimal designs for the mean parameter vector in polynomial regression of degree d without intercept in one real variable. The derivation is based on interplays between E-optimal design problems in the present and in certain heteroscedastic polynomial setups with intercept. Thereby the

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

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

D-optimal designs for weighted polynomia
✍ Zhide Fang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 214 KB

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 sup

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