IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v53y2024i2p700-717.html
   My bibliography  Save this article

Mis-specification analyses and optimum degradation test plan for Wiener and inverse Gaussian processes

Author

Listed:
  • Cheng-Han Yang
  • Ya-Hsuan Hsu
  • Cheng-Hung Hu

Abstract

Degradation tests are used when there is a quality characteristic related to the life of a product. In this paper, we investigate the model mis-specification effect on the estimation precision of product's mean time to failure (MTTF) and consider a degradation test design problem. The Wiener and inverse Gaussian (IG) processes are two possible models considered. We derive expressions for the mean and variance of the estimated product's MTTF when the true model is an IG process, but is wrongly fitted by a Wiener process. We further discuss the experimental design problem and derive the explicit functional form of the estimation variances. Using the derived functions, optimal degradation test plans assuming a Wiener process model is correctly or wrongly specified are both proposed. The derived plans are applied to a laser data example. We evaluate the test efficiency of the plans derived from a Wiener process assumption when the model is mis-specified. For many optimization criteria, we observe that the obtained plans are robust even when the fitted model is mis-specified. For some criteria that may result in very different test plans under different models, we use a weighted ratio criterion to find practically useful degradation plans under model uncertainty.

Suggested Citation

  • Cheng-Han Yang & Ya-Hsuan Hsu & Cheng-Hung Hu, 2024. "Mis-specification analyses and optimum degradation test plan for Wiener and inverse Gaussian processes," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(2), pages 700-717, January.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:2:p:700-717
    DOI: 10.1080/03610926.2022.2091782
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2022.2091782
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2022.2091782?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:lstaxx:v:53:y:2024:i:2:p:700-717. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.