<?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>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Mathematics and Computing</JournalTitle>
				<Issn>2783-2449</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>09</Month>
					<Day>06</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A novel hybrid approach using the Jaya algorithm and rational Chebyshev polynomials for solving Lane-Emden type equations in astrophysical applications</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">6188</ELocationID>
			
<ELocationID EIdType="doi">10.22060/ajmc.2025.24513.1432</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Arman</FirstName>
					<LastName>Akbarzadeh</LastName>
<Affiliation>Department of Computer and Data Sciences, Faculty of Mathematical Sciences, Shahid Beheshti University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hassan</FirstName>
					<LastName>Dana Mazraeh</LastName>
<Affiliation>School of Mathematics and Computer Sciences, Damghan University,  P.O. Box 36715-364, Damghan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Kourosh</FirstName>
					<LastName>Parand</LastName>

						<AffiliationInfo>
						<Affiliation>School of Mathematics and Computer Sciences, Damghan University,  P.O. Box 36715-364, Damghan, Iran</Affiliation>
						</AffiliationInfo>

						<AffiliationInfo>
						<Affiliation>Department of Cognitive Modeling, Institute for Cognitive and Brain Sciences, Shahid Beheshti University, Tehran,
Iran</Affiliation>
						</AffiliationInfo>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>08</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		    <Abstract>The Jaya algorithm is a population-based metaheuristic algorithm used for solving optimization problems. The algorithm&#039;s fundamental principle revolves around generating an initial random population. Through iterative refinement using update rules, the goal is to bring the solution closer to the optimal outcome while concurrently distancing it from suboptimal results. This paper presents the application of the Jaya algorithm in solving the Lane-Emden type equations using rational Chebyshev polynomials and standard polynomials as base functions. The results indicate that the Jaya algorithm is a reliable and capable method for solving the Lane-Emden type equations.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Lane-Emden equations</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Jaya algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Rational Chebyshev polynomials</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Metaheuristic algorithm</Param>
			</Object>
		</ObjectList>
</Article>
</ArticleSet>
