Numerical solution of Duffing equation by the Laplace decomposition algorithm
Applied Mathematics and Computation, cilt.177, sa.2, ss.572-580, 2006 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 177 Sayı: 2
- Basım Tarihi: 2006
- Doi Numarası: 10.1016/j.amc.2005.07.072
- Dergi Adı: Applied Mathematics and Computation
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.572-580
- Anahtar Kelimeler: A Laplace decomposition algorithm, Duffing equation, Maple, Pade approximant
- Uşak Üniversitesi Adresli: Hayır
Özet
The Laplace decomposition algorithm (LDA) is a numerical algorithm can be adapted to solve Duffing equations. This paper both describes the principle of LDA and discusses its advantages and drawbacks. Concrete example are also studied to show with numerical results how the LDA works efficiently. © 2005 Elsevier Inc. All rights reserved.