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

Approximate solution of fractional vibration equation using Jacobi polynomials

Author

Listed:
  • Singh, Harendra

Abstract

In this paper, we present a method based on the Jacobi polynomials for the approximate solution to fractional vibration equation (FVE) of large membranes. Proposed method converts the FVE into Sylvester form of algebraic equations, whose solution gives the approximate solution. Convergence analysis of the proposed method is given. It is also shown that our approximate method is numerically stable. Numerical results are discussed for different values of wave velocities and fractional order involved in the FVE. These numerical results are shown through figures for particular cases of Jacobi polynomials such as (1) Legendre polynomial, (2) Chebyshev polynomial of second kind, (3) Chebyshev polynomial of third kind, (4) Chebyshev polynomial of fourth kind, (5) Gegenbauer polynomial. The accuracy of the proposed method is proved by comparing results of our method and other exiting analytical methods. Comparison of results are presented in the form of tables for particular cases of FVE and Jacobi polynomials.

Suggested Citation

  • Singh, Harendra, 2018. "Approximate solution of fractional vibration equation using Jacobi polynomials," Applied Mathematics and Computation, Elsevier, vol. 317(C), pages 85-100.
    • Handle: RePEc:eee:apmaco:v:317:y:2018:i:c:p:85-100
    DOI: 10.1016/j.amc.2017.08.057
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Prakash, Amit & Kumar, Manoj & Baleanu, Dumitru, 2018. "A new iterative technique for a fractional model of nonlinear Zakharov–Kuznetsov equations via Sumudu transform," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 30-40.
    2. Sadri, Khadijeh & Aminikhah, Hossein, 2021. "An efficient numerical method for solving a class of variable-order fractional mobile-immobile advection-dispersion equations and its convergence analysis," Chaos, Solitons & Fractals, Elsevier, vol. 146(C).

    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:317:y:2018:i:c:p:85-100. 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.