Extended companion matrix for approximate GCD

DOI10.1145/2331684.2331696MaRDI QIDQ2819619zbMATH OpenOpenAlexFDO

Authors Paola Boito, Olivier Ruatta

Publication date 29 September 2016

Published in Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2331684.2331696

zbMATH Keywords

approximate geometryapproximate greatest common divisorstructured matricessymbolic-numeric computation

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Polynomials, factorization in commutative rings (13P05) Numerical approximation and computational geometry (primarily algorithms) (65D99) Symbolic computation and algebraic computation (68W30)

Recommendations

• Structured matrix based methods for approximate polynomial GCD
• The approximate GCD of inexact polynomials
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Certified approximate univariate GCDs
• A fast algorithm for approximate polynomial gcd based on structured matrix computations

Cited in

(6)

• Real polynomial root-finding by means of matrix and polynomial iterations
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Approximate greatest common divisor of several polynomials from Hankel matrices
• GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients
• Approximate Polynomial gcd: Small Degree and Small Height Perturbations
• Approximate polynomial GCD: small degree and small height perturbations

This page was built for publication: Extended companion matrix for approximate GCD

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