Skip to main content
SpringerLink
Log in
Book cover

International Conference on Numerical Analysis and Its Applications

NAA 2000: Numerical Analysis and Its Applications pp 385–392Cite as

Fast and Superfast Algorithms for Hankel-Like Matrices Related to Orthogonal Polynomials

  • Conference paper
  • First Online:

  • 1271 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1988))

Abstract

Matrices are investigated that are Hankel matrices in bases of orthogonal polynomials. With the help of 3 equivalent definitions of this class fast LU-factorization algorithms and superfast solvers are con-structed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dutt, A., Rokhlin, V.: Fast Fourier transforms for nonequispaced data. SIAM J. Sci. Comp. 14 (1993) 1368–1393

    Article  MATH  MathSciNet  Google Scholar 

  2. Fasino, D.: Preconditioning finite moment problems. J. Comp. Appl. Math. 65(1995) 145–155

    Article  MATH  MathSciNet  Google Scholar 

  3. Gemignani, L.: A fast algorithm for generalized Hankel matrices arising in finite-moment problems. Linear Algebra Appl. 267 (1997) 41–52

    MATH  MathSciNet  Google Scholar 

  4. Golub, G., Gutknecht, M.: Modified moments for indefinite weight functions. Nu-mer. Math. 67 (1994) 71–92

    Article  Google Scholar 

  5. Gustafson, S. A.: On computational applications of the theory of moment problems. Rocky Mountain J. Math. 2 (1974) 227–240

    Article  MathSciNet  Google Scholar 

  6. Heinig, G.: Chebyshev-Hankel matrices and the splitting approach for centrosym-metric Toeplitz-plus-Hankel matrices. Linear Algebra Appl. (to appear)

    Google Scholar 

  7. Heinig, G., Bojanczyk, A.: Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices, I. Transformations: Linear Algebra Appl. 254 (1997) 193–226, II. Algorithms: Linear Algebra Appl. 278 (1998), 11-36

    Article  MATH  MathSciNet  Google Scholar 

  8. Heinig, G., Hoppe, W., Rost, K.: Structured matrices in interpolation and ap-proximation problems, Wissensch. Zeitschr. d. TU Karl-Marx-Stadt 31 2 (1989) 196–202

    MATH  MathSciNet  Google Scholar 

  9. Heinig, G., Olshevsky, V.: The Schur algorithm for matrices with Hessenberg dis-placement structure. (in preparation)

    Google Scholar 

  10. Heinig, G., Rost, K.: Algebraic Methods for Toeplitz-like matrices and operators. Akademie-Verlag Berlin and Birkhäuser Basel, Boston, Stuttgart, 1984

    Google Scholar 

  11. Kailath, T., Sayed, A.: Displacement structure: Theory and applications. SIAM Revue 37 (1995) 297–386

    Article  MATH  MathSciNet  Google Scholar 

  12. Olshevsky, V., Pan, V.: A unified superfast algorithm for boundary rational tangen-tial interpolation problems and for inversion and factorization of dense structured matrices. Proc. of 39th Annual IEEE Symposium on Foundation of Computer Science1998, 192–201

    Google Scholar 

  13. Potts, D., Steidl, G., Tasche, M.: Fast algorithms for discrete polynomial trans-forms. Math.Comp. 67 224 (1998) 1577–1599

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math.& Comp.Sci., Kuwait University, P.O.Box 5969, 13060, Safat, Kuwait

    Georg Heinig

Authors
  1. Georg Heinig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rousse, 7000, Rousse, Bulgaria

    Lubin Vulkov  & Plamen Yalamov  & 

  2. UNI-C,Danish Computing Center for Research and Education, DTU,Building 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heinig, G. (2001). Fast and Superfast Algorithms for Hankel-Like Matrices Related to Orthogonal Polynomials. In: Vulkov, L., Yalamov, P., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2000. Lecture Notes in Computer Science, vol 1988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45262-1_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-45262-1_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41814-6

  • Online ISBN: 978-3-540-45262-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation