Pages that link to "Item:Q1295792"
From MaRDI portal
The following pages link to An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792):
Displaying 43 items.
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Approximate GCD of several univariate polynomials with small degree perturbations (Q412204) (← links)
- The computation of multiple roots of a polynomial (Q425345) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Blind image deconvolution through Bezoutians (Q729853) (← links)
- Recursive polynomial remainder sequence and its subresultants (Q947487) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- Approximate polynomial GCD: small degree and small height perturbations (Q979147) (← links)
- A computational study of ruled surfaces (Q1006652) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- On approximate GCDs of univariate polynomials (Q1281842) (← links)
- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (Q1281845) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- A subspace method for the computation of the GCD of polynomials (Q1361353) (← links)
- Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Approximate polynomial GCD by approximate syzygies (Q2009224) (← links)
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control (Q2020558) (← links)
- Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Computation of the topology of real algebraic space curves (Q2456569) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
- A subresultant based subspace method for the computation of polynomial GCDs (Q2819622) (← links)
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm (Q2819632) (← links)
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures (Q2819639) (← links)
- Computing GCRDs of approximate differential polynomials (Q2819716) (← links)
- An iterative method for calculating approximate GCD of univariate polynomials (Q2883839) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- Approximate GCD a la dedieu (Q3164992) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- Approximate greatest common divisor of several polynomials from Hankel matrices (Q5101998) (← links)
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD (Q5120202) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
