Recursive elucidation of polynomial congruences using root-finding numerical techniques

DOI10.1155/2014/575064zbMath1474.11205OpenAlexW2170440221WikidataQ59039577 ScholiaQ59039577MaRDI QIDQ1724425

Farooq Ahmad, Muhammad Khalid Mahmood

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/575064

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Primality (11Y11)

Related Items (1)

Applications of a \(q\)-Salagean type operator on multivalent functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative root approximation in \(p\)-adic numerical analysis
• A basic family of iteration functions for polynomial root finding and its characterizations
• Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
• Some new variants of Newton's method.
• Fast Iterative Division of p-adic Numbers
• Numerical analysis meets number theory: Using rootfinding methods to calculate inverses mod pn
• On Optimal Ierative Schemes for High-Speed Division
• A variant of Newton's method with accelerated third-order convergence

This page was built for publication: Recursive elucidation of polynomial congruences using root-finding numerical techniques