SIAM Journal on Scientific Computing · 1996 · 78 citations · 30 references
Natural SciencesComputational EngineeringComputational Fluid DynamicsComputational MechanicsDifferential EquationsBoundary-value ProblemsInitial Value ProblemsNumerical AlgorithmsNumerical AnalysisNumerical ConvergenceNumerical Methods For Differential EquationsBoundary Value Problem SolversDefect ControlDifferential Equation SolversDiscrete Approximation SchemesInterpolation AlgorithmsNumerical Methods For Initial Value Problems
A popular approach to the numerical solution of boundary value ODE problems involves the use of collocation methods. Such methods can be naturally implemented so as to provide a continuous approximation to the solution over the entire problem interval. On the other hand, several authors have suggested as an alternative, certain subclasses of the implicit Runge–Kutta formulas, known as mono-implicit Runge–Kutta (MIRK) formulas, which can be implemented at a lower cost per step than the collocation methods. These latter formulas do not have a natural implementation that provides a continuous approximation to the solution; rather, only a discrete approximation at certain points within the problem interval is obtained. However, recent work in the area of initial value problems has demonstrated the possibility of generating inexpensive interpolants for any explicit Runge–Kutta formula. These ideas have recently been extended to develop continuous extensions of the MIRK formulas. In this paper, we describe our investigation of the use of continuous MIRK formulas in the numerical solution of boundary value ODE problems. A primary thrust of this investigation is to consider defect control, based on the continuous MIRK formulas, as an alternative to the standard use of global error control, as the basis for termination and mesh redistribution criteria.
30