Fully implicit one-step methods for neutral functional-differential equations

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The author discusses the class of fully implicit one-step methods of any order for the numerical solution of neutral functional-differential equations. For judicious choices of the parameters these methods are NP-stable, which means that the numerical approximation to the solution Y of the linear test equation y′ = ay(t) + by(t-d) + cy′(t-d), t ≥ 0, is bounded whenever Y is bounded. This property is an analogue of A-stability of ordinary differential equations. The local discretization error of these methods can be estimated by comparing two approximations of successive orders. This can be done in a very efficient way, and these methods can be implemented in variable-step mode with a step-changing strategy based on this estimate. Numerical results are presented that illustrate the high potential of fully implicit formulas.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Decision and Control
PublisherPubl by IEEE
Pages813
Number of pages1
StatePublished - Dec 1988
EventProceedings of the 27th IEEE Conference on Decision and Control - Austin, TX, USA
Duration: Dec 7 1988Dec 9 1988

Other

OtherProceedings of the 27th IEEE Conference on Decision and Control
CityAustin, TX, USA
Period12/7/8812/9/88

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'Fully implicit one-step methods for neutral functional-differential equations'. Together they form a unique fingerprint.

Cite this