IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/450492.html
   My bibliography  Save this article

Two General Extension Algorithms of Latin Hypercube Sampling

Author

Listed:
  • Zhi-zhao Liu
  • Wei Li
  • Ming Yang

Abstract

For reserving original sampling points to reduce the simulation runs, two general extension algorithms of Latin Hypercube Sampling (LHS) are proposed. The extension algorithms start with an original LHS of size and construct a new LHS of size that contains the original points as many as possible. In order to get a strict LHS of larger size, some original points might be deleted. The relationship of original sampling points in the new LHS structure is shown by a simple undirected acyclic graph. The basic general extension algorithm is proposed to reserve the most original points, but it costs too much time. Therefore, a general extension algorithm based on greedy algorithm is proposed to reduce the extension time, which cannot guarantee to contain the most original points. These algorithms are illustrated by an example and applied to evaluating the sample means to demonstrate the effectiveness.

Suggested Citation

  • Zhi-zhao Liu & Wei Li & Ming Yang, 2015. "Two General Extension Algorithms of Latin Hypercube Sampling," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-9, July.
    • Handle: RePEc:hin:jnlmpe:450492
    DOI: 10.1155/2015/450492
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/450492.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/450492.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/450492?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:450492. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.