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

Authors:
Georg Heinig
Affiliations:
-
Venue:
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Year:
2000

Citing 4
Cited 1

Fast Fourier transforms for nonequispaced data

SIAM Journal on Scientific Computing
Displacement structure: theory and applications

SIAM Review
Fast algorithms for discrete polynomial transforms

Mathematics of Computation
A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured Matrices

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Power series composition and change of basis

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

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 constructed.