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!
===={{mvar|k}} variables, {{mvar|k}} functions{{anchor|multidimensional}}==== One may also use Newton's method to solve systems of {{mvar|k}} equations, which amounts to finding the (simultaneous) zeroes of {{mvar|k}} continuously differentiable functions <math>f:\R^k\to \R.</math> This is equivalent to finding the zeroes of a single vector-valued function <math>F:\R^k\to \R^k.</math> In the formulation given above, the scalars {{mvar|x<sub>n</sub>}} are replaced by vectors {{math|'''x'''{{sub|{{var|n}}}}}} and instead of dividing the function {{math|{{var|f}}({{var|x}}{{sub|{{var|n}}}})}} by its derivative {{math|{{var|{{prime|f}}}}({{var|x}}{{sub|{{var|n}}}})}} one instead has to left multiply the function {{math|{{var|F}}('''x'''{{sub|{{var|n}}}})}} by the inverse of its {{math|{{var|k}} Γ {{var|k}}}} [[Jacobian matrix]] {{math|{{var|J}}{{sub|{{var|F}}}}('''x'''{{sub|{{var|n}}}})}}.<ref name=":3">{{Cite book |last1=Burden |first1=Burton |url=https://archive.org/details/numericalanaly00burd/ |title=Numerical Analysis |last2=Fairs |first2=J. Douglas |last3=Reunolds |first3=Albert C |date=July 1981 |publisher=Prindle, Weber & Schmidt |isbn=0-87150-314-X |edition=2nd |location=Boston, MA, United States |oclc=1036752194 |pages=448β452 |language=en}}</ref><ref>{{Cite book |last= Evans |first=Gwynne A. |url-access= registration|url=https://archive.org/details/practicalnumeric0000evan/ |title=Practical Numerical Analysis |date=1995 |publisher=John Wiley & Sons|isbn=0471955353 |location= Chichester |publication-date=1995 |pages=30β33 |language=en | oclc=1319419671 }}</ref><ref>{{Cite book |last1=Demidovich |first1=Boris Pavlovich |url=https://archive.org/details/computational-mathematics/mode/2up |title=Computational Mathematics |last2=Maron |first2=Isaak Abramovich |date=1981 |publisher=MIR Publishers |isbn=9780828507042 |edition=Third |location=Moscow |pages=460β478 |language=en}}</ref> This results in the expression <math display="block">\mathbf{x}_{n+1} = \mathbf{x}_{n} - J_F(\mathbf{x}_n)^{-1} F(\mathbf{x}_n) .</math> or, by solving the [[system of linear equations]] <math display="block">J_F(\mathbf{x}_n) (\mathbf{x}_{n+1} - \mathbf{x}_n) = -F(\mathbf{x}_n)</math> for the unknown {{math|'''x'''{{sub|{{var|n}} + 1}} β '''x'''{{sub|{{var|n}}}}}}.<ref>{{cite book |last1=Kiusalaas |first1=Jaan |title=Numerical Methods in Engineering with Python 3 |date=March 2013 |publisher=Cambridge University Press |location=New York |isbn=978-1-107-03385-6 |pages=175β176 |edition=3rd |url=https://www.cambridge.org/9781107033856}}</ref>
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)