1 Ocak 2011 Dergi makalesi Açık Erişim

Cenesiz, Yucel; Kurnaz, Aydin

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Cenesiz, Yucel</dc:creator>
  <dc:creator>Kurnaz, Aydin</dc:creator>
  <dc:date>2011-01-01</dc:date>
  <dc:description>In this paper, orthogonal polynomials on [-1,1] interval are used to modify the Adomian decomposition method (ADM). Gegenbauer and Jacobi polynomials are employed to improve the ADM and compared with the method of using Chebyshev and Legendre polynomials. To show the efficiency of the developed method, some linear and nonlinear examples are solved by the proposed method, results are compared with other modifications of the ADM and the exact solutions of the problems.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/18139</dc:identifier>
  <dc:identifier>oai:zenodo.org:18139</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 88(17) 3666-3676</dc:source>
  <dc:title>Adomian decomposition method by Gegenbauer and Jacobi polynomials</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>