Abstract
All algorithms that we are going to discuss are iterative. Let ξsbe the design that was obtained after(s— 1) iteration steps. At thes-th iteration step we hopefully will improve — as in all previous steps — the characteristics of the design. The new design, for instance, may be obtained according to
this means that we reduce the number of observations which are taken in accordance with design ξsand that we, instead, take some observations at points which correspond to design ξ. How shall we choose those points or the design ξ?
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fedorov, V.V., Hackl, P. (1997). Numerical Techniques. In: Model-Oriented Design of Experiments. Lecture Notes in Statistics, vol 125. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0703-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0703-0_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98215-1
Online ISBN: 978-1-4612-0703-0
eBook Packages: Springer Book Archive