Pages that link to "Item:Q1358910"
From MaRDI portal
The following pages link to Certified approximate univariate GCDs (Q1358910):
Displaying 50 items.
- Polynomial computations for blind image deconvolution (Q281962) (← links)
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← links)
- 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)
- 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)
- Parametrization of approximate algebraic curves by lines (Q598227) (← links)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- Approximate parametrization of plane algebraic curves by linear systems of curves (Q631016) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Multivariate subresultants in roots (Q852659) (← 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)
- On approximate GCDs of univariate polynomials (Q1281842) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Continuity properties for flat families of polynomials. I: Continuous parametrizations (Q1408354) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← 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 geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis (Q2020372) (← links)
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves (Q2252430) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- A structured rank-revealing method for Sylvester matrix (Q2469622) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- Distance bounds of \(\varepsilon\)-points on hypersurfaces (Q2503306) (← 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)
- Parametrization of approximate algebraic surfaces by lines (Q2573848) (← links)
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
- Extended companion matrix for approximate GCD (Q2819619) (← 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)
- Задача о приближенном общем делителе и цепные дроби (Q3381824) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
