Computational Science Asked by user37077 on April 3, 2021
I’m trying to code up in Matlab a multivariable Newton’s method, for a mapping from R^2 to R, but the Jacobian would be a 2×1 matrix, not square, so it wouldn’t be invertible.
Does this mean that Newton’s method can’t be used for root-finding, when mappings are from R^2 to R?
Would I then need to implement a derivative-free method instead, or is there a workaround?
Thanks,
Newton's method can refer either to a method for solving $f(x)=0$ where $f: R^{n} rightarrow R^{n}$, or to a method for minimizing/maximizing a function $g: R^{n} rightarrow R$ by solving the system of equations $nabla g(x)=0$.
Your function $h$ maps $R^{2}$ to $R$ and you want to find a zero of the function. This is typically done by minimizing
$min h(x)^{2}$
Newton's method for minimizing a function can be applied to minimizing $h(x)^{2}$.
Correct answer by Brian Borchers on April 3, 2021
Get help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP