Certified approximate univariate GCDs
From MaRDI portal
Publication:1358910
DOI10.1016/S0022-4049(97)00013-3zbMATH Open0891.65015OpenAlexW2061311874MaRDI QIDQ1358910FDOQ1358910
Authors: Ioannis Z. Emiris, Henri Lombardi, André Galligo 
Publication date: 19 July 1998
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-4049(97)00013-3
Recommendations
Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20) Eigenvalues, singular values, and eigenvectors (15A18) Symbolic computation and algebraic computation (68W30) Real polynomials: location of zeros (26C10)
Cites Work
- Title not available (Why is that?)
- On the numerical condition of polynomials in Bernstein form
- Quasi-gcd computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel robots.
- Subresultants and Reduced Polynomial Remainder Sequences
- Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
- Products of polynomials in many variables
- Detection and validation of clusters of polynomial zeros
- Approximate GCD and its application to ill-conditioned algebraic equations
- A matrix pencil based numerical method for the computation of the GCD of polynomials
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Résolution des systèmes d'équations algébriques
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- An Inequality About Factors of Polynomials
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
- Zur inhomogenen Eliminationstheorie
- Best linear common divisors for approximate degree reduction
Cited In (66)
- Approximate parametrization of plane algebraic curves by linear systems of curves
- A structured rank-revealing method for Sylvester matrix
- A subdivision method for computing nearest gcd with certification
- Extended QRGCD algorithm
- Computing approximate GCD of multivariate polynomials
- Relaxed NewtonSLRA for approximate GCD
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- Computing GCRDs of approximate differential polynomials
- The approximate GCD of inexact polynomials
- Approximate GCD of several univariate polynomials with small degree perturbations
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces
- Continuity properties for flat families of polynomials. I: Continuous parametrizations
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- Polynomial computations for blind image deconvolution
- A quadratically convergent algorithm for structured low-rank approximation
- Parametrization of approximate algebraic curves by lines
- Approximate polynomial GCD over integers
- Approximate polynomial GCD: small degree and small height perturbations
- Multivariate subresultants in roots
- Regularization and matrix computation in numerical polynomial algebra
- GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Recursive polynomial remainder sequence and its subresultants
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis
- A computational study of ruled surfaces
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Toward the best algorithm for approximate GCD of univariate polynomials
- Computing multivariate approximate GCD based on Barnett's theorem
- Approximate greatest common divisor of several polynomials from Hankel matrices
- Approximate GCD a la dedieu
- Computation of approximate polynomial GCDs and an extension
- Computing nearest gcd with certification
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- The numerical greatest common divisor of univariate polynomials
- Approximate least common multiple of several polynomials using the ERES division algorithm
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Overdetermined Weierstrass iteration and the nearest consistent system
- Deterministic unimodularity certification
- Method for finding multiple roots of polynomials
- Parametrization of approximate algebraic surfaces by lines
- Approximate factorization of multivariate polynomials using singular value decomposition
- The ERES method for computing the approximate GCD of several polynomials
- Computing approximate greatest common right divisors of differential polynomials
- An iterative method for calculating approximate GCD of univariate polynomials
- Computing multiple roots of inexact polynomials
- Bernstein-Bézoutian matrices
- GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Numerical and symbolical methods for the GCD of several polynomials
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- 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 Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- Minimum converging precision of the QR-factorization algorithm for real polynomial GCD
- Approximate common divisor problem and continued fractions
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Extended companion matrix for approximate GCD
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Approximate polynomial GCD.
This page was built for publication: Certified approximate univariate GCDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1358910)
