Skip to main content
Log in

Computable Error Bounds for Coefficients Perturbation Methods

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The coefficients perturbation method (CPM) is a numerical technique for solving ordinary differential equations (ODE) associated with initial or boundary conditions. The basic principle of CPM is to find the exact solution of an approximation problem obtained from the original one by perturbing the coefficients of the ODE, as well as the conditions associated to it. In this paper we shall develop formulae for calculating tight error bounds for CPM when this technique is applied to second order linear ODEs. Unlike results reported in the literature, ours do not require any a priori information concerning the exact error function or its derivative. The results of this paper apply in particular to the Tau Method and to any approximation procedure equivalent to it. The convergence of the derived bounds is also discussed, and illustrated numerically.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received April 5, 2002; revised June 11, 2002 Published online: December 12, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

El-Daou, M. Computable Error Bounds for Coefficients Perturbation Methods. Computing 69, 305–317 (2002). https://doi.org/10.1007/s00607-002-1462-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-002-1462-0

Navigation