A fast algorithm for generalized Hankel matrices arising in finite-moment problems

DOI10.1016/S0024-3795(97)80041-9zbMath0893.65017OpenAlexW2038659964MaRDI QIDQ1373307

Luca Gemignani

Publication date: 24 August 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(97)80041-9

zbMATH Keywords

orthogonal polynomialsHankel matrixfast algorithmfinite moment problems

Mathematics Subject Classification ID

Numerical methods for integral transforms (65R10) Moment problems (44A60) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Fast and stable computation of the barycentric representation of rational interpolants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical solution of the finite moment problem in a reproducing kernel Hilbert space
• Algebraic methods for Toeplitz-like matrices and operators
• Lyapunov, Bézout, and Hankel
• Efficient solution of linear systems of equations with recursive structure
• Efficient algorithm for Toeplitz plus Hankel matrices
• Fast and stable computation of the barycentric representation of rational interpolants
• On computational applications of the theory of moment problems
• Generalized companion matrices and matrix representations for generalized Bézoutians
• How bad are Hankel matrices?
• A look-ahead algorithm for the solution of general Hankel systems
• Fast inversion of Chebyshev-Vandermonde matrices
• Recovering a function from a finite number of moments
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
• Displacement Structure: Theory and Applications