Nowadays there is an increasing emphasis on all aspects of adaptively gener­ ating a grid that evolves with the solution of a PDE. Another challenge is to develop efficient higher-order one-step integration methods which can handle very stiff equations and which allow us to accommodate a spatial grid in each time step without any specific difficulties. In this monograph a combination of both error-controlled grid refinement and one-step methods of Rosenbrock-type is presented. It is my intention to impart the beauty and complexity found in the theoretical investigation of the adaptive algorithm proposed here, in its realization and in solving non-trivial complex problems. I hope that this method will find many more interesting applications. Berlin-Dahlem, May 2000 Jens Lang Acknowledgements I have looked forward to writing this section since it is a pleasure for me to thank all friends who made this work possible and provided valuable input. I would like to express my gratitude to Peter Deuflhard for giving me the oppor­ tunity to work in the field of Scientific Computing. I have benefited immensly from his help to get the right perspectives, and from his continuous encourage­ ment and support over several years. He certainly will forgive me the use of Rosenbrock methods rather than extrapolation methods to integrate in time.

Nowadays there is an increasing emphasis on all aspects of adaptively gener­ ating a grid that evolves with the solution of a PDE. Another challenge is to develop efficient higher-order one-step integration methods which can handle very stiff equations and which allow us to accommodate a spatial grid in each time step without any specific difficulties. In this monograph a combination of both error-controlled grid refinement and one-step methods of Rosenbrock-type is presented. It is my intention to impart the beauty and complexity found in the theoretical investigation of the adaptive algorithm proposed here, in its realization and in solving non-trivial complex problems. I hope that this method will find many more interesting applications. Berlin-Dahlem, May 2000 Jens Lang Acknowledgements I have looked forward to writing this section since it is a pleasure for me to thank all friends who made this work possible and provided valuable input. I would like to express my gratitude to Peter Deuflhard for giving me the oppor­ tunity to work in the field of Scientific Computing. I have benefited immensly from his help to get the right perspectives, and from his continuous encourage­ ment and support over several years. He certainly will forgive me the use of Rosenbrock methods rather than extrapolation methods to integrate in time.

Nowadays there is an increasing emphasis on all aspects of adaptively gener­ ating a grid that evolves with the solution of a PDE. Another challenge is to develop efficient higher-order one-step integration methods which can handle very stiff equations and which allow us to accommodate a spatial grid in each time step without any specific difficulties. In this monograph a combination of both error-controlled grid refinement and one-step methods of Rosenbrock-type is presented. It is my intention to impart the beauty and complexity found in the theoretical investigation of the adaptive algorithm proposed here, in its realization and in solving non-trivial complex problems. I hope that this method will find many more interesting applications. Berlin-Dahlem, May 2000 Jens Lang Acknowledgements I have looked forward to writing this section since it is a pleasure for me to thank all friends who made this work possible and provided valuable input. I would like to express my gratitude to Peter Deuflhard for giving me the oppor­ tunity to work in the field of Scientific Computing. I have benefited immensly from his help to get the right perspectives, and from his continuous encourage­ ment and support over several years. He certainly will forgive me the use of Rosenbrock methods rather than extrapolation methods to integrate in time.