Publication:1281842

DOI10.1006/JSCO.1998.0232zbMATH Open0967.12007OpenAlexW2011703168MaRDI QIDQ1281842FDOQ1281842

Y. N. Lakshman, Narendra K. Karmarkar

Publication date: 5 September 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ba052bccf563df4446fb9072b7c094608e9cf196

zbMATH Keywords

computer algebrainexactly specified polynomialsnearest common divisor problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05)

Cited In (43)

• A subdivision method for computing nearest gcd with certification
• Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors
• Hybrid method for computing the nearest singular polynomials
• Title not available (Why is that?)
• Affine equivalences of trigonometric curves
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Realization and GCD-existence theorem for generalized polynomials
• Approximate GCD of several univariate polynomials with small degree perturbations
• A unified approach to computing the nearest complex polynomial with a given zero
• Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm
• Approximate GCD and its application to ill-conditioned algebraic equations
• Structured low-rank approximation: optimization on matrix manifold approach
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
• A quadratically convergent algorithm for structured low-rank approximation
• Approximate polynomial GCD over integers
• Approximate polynomial GCD: small degree and small height perturbations
• GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
• Nearest multivariate system with given root multiplicities
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Variable projection methods for approximate (greatest) common divisor computations
• An ODE-based method for computing the approximate greatest common divisor of polynomials
• On a problem of Berzsenyi regarding the \(\gcd\) of polynomial expressions
• A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints
• Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
• Structured low rank approximation
• On real factors of real interval polynomials
• Global minimization of rational functions and the nearest GCDs
• Overdetermined Weierstrass iteration and the nearest consistent system
• Approximate GCD of multivariate polynomials
• Regularization and Matrix Computation in Numerical Polynomial Algebra
• GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
• Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
• The ERES method for computing the approximate GCD of several polynomials
• Computing approximate greatest common right divisors of differential polynomials
• The nearest complex polynomial with a zero in a given complex domain
• The Sylvester Resultant Matrix and Image Deblurring
• Computing multiple roots of inexact polynomials
• A geometrical approach to finding multivariate approximate LCMs and GCDs
• On the complexity of computing the greatest common divisor of several univariate polynomials
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
• Approximate gcds of polynomials and sparse SOS relaxations

This page was built for publication: On approximate GCDs of univariate polynomials

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