Pages that link to "Item:Q1854432"

The following pages link to Computation of approximate polynomial GCDs and an extension (Q1854432):

Displaying 50 items.

• A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
• Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL (Q333325) (← 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)
• Bernstein-Bézoutian matrices (Q598205) (← links)
• Numerical factorization of multivariate complex polynomials (Q598228) (← links)
• A subdivision method for computing nearest gcd with certification (Q638509) (← links)
• Approximate polynomial GCD over integers (Q651873) (← links)
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
• Affine equivalences of trigonometric curves (Q829601) (← links)
• Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
• Approximate polynomial GCD: small degree and small height perturbations (Q979147) (← links)
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
• Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
• An extended polynomial GCD algorithm using Hankel matrices (Q1186699) (← links)
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
• Certified approximate univariate GCDs (Q1358910) (← links)
• A subspace method for the computation of the GCD of polynomials (Q1361353) (← links)
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
• Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions (Q1713132) (← links)
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238) (← links)
• Computing GCDs of polynomials over algebraic number fields (Q1914164) (← links)
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
• Approximate polynomial GCD by approximate syzygies (Q2009224) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
• Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
• The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
• An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
• Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
• Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
• Method for finding multiple roots of polynomials (Q2507024) (← 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)
• Approximate GCD of multivariate polynomials (Q2725944) (← 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)
• Computing GCRDs of approximate differential polynomials (Q2819716) (← 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)
• ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION (Q4550791) (← links)
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials (Q4610021) (← links)
• (Q4875226) (← links)
• Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors (Q5002188) (← links)
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
• Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)