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

Solving Partial Differential Equations Using a New Differential Evolution Algorithm

Author

Listed:
  • Natee Panagant
  • Sujin Bureerat

Abstract

This paper proposes an alternative meshless approach to solve partial differential equations (PDEs). With a global approximate function being defined, a partial differential equation problem is converted into an optimisation problem with equality constraints from PDE boundary conditions. An evolutionary algorithm (EA) is employed to search for the optimum solution. For this approach, the most difficult task is the low convergence rate of EA which consequently results in poor PDE solution approximation. However, its attractiveness remains due to the nature of a soft computing technique in EA. The algorithm can be used to tackle almost any kind of optimisation problem with simple evolutionary operation, which means it is mathematically simpler to use. A new efficient differential evolution (DE) is presented and used to solve a number of the partial differential equations. The results obtained are illustrated and compared with exact solutions. It is shown that the proposed method has a potential to be a future meshless tool provided that the search performance of EA is greatly enhanced.

Suggested Citation

  • Natee Panagant & Sujin Bureerat, 2014. "Solving Partial Differential Equations Using a New Differential Evolution Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-10, June.
  • Handle: RePEc:hin:jnlmpe:747490
    DOI: 10.1155/2014/747490
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/747490.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2014/747490.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/747490?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ali, Javaid & Raza, Ali & Ahmed, Nauman & Ahmadian, Ali & Rafiq, Muhammad & Ferrara, Massimiliano, 2021. "Evolutionary optimized Padé approximation scheme for analysis of covid-19 model with crowding effect," Operations Research Perspectives, Elsevier, vol. 8(C).

    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:747490. 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.