2024
DOI: 10.1002/mma.9876
|View full text |Cite
|
Sign up to set email alerts
|

From Halley to Secant: Redefining root finding with memory‐based methods including convergence and stability

Sania Qureshi,
Amanullah Soomro,
Amir Naseem
et al.

Abstract: Root‐finding methods solve equations and identify unknowns in physics, engineering, and computer science. Memory‐based root‐seeking algorithms may look back to expedite convergence and enhance computational efficiency. Real‐time systems, complicated simulations, and high‐performance computing demand frequent, large‐scale calculations. This article proposes two unique root‐finding methods that increase the convergence order of the classical Newton–Raphson (NR) approach without increasing evaluation time. Taylor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
6
0

Year Published

2024
2024
2025
2025

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 29 publications
0
6
0
Order By: Relevance
“…Recently, in [4], the authors presented the well-known secant method utilizing calculus and analytic geometry. Additionally, they introduced several iterative methods and conducted convergence analysis on them.…”
Section: Introduction and Main Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…Recently, in [4], the authors presented the well-known secant method utilizing calculus and analytic geometry. Additionally, they introduced several iterative methods and conducted convergence analysis on them.…”
Section: Introduction and Main Discussionmentioning
confidence: 99%
“…The comments provide valuable insights into the references cited in [4]. It's important to ensure proper attribution and acknowledgment of prior work in academic research.…”
Section: Introduction and Main Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Researchers [48] have deduced some important inequalities for fractional multiple Erdélyi-Kober type operator. Numerical techniques were developed for some problems to compute their approximate solutions; we refer to [39,40]. The area related to investigate the qualitative theory has been evaluated very well.…”
mentioning
confidence: 99%