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
โฆ LIBER โฆ
Algorithms for constructing spline regression polynomial models
โ Scribed by B. Ya. Oleksiv; B. A. Popov
- Publisher
- Springer
- Year
- 1983
- Tongue
- English
- Weight
- 398 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1573-885X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
E-optimal designs for polynomial spline
โ
Berthold Heiligers
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 145 KB
Some robust designs for polynomial regre
โ
Zhide Fang
๐
Article
๐
2006
๐
John Wiley and Sons
๐
French
โ 874 KB
A convergent algorithm for quantile regr
โ
Ronald J. Bosch; Yinyu Ye; George G. Woodworth
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 858 KB
Algorithms for optimal design with appli
โ
Norbert Gaffke; Berthold Heiligers
๐
Article
๐
1995
๐
Springer
๐
English
โ 803 KB
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
A local algorithm for constructing non-n
โ
Bernd Fischer; Gerhard Opfer; Madan L Puri
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 890 KB