Recursive elucidation of polynomial congruences using root-finding numerical techniques
Summary: In this paper we put forward a family of algorithms for lifting solutions of a polynomial congruence \(\mathrm{mod} p\) to polynomial congruence \(\mod p^k\). For this purpose, root-finding iterative methods are employed for solving polynomial congruences of the form \(a x^n \equiv b\pmod{p^k}\), \(k \geq 1\), where \(a\), \(b\) and \(n > 0\) are integers which are not divisible by an odd prime \(p\). It is shown that the algorithms suggested in this paper drastically reduce the complexity for such computations to a logarithmic scale. The efficacy of the proposed technique for solving negative exponent equations of the form \(a x^{- n} \equiv b\pmod{p^k}\) has also been addressed.
- Lifting of solutions of an exponential congruence
- A method for solving of polynomial congruence
- scientific article; zbMATH DE number 1094320
- scientific article; zbMATH DE number 7120932
- An elementary analysis of the solution of the congruence \(a_r x^r + a_{r-1} x^{r-1} +\ldots+ a_0 \equiv 0\pmod{p^n}\) and special congruence
- A basic family of iteration functions for polynomial root finding and its characterizations
- A variant of Newton's method with accelerated third-order convergence
- Fast Iterative Division of p-adic Numbers
- scientific article; zbMATH DE number 1001666 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
- Iterative root approximation in \(p\)-adic numerical analysis
- Numerical analysis meets number theory: Using rootfinding methods to calculate inverses mod pn
- On Optimal Ierative Schemes for High-Speed Division
- Some new variants of Newton's method.
- Parametrizing roots of polynomial congruences
- Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm
- A method for solving of polynomial congruence
- Оптимальные логарифмические функции для подъема решения показательного сравнения
- Applications of a \(q\)-Salagean type operator on multivalent functions
This page was built for publication: Recursive elucidation of polynomial congruences using root-finding numerical techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724425)
