Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Newton's method
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Over {{mvar|p}}-adic numbers=== In {{mvar|p}}-adic analysis, the standard method to show a polynomial equation in one variable has a {{mvar|p}}-adic root is [[Hensel's lemma]], which uses the recursion from Newton's method on the {{mvar|p}}-adic numbers. Because of the more stable behavior of addition and multiplication in the {{mvar|p}}-adic numbers compared to the real numbers (specifically, the unit ball in the {{mvar|p}}-adics is a ring), convergence in Hensel's lemma can be guaranteed under much simpler hypotheses than in the classical Newton's method on the real line.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)