Skip to main content

Error analysis of incoming and outgoing schemes for the trigonometric moment problem

  • Part II: Short Communications
  • Conference paper
  • First Online:
Padé Approximation and its Applications Amsterdam 1980

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 888))

Abstract

The solution of the trigonometric moment problem involves the computation of a (0/n) Laurent-Padé approximant for a positive real function on the complex unit circle. The incoming scheme is equivalent with the recursion for Szegö's orthogonal polynomials, while the outgoing scheme is equivalent to the schur recursion for contractions of the unit disc. The numerical stability of both algorithms is proved under certain conditions via a backward error analysis.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. I. Akhiezer, The classical moment problem, Oliver and Boyd, Edinburgh, London, 1965.

    MATH  Google Scholar 

  2. U. Grenander, G. Szegö, Toeplitz forms and their applications, University of California Press, Berkeley, 1958.

    MATH  Google Scholar 

  3. H.J. Landau, The classical moment problem: Hilbertian proofs, Journ. of Funct. Anal. 38, (1980), pp. 255–272.

    Article  MathSciNet  MATH  Google Scholar 

  4. G. Szegö, Orthogonal polynomials, A.M.S. Colloquium publ. XXIII, AMS Providence, Rhode Island, 1939.

    Google Scholar 

  5. W.B. Gragg, Laurent-, Fourier-and Chebyshev-Padé tables, in E.B. Saff, R.S. Varga (eds.), Padé and rational approximation, Theory and applications, Academic Press, New York, 1977, pp. 61–72.

    Chapter  Google Scholar 

  6. C. Brezinski, Padé type approximation and general orthogonal polynomials, Birkhauser Verlag, Basel, 1980.

    Book  MATH  Google Scholar 

  7. W.J. Thron, Two-point Padé tables, T-fractions and sequences of Schur, in E.B. Saff, R.S. Varga(op. cit.), pp. 215–226.

    Chapter  Google Scholar 

  8. A. Bultheel, P. Dewilde, On the relation between Padé approximation algorithms and Levinson/Schur recursive methods, in Proc. Conf. Signal Processing, EUSIPCO-80, M. Kunt, F. de Coulon (eds.), North-Holland, 1980, pp. 517–523.

    Google Scholar 

  9. N. Wiener, P. Masani, The prediction theory of multivariate stochastic processes, Acta Math. 98, (1957), pp. 111–150 and 99, (1958), pp. 93–139.

    Article  MathSciNet  MATH  Google Scholar 

  10. V. Cappellini, A.G. Constantinides, P. Emiliani, Digital filters and their applications, Ac. Press, New York, 1978.

    Google Scholar 

  11. J.D. Markel, A.H. Gray Jr., Linear prediction of speech, Springer-Verlag, Berlin, 1976.

    Book  MATH  Google Scholar 

  12. J. Schur, Ueber Pot enzreihen die im Innern des Einheitskreises beschränkt sind, J.f.d.R.u.Angew. Math. 147, (1917), pp. 205–232 and 148 (1918), pp. 122–145.

    MathSciNet  Google Scholar 

  13. A. Bultheel, Recursive algorithms for the matrix Padé problem, Math. of Comp. 35 (151), 1980, pp. 875–892.

    MathSciNet  MATH  Google Scholar 

  14. L.S. de Jong, Numerical aspects of the recursive realization algorithm, SIAM J. Cont. and Opt. 16, (1978), pp. 646–659.

    Article  MATH  Google Scholar 

  15. A. Bultheel, Towards an error analysis of fast Toeplitz factorization, Rept. TW 44, K.U.Leuven, Afd. Toeg. Wisk. & Progr., May 1979.

    Google Scholar 

  16. J.H. Wilkinson, The algebraic eigenvalue problem, Clarendon Press, Oxford, 1965.

    MATH  Google Scholar 

  17. G. Cybenko, Error analysis of Durbin's algorithm, to appear in SIAM J. for Scient. and Stat. Comp.

    Google Scholar 

  18. L.S. de Jong, Towards a formal definition of numerical stability, Numer. Math. 28, (1977), pp. 211–219.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. G. de Bruin H. van Rossum

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Srpinger-Verlag

About this paper

Cite this paper

Bultheel, A., Leuven, K.U. (1981). Error analysis of incoming and outgoing schemes for the trigonometric moment problem. In: de Bruin, M.G., van Rossum, H. (eds) Padé Approximation and its Applications Amsterdam 1980. Lecture Notes in Mathematics, vol 888. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095579

Download citation

  • DOI: https://doi.org/10.1007/BFb0095579

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11154-2

  • Online ISBN: 978-3-540-38606-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics