Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Fast and Superfast Algorithms for Hankel-Like Matrices Related to Orthogonal Polynomials

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

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1988/2001
BookNumerical Analysis and Its Applications
DOI10.1007/3-540-45262-1
Copyright2001
ISBN978-3-540-41814-6
DOI10.1007/3-540-45262-1_45
Pages361-380
Subject CollectionComputer Science
SpringerLink DateMonday, January 01, 2001
Add to marked items

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

Georg Heinig6 Contact Information

(6)  Dept. of Math.& Comp.Sci., Kuwait University, P.O.Box 5969, 13060 Safat, Kuwait
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.

Keywords:  Hankel matrix - orthogonal polynomials - fast algorithm

Contact Information Georg Heinig
Email: georg@mcs.sci.kuniv.edu.kw
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.105 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)