1999SIAM Journal on Scientific ComputingRequires access

Superconvergent Interpolants for the Collocation Solution of Boundary Value Ordinary Differential Equations

W. H. Enright, Paul Muir

Open publisher page 22 citations

Abstract

A long-standing open question associated with the use of collocation methods for boundary value ordinary differential equations is concerned with the development of a high order continuous solution approximation to augment the high order discrete solution approximation, obtained at the mesh points which subdivide the problem interval. It is well known that the use of collocation at Gauss points leads to solution approximations at the mesh points for which the global error is O(h 2k ), where k is the number of collocation points used per subinterval and h is the subinterval size. This discrete solution is said to be superconvergent. The collocation solution also yields a C 0 continuous solution approximation that has a global error of O(h k +1). In this paper, we show how to efficiently augment the superconvergent discrete collocation solution to obtain C 1 continuous "superconvergent" interpolants whose global errors are O(h 2k ). The key ideas are to use the theoretical framework of continuous Runge--Kutta schemes and to augment the collocation solution with inexpensive monoimplicit Runge--Kutta stages. Specific schemes are derived for k = 1, 2, 3, and 4. Numerical results are provided to support the theoretical analysis.

About this research paper

What this paper is about

A long-standing open question associated with the use of collocation methods for boundary value ordinary differential equations is concerned with the development of a high order continuous solution approximation to augment the high order discrete solution approximation, obtained at the mesh points which subdivide the problem interval. It is well known that the use of collocation at Gauss points leads to solution approximations at the mesh points for which the global error is O(h 2k ), where k is the number of collocation points used per subinterval and h is the subinterval size. This discrete solution is said to be superconvergent. The collocation solution also yields a C 0 continuous solution approximation that has a global error of O(h k +1). In this paper, we show how to efficiently augment the superconvergent discrete collocation solution to obtain C 1 continuous "superconvergent" interpolants whose global errors are O(h 2k ). The key ideas are to use the theoretical framework of continuous Runge--Kutta schemes and to augment the collocation solution with inexpensive monoimplicit Runge--Kutta stages. Specific schemes are derived for k = 1, 2, 3, and 4. Numerical results are provided to support the theoretical analysis.

Why it matters

OpenAlex reports 22 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A long-standing open question associated with the use of collocation methods for boundary value ordinary differential equations is concerned with the development of a high order continuous solution approximation to augment the high order discrete solution approximation, obtained at the mesh points which subdivide the problem interval. It is well known that the use of collocation at Gauss points leads to solution approximations at the mesh points for which the global error is O(h 2k ), where k is the number of collocation points used per subinterval and h is the subinterval size. This discrete solution is said to be superconvergent. The collocation solution also yields a C 0 continuous solution approximation that has a global error of O(h k +1). In this paper, we show how to efficiently augment the superconvergent discrete collocation solution to obtain C 1 continuous "superconvergent" interpolants whose global errors are O(h 2k ). The key ideas are to use the theoretical framework of continuous Runge--Kutta schemes and to augment the collocation solution with inexpensive monoimplicit Runge--Kutta stages. Specific schemes are derived for k = 1, 2, 3, and 4. Numerical results are provided to support the theoretical analysis.

Key concepts: Superconvergence, Collocation (remote sensing), Collocation method, Mathematics, Orthogonal collocation, Ordinary differential equation, Runge–Kutta methods, Boundary value problem

Related papers

Back to paper searchBrowse research topicsOriginal source
Superconvergent Interpolants for the Collocation Solution of Boundary Value Ordinary Differential Equations — Research Paper | ScholarLens