Pages that link to "Item:Q2958983"
From MaRDI portal
The following pages link to Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials (Q2958983):
Displayed 34 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← 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)
- Twin-float arithmetic (Q412221) (← 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)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Blind image deconvolution through Bezoutians (Q729853) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- On real factors of real interval polynomials (Q1025398) (← links)
- Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions (Q1713132) (← links)
- Kempe's universality theorem for rational space curves (Q1750390) (← 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)
- Approximate polynomial GCD by approximate syzygies (Q2009224) (← links)
- Structured low-rank approximation: optimization on matrix manifold approach (Q2114475) (← links)
- On the local stability of semidefinite relaxations (Q2144546) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← 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)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix (Q4994436) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)