Hi all, when solving nonlinear problems, I simply went with
# define F J = derivative(F, u) solve(F1 == 0, u, bcs, J) for now (which uses Newton's method). I noticed, however, that the computation of the Jacobian, nonlinear_problem.J(*_A, x); takes by the most time in the computation. Is there some caching I could employ? I need to solve a similar nonlinear system in each time step. --Nico
_______________________________________________ fenics-support mailing list [email protected] http://fenicsproject.org/mailman/listinfo/fenics-support
