Hi, it seems not usual to solve ODEs using Newton's method. Why do you not consider using Runge-Kutta methods for example. In addition, numerical solvers for ODEs are available in C, FORTRAn, .. but not in symbolic calculation tools as Mathematica or MAPLE.
When using Backward Euler time discretization (which is implicit), you end up with a nonlinear equation of the form F(u_{n+1})=0, where u_{n+1} is the unknown function at (n+1) time step.
For this you can use Newton's method, like FindRoot(F(unew),unew0=uold). According to Mathematica documentation, FindRoot uses Newton's method.
Hi, in general implicit schemes that require the use of Newton's method are dedicated to stiff ODEs. In case of a classical non stiff system, explicit schemes such as Runge-Kutta, Dormand-Prince etc.. are adapted.
I too what the Mathematica code for Adomain decomposition method for linear as well as nonlinear equations in Fractional partial differential equations.