IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i24p3182-d698910.html
   My bibliography  Save this article

Generalized Convexity Properties and Shape-Based Approximation in Networks Reliability

Author

Listed:
  • Gabriela Cristescu

    (Faculty of Exact Sciences, Aurel Vlaicu University of Arad, Bd. Revoluţiei, no. 77, 310130 Arad, Romania
    These authors contributed equally to this work.)

  • Vlad-Florin Drăgoi

    (Faculty of Exact Sciences, Aurel Vlaicu University of Arad, Bd. Revoluţiei, no. 77, 310130 Arad, Romania
    LITIS, Rouen Normandie University, Avenue de l’Université, 76800 Saint-Étienne-du-Rouvray, France
    These authors contributed equally to this work.)

  • Sorin Horaţiu Hoară

    (Faculty of Exact Sciences, Aurel Vlaicu University of Arad, Bd. Revoluţiei, no. 77, 310130 Arad, Romania
    Department of Computers and Information Technology, Polytechnic University of Timişoara, Piaţa Victoriei No. 2, 300006 Timişoara, Romania
    These authors contributed equally to this work.)

Abstract

Some properties of generalized convexity for sets and functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is developed based on their mutual complementarity properties. The approximating objects are from the class of quadratic spline functions, constructed based on both interpolation conditions and shape knowledge. It is proved that the approximant objects preserve both the high-order convexity and some extremum properties of the exact reliability polynomials. It leads to pointing out the area of the network where the maximum number of paths is achieved. Numerical examples and simulations show the performance of the algorithm, both in terms of low complexity, small error and shape preserving. Possibilities of increasing the accuracy of approximation are discussed.

Suggested Citation

  • Gabriela Cristescu & Vlad-Florin Drăgoi & Sorin Horaţiu Hoară, 2021. "Generalized Convexity Properties and Shape-Based Approximation in Networks Reliability," Mathematics, MDPI, vol. 9(24), pages 1-21, December.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:24:p:3182-:d:698910
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/24/3182/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/24/3182/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:9:y:2021:i:24:p:3182-:d:698910. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.