Title page for etd-0606102-142718


[Back to Results | New Search]

URN etd-0606102-142718
Author Hao-Chung Liao
Author's Email Address s842416@yahoo.com.tw
Statistics This thesis had been viewed 5066 times. Download 3485 times.
Department Applied Mathematics
Year 2001
Semester 2
Degree Master
Type of Document
Language English
Title Construction of approximate optimal designs by exchange algorithm
Date of Defense 2001-06-01
Page Count 21
Keyword
  • D-optima
  • approximate
  • exact
  • exchange algorithm
  • Abstract In this study we will consider the construction of approximate optimal design for one-dimensional regression by exchange algorithm. Sufficient conditions under which an optimal design must have the minimal support points are known in Theorem 2.3.2 of Fedorov (1972). However, there are only a few cases which the analytic optimal designs are known. The exchange procedure for
    computing optimal designs is easily adopted to most criteria. We describe implementations for constructing the well-known special cases D-, A-, and c-optimal designs with the minimum number of
    support points. Examples which illustrate how the algorithm can be used to obtain these optimal designs and the performance of the algorithm are discussed. The commonly used D-, A-, and c-optimal
    criteria will be employed to study the convergence properties of the exchange algorithm for regression model which the set of the product of regression functions forms a Chebyshev system.
    Advisory Committee
  • Mong-Na Lo Huang - chair
  • Mei-Hui Guo - co-chair
  • Fu-Chuen Chang - advisor
  • Files
  • etd-0606102-142718.pdf
  • indicate access worldwide
    Date of Submission 2002-06-06

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys