Optimal discrete and continuous mono-implicit Runge-Kutta schemes for BVODEs

@article{Muir1999OptimalDA,
  title={Optimal discrete and continuous mono-implicit Runge-Kutta schemes for BVODEs},
  author={Paul H. Muir},
  journal={Adv. Comput. Math.},
  year={1999},
  volume={10},
  pages={135-167}
}
Recent investigations of discretization schemes for the efficient numerical solution of boundary value ordinary differential equations (BVODEs) have focused on a subclass of the well-known implicit Runge–Kutta (RK) schemes, called mono-implicit RK (MIRK) schemes, which have been employed in two software packages for the numerical solution of BVODEs, called TWPBVP and MIRKDC. The latter package also employs continuous MIRK (CMIRK) schemes to provide C continuous approximate solutions. The… CONTINUE READING
7 Citations
31 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Efficient higher order implicit one-step methods for integration of stiff differential equations, BIT

  • W.M.G. van Bokhoven
  • 1980
Highly Influential
18 Excerpts

The Numerical Analysis of Ordinary Differential Equations (Wiley

  • J. C. Butcher
  • 1987
Highly Influential
8 Excerpts

Mono-implicit Runge–Kutta formulae for the numerical integration of stiff differential systems

  • J. R. Cash, A. Singhal
  • IMA J. Numer. Anal. 2
  • 1982
Highly Influential
11 Excerpts

The Analysis of Discretization Methods for Ordinary Differential Equations

  • H. Stetter
  • 1982
Highly Influential
4 Excerpts

Superconvergent continuous Runge–Kutta schemes for discrete collocation solutions

  • W. H. Enright, P. H. Muir
  • submitted to SIAM J. Sci. Comput.
  • 1997
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…