Afficher la notice abrégée
dc.contributor.author |
Kecies, Mohamed |
|
dc.contributor.author |
Zerzaihi, Tahar (Encadreur) |
|
dc.date.accessioned |
2020-10-14T09:53:36Z |
|
dc.date.available |
2020-10-14T09:53:36Z |
|
dc.date.issued |
2006-06-29 |
|
dc.identifier.uri |
http://dspace.univ-jijel.dz:8080/xmlui/handle/123456789/914 |
|
dc.description.abstract |
In this work we determined some algorthms to calculate the square roots of p-adic numbers (Hensel codes) via the classical numerical methods Newton, Secant, fixed point and this through the calculation of the approached solution of the zero of a function defined on Qp. We also determined the speed of convergence, the number of iteration and the Hensel's codes. We made the same work determination of the inverse of p-adic number. |
fr_FR |
dc.language.iso |
fr |
fr_FR |
dc.title |
L'algorithme de calcul de code Hensel pour les racines des nombres p-adiques |
fr_FR |
dc.type |
Thesis |
fr_FR |
Fichier(s) constituant ce document
Ce document figure dans la(les) collection(s) suivante(s)
Afficher la notice abrégée