Skip to main content

Symbolic-Numeric QD-algorithms with applications in Function theory and Linear algebra

  • Conference paper
Symbolic Algebraic Methods and Verification Methods

Abstract

The univariate qd-algorithm is very useful for the determination of poles of meromorphic functions and eigenvalues of certain tridiagonal matrices. Both applications are linked to the theory of orthogonal polynomials, in particular the formally orthogonal Hadamard polynomials.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
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

  • Benouahmane, B. and Cuyt, A. (1999): Properties of multivariate homogeneous orthogonal polynomials. J. Approx. Th. submitted.

    Google Scholar 

  • Benouahmane, B., Cuyt, A. and Verdonk, B. (2000): On the solution of parameterized (smallest) eigenvalue problems. SIAM J. Matrix Anal. & Applcs. submitted.

    Google Scholar 

  • Brezinski, C. (1980): Padé type approximation and general orthogonal polynomials. Birkhauser Verlag, Basel.

    MATH  Google Scholar 

  • Chaffy, C. (1984): Interpolation polynomiale et rationnelle d’une fonction de plusieurs variables complexes. Thèse. Inst. Polytech., Grenoble.

    Google Scholar 

  • Cuyt, A. (1988): A multivariate qd-like algorithm. BIT 28: 98–112.

    Article  MathSciNet  MATH  Google Scholar 

  • Cuyt, A. (1992): Extension of “A multivariate convergence theorem of the de Montessus de Ballore type” to multipoles. J. Comput. Appl. Math.41: 323–330.

    Article  MathSciNet  MATH  Google Scholar 

  • Cuyt, A. (1994): On the convergence of the multivariate “homogeneous” qd-algorithm. BIT 34: 535–545.

    Article  MathSciNet  MATH  Google Scholar 

  • Cuyt, A. and Verdonk, B. (1999): Extending the qd-algorithm to tackle multivariate problems. In: Papamichael, N., Ruscheweyh, S., and Saff, B. (eds.): Proceedings of the Third CMFT Conference “Computational methods and function theory 1997“, Nicosia, Cyprus. World Scientific, pp. 135–159.

    Google Scholar 

  • Fernando, K. and Parlett, B. (1994): Accurate singular values and differential qd algorithms. Numer. Math. 67: 191–229.

    Article  MathSciNet  MATH  Google Scholar 

  • Henrici, P. (1974): Applied and computational complex analysis I. John Wiley, New York.

    Google Scholar 

  • Von Matt, U. (1997): The orthogonal QD-algorithm. SIAM J. Sci. Statist. Comput. 18: 1163–1186.

    Article  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Wien

About this paper

Cite this paper

Cuyt, A. (2001). Symbolic-Numeric QD-algorithms with applications in Function theory and Linear algebra. In: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds) Symbolic Algebraic Methods and Verification Methods. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6280-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6280-4_5

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83593-7

  • Online ISBN: 978-3-7091-6280-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics