IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v239y2026icp420-441.html
   My bibliography  Save this article

A novel two-derivative multistep collocation method with fitting-techniques with application to Duffing problem

Author

Listed:
  • Lee, K.C.
  • Hashim, I.
  • Mohd Aris, M.N.
  • Senu, N.

Abstract

The general k-step fifth-order two-derivative linear multistep collocation method (TDLMM5) using collocation technique with Gegenbauer polynomial as basis function is derived for direct integrating second-order ordinary differential equation in the form u″(t)=f(t,u(t)) with periodic solution. Fifth-order two-derivative linear multistep method with various collocation points and off-set points is developed using collocation and interpolation approach. Order, stability, consistency and convergence of TDLMM5 are analyzed and discussed. Then, trigonometrically-fitting technique is adapted into TDLMM5 by setting u(t) as the linear combination of the functions {sin(λt),cos(λt)},λ∈R and turn the coefficients of TDLMM5 into frequency-dependent. Numerical experiment is conducted to verify the proposed method is superior compared to other existing methods in the literature with similar order. Additionally, the trigonometrically-fitted TDLMM5, denoted as TFTDLMM5, is applied to the well-known damped and driven oscillator problem, known as the Duffing problem. The outcome demonstrates that the proposed method is still successful in modeling this real-world application problem.

Suggested Citation

  • Lee, K.C. & Hashim, I. & Mohd Aris, M.N. & Senu, N., 2026. "A novel two-derivative multistep collocation method with fitting-techniques with application to Duffing problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 239(C), pages 420-441.
  • Handle: RePEc:eee:matcom:v:239:y:2026:i:c:p:420-441
    DOI: 10.1016/j.matcom.2025.05.024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425002174
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.05.024?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:eee:matcom:v:239:y:2026:i:c:p:420-441. 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: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.