Pages that link to "Item:Q1281842"
From MaRDI portal
The following pages link to On approximate GCDs of univariate polynomials (Q1281842):
Displaying 46 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)
- Approximate GCD of several univariate polynomials with small degree perturbations (Q412204) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- The nearest complex polynomial with a zero in a given complex domain (Q650944) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Hybrid method for computing the nearest singular polynomials (Q701907) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Affine equivalences of trigonometric curves (Q829601) (← 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)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- On real factors of real interval polynomials (Q1025398) (← 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)
- Certified approximate univariate GCDs (Q1358910) (← links)
- On a problem of Berzsenyi regarding the \(\gcd\) of polynomial expressions (Q1773049) (← links)
- Structured low rank approximation (Q1874666) (← links)
- A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm (Q1979358) (← links)
- Structured low-rank approximation: optimization on matrix manifold approach (Q2114475) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- A unified approach to computing the nearest complex polynomial with a given zero (Q2354766) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← 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)
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953) (← links)
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
- Approximate GCD of multivariate polynomials (Q2725944) (← links)
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm (Q2819632) (← links)
- The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
- Realization and GCD-existence theorem for generalized polynomials (Q3083176) (← links)
- Задача о приближенном общем делителе и цепные дроби (Q3381824) (← 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)
- (Q4250163) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors (Q5002188) (← links)
- On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
- A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints (Q5146698) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
