Pages that link to "Item:Q4657342"
From MaRDI portal
The following pages link to The approximate GCD of inexact polynomials (Q4657342):
Displaying 35 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- Approximate GCD of several univariate polynomials with small degree perturbations (Q412204) (← links)
- Twin-float arithmetic (Q412221) (← links)
- Numerical proper reparametrization of parametric plane curves (Q464649) (← 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)
- Numerical computation of the genus of an irreducible curve within an algebraic set (Q534004) (← links)
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (Q540325) (← 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)
- Multivariate subresultants in roots (Q852659) (← links)
- A computational study of ruled surfaces (Q1006652) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control (Q2020558) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- A numerical elimination method for polynomial computations (Q2378510) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← 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)
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm (Q2819632) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- Approximate greatest common divisor of several polynomials from Hankel matrices (Q5101998) (← links)
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD (Q5120202) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)
- Structured low-rank approximation for nonlinear matrices (Q6109889) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)
