An ODE-based method for computing the approximate greatest common divisor of polynomials
From MaRDI portal
Publication:2420166
DOI10.1007/s11075-018-0569-0zbMath1433.65076OpenAlexW2810837819MaRDI QIDQ2420166
Antonio Fazzi, Nicola Guglielmi, Ivan Markovsky
Publication date: 5 June 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://biblio.vub.ac.be/vubirfiles/65702658/agcd_ode.pdf
Numerical optimization and variational techniques (65K10) Matrix equations and identities (15A24) Polynomials (irreducibility, etc.) (11R09) Numerical methods for matrix equations (65F45)
Related Items (8)
Relaxed NewtonSLRA for approximate GCD ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Distance problems in the behavioral setting ⋮ Structured low-rank approximation for nonlinear matrices ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control ⋮ A gradient system approach for Hankel structured low-rank approximation ⋮ Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quadratically convergent algorithm for structured low-rank approximation
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- A subdivision method for computing nearest gcd with certification
- A fast algorithm for solving the Sylvester structured total least squares problem
- Applications of the generalized Sylvester matrix
- On approximate GCDs of univariate polynomials
- When are two numerical polynomials relatively prime?
- A subspace method for the computation of the GCD of polynomials
- Computation of approximate polynomial GCDs and an extension
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- Software for weighted structured low-rank approximation
- Variable projection methods for approximate (greatest) common divisor computations
- Approximate gcds of polynomials and sparse SOS relaxations
- Structured low-rank approximation and its applications
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Structured Matrix Based Methods for Approximate Polynomial GCD
- The numerical greatest common divisor of univariate polynomials
- Generalized Resultant Theorem
- On Smooth Decompositions of Matrices
- Separable nonlinear least squares: the variable projection method and its applications
- The approximate GCD of inexact polynomials
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
This page was built for publication: An ODE-based method for computing the approximate greatest common divisor of polynomials
