Please login with a confirmed email address before reporting spam
Here is a literal description of what the double dog leg method does. You would have to look into the numerical analysis, particularly the numerical optimization, literature for a rigorous discussion.
After discretization with the finite element method you end up with a system of generally nonlinear algebraic system of equations with the unknowns usually being the solutions at the nodes. You need a nonlinear algebraic solver to solve that.
The Newton method is what is often used and it has a nice quadratic convergence behavior, when it converges. The downside is the iteration has to be close to the solution for this quadratic convergence or even convergence to be achieved. Start too far away from the solution in a strongly nonlinear problem and you can end up even diverging.
On the otherhand residual minimization methods for solving roots are robust in terms of their regions of convergence. But converge slower than the Newton method.
The double dog leg idea is to evaluate those two legs (Newton and Cauchy) and optimally combine the two directions to exploit the advantages of both. The numbers for Newton or Cauchy in the COMSOL solver log indicate how much weight (0 to 1) is given to the method in question.
In a well behaved problem you should be able to take the full Newton step. So usually the Newton weight has to be 1 and Cauchy has to be 0. Sometimes you can have problems where the residual is small but since the double dog leg algorithm could not take the full Newton it keeps iterating even though based on residuals you can say you are good.
This is what is going on as far as the solver is concerned. Try switching the solver to Constant Newton. This is a physics agnostic recommendation. You may have to consult the support team if this doesn't resolve it and you need a closer look.
-------------------
We all have opinions. But the COMSOL support team has the truth. I don't know if my opinion is still the truth. Check with that team before you try this at home!
Here is a literal description of what the double dog leg method does. You would have to look into the numerical analysis, particularly the numerical optimization, literature for a rigorous discussion.
After discretization with the finite element method you end up with a system of generally nonlinear algebraic system of equations with the unknowns usually being the solutions at the nodes. You need a nonlinear algebraic solver to solve that.
The Newton method is what is often used and it has a nice quadratic convergence behavior, when it converges. The downside is the iteration has to be close to the solution for this quadratic convergence or even convergence to be achieved. Start too far away from the solution in a strongly nonlinear problem and you can end up even diverging.
On the otherhand residual minimization methods for solving roots are robust in terms of their regions of convergence. But converge slower than the Newton method.
The double dog leg idea is to evaluate those two legs (Newton and Cauchy) and optimally combine the two directions to exploit the advantages of both. The numbers for Newton or Cauchy in the COMSOL solver log indicate how much weight (0 to 1) is given to the method in question.
In a well behaved problem you should be able to take the full Newton step. So usually the Newton weight has to be 1 and Cauchy has to be 0. Sometimes you can have problems where the residual is small but since the double dog leg algorithm could not take the full Newton it keeps iterating even though based on residuals you can say you are good.
This is what is going on as far as the solver is concerned. Try switching the solver to Constant Newton. This is a physics agnostic recommendation. You may have to consult the support team if this doesn't resolve it and you need a closer look.