Hi Shawn, I am kind of surprised by your question because I assumed this type of algorithm is part of any text book covering instationary PDEs. The logic is called adaptive timesteps. The length of the timestep depends on the number of Newton iterations. If it does not converge the timestep is decreased. If it converges fast enough the timestap is widened. Chapter 9 in the DuMuX handbook has some more details or have a look in the according time stepping class in DuMuX to learn the details.
Bye Christoph _______________________________________________ Dumux mailing list [email protected] https://listserv.uni-stuttgart.de/mailman/listinfo/dumux
