scientific article; zbMATH DE number 749853

zbMATH Open0830.65007MaRDI QIDQ4764036FDOQ4764036

Authors: Martin H. Gutknecht, W. B. Gragg 

Publication date: 4 February 1996

Title of this publication is not available (Why is that?)

Recommendations

• The stable computation of formal orthogonal polynomials
• A matrix interpretation of the extended Euclidean algorithm
• Optimized look-ahead recurrences for adjacent rows in the Padé table
• Look-ahead Levinson- and Schur-type recurrences in the Padé table

zbMATH Keywords

continued fractionEuclidean algorithmpower seriesformal orthogonal polynomialsmoment matrix\(z\)-transformrecurrencesChebyshev algorithminfinite Hankel matrixCabay-Meleshko algorithmlook-ahead strategies

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Numerical methods for integral transforms (65R10) Moment problems (44A60)

Cited In (8)

• Parallel computation of polynomial GCD and some related parallel computations over abstract fields
• Euclid algorithm, orthogonal polynomials, and generalized Routh-Hurwitz algorithm
• The stable computation of formal orthogonal polynomials
• A matrix interpretation of the extended Euclidean algorithm
• Look-ahead methods for block Hankel systems
• A stabilized superfast solver for indefinite Hankel systems
• Hankel matrices, positive functions and related questions
• Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764036)