Solving Stiff Problems Using Generalized Picard Iterations

The main point of the talk is an alternative approach to the construction of numerical methods for stiff problems. It can be interpreted as a generalization of fixed-point iterations for implementation of implicit collocation methods. Proposed algorithms combine easy implementation and low cost of iterations with superior convergence properties on stiff problems, when compared to the conventional Picard iteration.