DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS

DOI10.1142/9789812704436_0024MaRDI QIDQ4445028zbMATH OpenOpenAlexFDO

Authors Lihong Zhi

Publication date 28 January 2004

Published in Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789812704436_0024

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05)

Recommendations

• Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• An algorithm for computing certified approximate GCD of n univariate polynomials
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• Extended companion matrix for approximate GCD

Cited in

(16)

• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• Improving the DISPGB algorithm using the discriminant ideal
• A structured rank-revealing method for Sylvester matrix
• Approximate factorization of multivariate polynomials using singular value decomposition
• Extended companion matrix for approximate GCD
• Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• Regularization and matrix computation in numerical polynomial algebra
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Overdetermined Weierstrass iteration and the nearest consistent system
• Approximate greatest common divisor of several polynomials from Hankel matrices
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Structured matrix-based methods for polynomial -gcd: analysis and comparisons
• On rank and null space computation of the generalized Sylvester matrix
• Approximate polynomial GCD over integers

This page was built for publication: DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS

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