The following pages link to Quasi-gcd computations (Q1071503):
Displaying 40 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← 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)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Approximate polynomial GCD: small degree and small height perturbations (Q979147) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Feasible real random access machines (Q1279912) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Quantified constraints under perturbation (Q1600045) (← links)
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces (Q1675354) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- A companion matrix resultant for Bernstein polynomials (Q1863577) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← 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)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- (Q5005139) (← links)
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
