A Combinatorial Search Technique for Constructing Optimal Designs for Biased Models
- Akpan S. S.
- Udoh M. E
- Nduka E. C.
Abstract
A new algorithm has been proposed to locate the global minimum of the alias matrix for a biased response function definedin a set of distinct support points. The search begins by classifying all the support points in the experimental region of
interest into groups. Then starting from an arbitrary set of N support points, the algorithm obtains an N-point optimal
design by systematically adding and dropping support points from the various groups in such a way as to continuously
reduce the determinant of the alias matrix of the design at each step of the sequence. Numerical demonstrations confirm
the effectiveness of this algorithm.
- Full Text:
PDF
- DOI:10.5539/jmr.v2n4p125
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org