<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
<PublisherName>OICC Press</PublisherName>
<JournalTitle>International Journal of Mathematical Modelling &amp; Computations</JournalTitle>
<Issn>2228-6233</Issn>
<Volume>2</Volume>
<Issue>3</Issue>
<PubDate PubStatus="epublish">
<Year>2016</Year>
<Month>06</Month>
<Day>21</Day>
</PubDate>
</Journal>
<ArticleTitle>APPLICATION OF THE SINC APPROXIMATION TO THE SOLUTION OF BRATU'S PROBLEM</ArticleTitle>
<VernacularTitle></VernacularTitle>
<FirstPage>239</FirstPage>
<LastPage>246</LastPage>
<ELocationID EIdType="doi"></ELocationID>
<Language>EN</Language>
<AuthorList>
<Author>
<FirstName>J.</FirstName>
<LastName>Rashidinia</LastName>
<Affiliation>Department of Mathematics, Islamic Azad University,Central Tehran Branch, Iran	
Iran, Islamic Republic of</Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
<Author>
<FirstName>N.</FirstName>
<LastName>Taher</LastName>
<Affiliation>Iran, Islamic Republic of</Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
</AuthorList>
<PublicationType>Journal Article</PublicationType>
<History>
<PubDate PubStatus="received">
<Year>2016</Year>
<Month>06</Month>
<Day>21</Day>
</PubDate>
</History>
<Abstract>In this work, we study the performance of the sinc-Collocation method for solving Bratu's problem. For different choices of step size, we consider the maximum absolute errors in the solutions at sinc grid points and tabulated in tables. The comparison of the obtained results veri ed that this method converges to the exact solution rapidly and with
</Abstract>
</Article>
</ArticleSet>