A heuristic verification of the degree of the approximate GCD of two univariate polynomials

DOI10.1007/S11075-013-9793-9MaRDI QIDQ466858zbMATH OpenOpenAlexFDO

Authors Zhe Li, Qi Liu

Publication date 31 October 2014

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-013-9793-9

zbMATH Keywords

verificationpolynomialgreatest common divisor

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Polynomials, factorization in commutative rings (13P05) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• An algorithm for computing certified approximate GCD of n univariate polynomials
• An iterative method for calculating approximate GCD of univariate polynomials
• Approximate Polynomial gcd: Small Degree and Small Height Perturbations
• Certified approximate univariate GCDs
• scientific article; zbMATH DE number 953021

Cites work

• scientific article; zbMATH DE number 5168246 (Why is no real title available?)
• scientific article; zbMATH DE number 3682951 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 3355217 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• A Note on the Bezoutian Matrix
• A Test for Existence of Solutions to Nonlinear Systems
• A structured rank-revealing method for Sylvester matrix
• A subdivision method for computing nearest gcd with certification
• Accuracy and Stability of Numerical Algorithms
• Active Vibration Control of a Modular Robot Combining a Back-Propagation Neural Network with a Genetic Algorithm
• An iterative method for calculating approximate GCD of univariate polynomials
• Approximate GCD and its application to ill-conditioned algebraic equations
• Approximate gcds of polynomials and sparse SOS relaxations
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• BORDERED MATRICES AND SINGULARITIES OF LARGE NONLINEAR SYSTEMS
• Blind image deconvolution via fast approximate GCD
• Certified approximate univariate GCDs
• Characterization and Computation of Generalized Turning Points
• Characterization and Computation of Singular Points with Maximum Rank Deficiency
• Computation of approximate polynomial GCDs and an extension
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Detection and validation of clusters of polynomial zeros
• Existence of Solutions to Systems of Underdetermined Equations and Spherical Designs
• Fast enclosure for solutions in underdetermined systems
• Global minimization of rational functions and the nearest GCDs
• Greatest common divisor of two polynomials
• High-performance numerical algorithms and software for structured total least squares
• Improved Parallel Polynomial Division
• Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• Photonic band structure calculations using nonlinear eigenvalue techniques
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Quasi-gcd computations
• Structured low rank approximation of a Bezout matrix
• Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
• The Approximate Solution of Defining Equations for Generalized Turning Points
• The approximate GCD of inexact polynomials
• The approximation of generalized turning points by projection methods with superconvergence to the critical parameter
• Verification methods: rigorous results using floating-point arithmetic
• Verified bounds for least squares problems and underdetermined linear systems
• Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
• When are two numerical polynomials relatively prime?

Cited in

(4)

• Approximate Polynomial gcd: Small Degree and Small Height Perturbations
• Approximate polynomial GCD: small degree and small height perturbations
• An algorithm for computing certified approximate GCD of n univariate polynomials
• Computing nearest gcd with certification

Describes a project that uses

Uses Software

• mctoolbox
• MultRoot

This page was built for publication: A heuristic verification of the degree of the approximate GCD of two univariate polynomials

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