IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v264y2015icp85-98.html
   My bibliography  Save this article

Searching globally optimal parameter sequence for defeating Runge phenomenon by immunity genetic algorithm

Author

Listed:
  • Lin, Hongwei
  • Sun, Linjie

Abstract

Data interpolation is a fundamental data processing tool in scientific studies and engineering applications. However, when interpolating data points on an equidistant grid using polynomials, the so-called Runge phenomenon may occur, making polynomial interpolation unreliable. Although there are some methods proposed to defeat the Runge phenomenon, it is still an open problem which parameter sequence is the globally optimal for overcoming the Runge phenomenon. In this paper, we develop an immunity genetic algorithm based method to solve this problem. Specifically, we first model the Runge-phenomenon-defeating problem as an optimization in which the objective function is the energy of the parametric curve. An immunity genetic algorithm is then devised to determine the best IGA parameter sequence, which minimizes the objective function. The resulting parametric curve overcomes the Runge phenomenon. By performing the proposed immunity genetic searching algorithm starting with some groups of randomly generated parameter sequences, the resulted parameter sequences closely oscillate around the Chebyshev parameter sequence. Therefore, the Chebyshev parameter sequence is most likely the globally optimal sequence conquering the Runge phenomenon.

Suggested Citation

  • Lin, Hongwei & Sun, Linjie, 2015. "Searching globally optimal parameter sequence for defeating Runge phenomenon by immunity genetic algorithm," Applied Mathematics and Computation, Elsevier, vol. 264(C), pages 85-98.
    • Handle: RePEc:eee:apmaco:v:264:y:2015:i:c:p:85-98
    DOI: 10.1016/j.amc.2015.04.069
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315005317
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.04.069?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.

    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:eee:apmaco:v:264:y:2015:i:c:p:85-98. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.