Advertisement

Examples

  • Adhemar Bultheel
Chapter
Part of the Operator Theory: Advances and Applications book series (OT, volume 27)

Abstract

In this chapter we shall give some simple examples to illustrate the meaning of the theorems and the computations performed by the algoritms. The reader should be warned for the poor numerical performance of these algorithms when implemented in finite arithmetic. Only for the positive definite case considered in previous chapter, the Levinson and Schur algorithm can be considered to be numerically stable [CYB,BU10]. To avoid numerical difficulties, we shall give examples that are computable in exact arithmetic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag Basel 1987

Authors and Affiliations

  • Adhemar Bultheel
    • 1
  1. 1.Dept. Computer ScienceK. U. LeuvenLeuven-HeverleeBelgium

Personalised recommendations