scientific article; zbMATH DE number 1254271
From MaRDI portal
Publication:4227320
Recommendations
- On approximate GCDs of univariate polynomials
- Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- An algorithm for computing certified approximate GCD of n univariate polynomials
Cited in
(50)- Nearest multivariate system with given root multiplicities
- Quasi-gcd computations
- On approximate GCDs of univariate polynomials
- Nearest singular polynomials
- Approximate common divisors of polynomials and degree reduction for rational curves
- An algorithm for computing certified approximate GCD of n univariate polynomials
- Certified approximate univariate GCDs
- Approximate solutions of polynomial equations.
- Structured matrix methods computing the greatest common divisor of polynomials
- Computation of approximate polynomial GCDs and an extension
- Obtaining exact interpolation multivariate polynomial by approximation
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- A symbolic-numeric approach for parametrizing ruled surfaces
- Approximate square-free part and decomposition
- Computing approximate greatest common right divisors of differential polynomials
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- Nearest common root of a set of polynomials: a structured singular value approach
- A unified approach to computing the nearest complex polynomial with a given zero
- Approximate gcds of polynomials and sparse SOS relaxations
- Guessing singular dependencies
- Computing the polynomial remainder sequence via Bézout matrices
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Structured total least norm and approximate GCDs of inexact polynomials
- Global minimization of rational functions and the nearest GCDs
- A sequence of nearest polynomials with given factors
- A quadratically convergent algorithm for structured low-rank approximation
- Numerical and symbolical methods for the GCD of several polynomials
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Computing nearest gcd with certification
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- Regularization and matrix computation in numerical polynomial algebra
- Computing the nearest singular univariate polynomials with given root multiplicities
- scientific article; zbMATH DE number 1979260 (Why is no real title available?)
- Numerical proper reparametrization of parametric plane curves
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Overdetermined Weierstrass iteration and the nearest consistent system
- A sequence of nearest polynomials with given factors
- The computation of multiple roots of a Bernstein basis polynomial
- Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- A subdivision method for computing nearest gcd with certification
- The nearest complex polynomial with a zero in a given complex domain
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- A hybrid symbolic-numerical approach for ruled surface detection and parameterization
- Hybrid method for computing the nearest singular polynomials
- Relaxed NewtonSLRA for approximate GCD
- Algorithms for near solutions to polynomial equations
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227320)
