Toward the best algorithm for approximate GCD of univariate polynomials
type: Item
instance of: scholarly article
title: Toward the best algorithm for approximate GCD of univariate polynomials
zbMATH Open document ID: 1475.13050
author: Kosaku Nagasaka
published in: Journal of Symbolic Computation
publication date: 2021-02-18T00:00:00Z
Mathematics Subject Classification ID: 13P05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 7312662
zbMATH Keywords: symbolic-numeric algorithm for polynomials
zbMATH Keywords: approximate polynomial GCD
zbMATH Keywords: subresultant matrix
zbMATH Keywords: Sylvester matrix
zbMATH Keywords: QR factorization
zbMATH Keywords: rank structured matrix
describes a project that uses: GPGCD
MaRDI profile type: Publication
full work available at URL: j.jsc.2019.08.004
OpenAlex ID: W3036726925
cites work: Q5301644
cites work: Structured Matrix Based Methods for Approximate Polynomial GCD
cites work: A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
cites work: The ERES method for computing the approximate GCD of several polynomials
cites work: &lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
cites work: Q3837876
cites work: Q3162299
cites work: Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
cites work: Q4717942
cites work: Certified approximate univariate GCDs
cites work: An ODE-based method for computing the approximate greatest common divisor of polynomials
cites work: Computing the Nearest Rank-Deficient Matrix Polynomial
cites work: Stable and Efficient Algorithms for Structured Systems of Linear Equations
cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
cites work: Q3447170
cites work: Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
cites work: Approximate polynomial GCD over integers
cites work: Extended QRGCD Algorithm
cites work: Approximate GCD and its application to ill-conditioned algebraic equations
cites work: Q5590398
cites work: New fast Euclidean algorithms
cites work: Q4008406
cites work: Quasi-gcd computations
cites work: GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
cites work: Variable projection methods for approximate (greatest) common divisor computations
cites work: Approximate polynomial GCD: small degree and small height perturbations
cites work: The numerical greatest common divisor of univariate polynomials
DOI: 10.1016/J.JSC.2019.08.004
description: scientific article; zbMATH DE number 7312662