Mathematica Stack Exchange is a question and answer site for users of Mathematica. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The Help page of FindRoot says: "by default, FindRoot uses Newton's method (Newton-Raphson) to solve a nonlinear system". But I still have the following puzzles:

  1. How will the Jacobian be calculated in each iteration: symbolically or using finite difference approximation only?

  2. Is there any damping method of the step being used when the Jacobian at any step is invertible?

share|improve this question
up vote 24 down vote accepted

You can control how the Jacobian is calculated via the Jacobian option:

Grid[Module[{s = 0, e = 0}, 
     FindRoot[ArcTan[1000 Cos[x]], {x, 1}, StepMonitor :> s++, 
      EvaluationMonitor :> e++, Jacobian -> #, Method -> {"Newton"}],
     "Steps" -> s, 
     "Evaluations" -> e
    }] & /@ {"Symbolic", "FiniteDifference"}]


Note the Sparse suboption of this option described on the linked Documentation page (see also this tutorial page for additional examples of use), it works both with "Symbolic" and "FiniteDifference" methods. The DampingFactor option may be also of help.

You can also find useful this MathGroups answer by Oliver Ruebenkoenig (Wolfram Research).

share|improve this answer
Thank you very much! that is what I need! – LCFactorization Nov 26 '13 at 11:15
@LCFactorization There's some additional info here (3rd and 4th sections), mostly about how the Jacobian is updated. – Szabolcs Nov 26 '13 at 15:40

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.