<?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>Semnan University Press</PublisherName>
				<JournalTitle>Journal of Modeling in Engineering</JournalTitle>
				<Issn>2008-4854</Issn>
				<Volume>23</Volume>
				<Issue>80</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>03</Month>
					<Day>21</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Enhancing Efficiency of Newton-Raphson Method with Chaotic Mappings for Nonlinear Equation Solving</ArticleTitle>
<VernacularTitle>Enhancing Efficiency of Newton-Raphson Method with Chaotic Mappings for Nonlinear Equation Solving</VernacularTitle>
			<FirstPage>59</FirstPage>
			<LastPage>73</LastPage>
			<ELocationID EIdType="pii">9358</ELocationID>
			
<ELocationID EIdType="doi">10.22075/jme.2024.32533.2574</ELocationID>
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Javad</FirstName>
					<LastName>Alikhani Koopaei</LastName>
<Affiliation>Department of Mathematics, Payame Noor University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad Javad</FirstName>
					<LastName>Ebadi</LastName>
<Affiliation>Department of Mathematics, Chabahar Maritime University, Chabahar, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>12</Month>
					<Day>09</Day>
				</PubDate>
			</History>
		<Abstract>One of the most powerful methods for solving nonlinear equations is the Newton-Raphson algorithm. Although this algorithm is highly efficient, it faces two challenges: sensitivity to the starting point and the possibility of getting stuck in a loop for the solution sequence. In this paper, by adding a small disruptive term to the Newton recursive relation, we practically generate a chaotic pseudo-random sequence, thus addressing these two challenges. The effectiveness of the proposed version has been numerically demonstrated on several nonlinear equations. The results show that the improved version is not sensitive to the initial conditions and escapes from the loop due to the generation of a random sequence, while maintaining an acceptable execution time due to the use of a deterministic system in generating the random sequence.&lt;br /&gt; </Abstract>
			<OtherAbstract Language="FA">One of the most powerful methods for solving nonlinear equations is the Newton-Raphson algorithm. Although this algorithm is highly efficient, it faces two challenges: sensitivity to the starting point and the possibility of getting stuck in a loop for the solution sequence. In this paper, by adding a small disruptive term to the Newton recursive relation, we practically generate a chaotic pseudo-random sequence, thus addressing these two challenges. The effectiveness of the proposed version has been numerically demonstrated on several nonlinear equations. The results show that the improved version is not sensitive to the initial conditions and escapes from the loop due to the generation of a random sequence, while maintaining an acceptable execution time due to the use of a deterministic system in generating the random sequence.&lt;br /&gt; </OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Newton-Raphson algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Nonlinear equation Solving methods</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Chaotic Maps</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">random sequences</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://modelling.semnan.ac.ir/article_9358_14e77b31b28b8289bda2bd37d10500b4.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
