SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1145/3597066.3597116
+Normal rank
@@ Property / OpenAlex ID @@
+W4383213615
@@ Property / OpenAlex ID: W4383213615 / rank @@
+Normal rank
@@ Property / cites work @@
+A geometrical approach to finding multivariate approximate LCMs and GCDs
+Normal rank
@@ Property / cites work @@
+Blind image deconvolution via Hankel based method for computing the GCD of polynomials
+Normal rank
@@ Property / cites work @@
+Q5301644
@@ Property / cites work: Q5301644 / rank @@
+Normal rank
@@ Property / cites work @@
+Structured Matrix Based Methods for Approximate Polynomial GCD
+Normal rank
@@ Property / cites work @@
+A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+Signal enhancement-a composite property mapping algorithm
+Normal rank
@@ Property / cites work @@
+The GPGCD algorithm with the Bézout matrix
@@ Property / cites work: The GPGCD algorithm with the Bézout matrix / rank @@
+Normal rank
@@ Property / cites work @@
+Q4232503
@@ Property / cites work: Q4232503 / rank @@
+Normal rank
@@ Property / cites work @@
+The ERES method for computing the approximate GCD of several polynomials
+Normal rank
@@ Property / cites work @@
+Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
+Normal rank
@@ Property / cites work @@
+Q4227296
@@ Property / cites work: Q4227296 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate GCD in Bernstein basis
@@ Property / cites work: Approximate GCD in Bernstein basis / rank @@
+Normal rank
@@ Property / cites work @@
+&amp;lt;tex&amp;gt;$QR$&amp;lt;/tex&amp;gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
+Normal rank
@@ Property / cites work @@
+Fast Fourier transforms: A tutorial review and a state of the art
+Normal rank
@@ Property / cites work @@
+Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
+Normal rank
@@ Property / cites work @@
+Q4717942
@@ Property / cites work: Q4717942 / rank @@
+Normal rank
@@ Property / cites work @@
+Certified approximate univariate GCDs
@@ Property / cites work: Certified approximate univariate GCDs / rank @@
+Normal rank
@@ Property / cites work @@
+An ODE-based method for computing the approximate greatest common divisor of polynomials
+Normal rank
@@ Property / cites work @@
+Approximate factorization of multivariate polynomials via differential equations
+Normal rank
@@ Property / cites work @@
+Symbolic-numeric sparse interpolation of multivariate polynomials
+Normal rank
@@ Property / cites work @@
+Symbolic-numeric sparse interpolation of multivariate polynomials
+Normal rank
@@ Property / cites work @@
+Q4917542
@@ Property / cites work: Q4917542 / rank @@
+Normal rank
@@ Property / cites work @@
+An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
+Normal rank
@@ Property / cites work @@
+Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
+Normal rank
@@ Property / cites work @@
+Q3447170
@@ Property / cites work: Q3447170 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227320
@@ Property / cites work: Q4227320 / rank @@
+Normal rank
@@ Property / cites work @@
+Blind image deconvolution via fast approximate GCD
+Normal rank
@@ Property / cites work @@
+Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
+Normal rank
@@ Property / cites work @@
+Approximate polynomial GCD by approximate syzygies
+Normal rank
@@ Property / cites work @@
+Low-rank approximation. Algorithms, implementation, applications
+Normal rank
@@ Property / cites work @@
+Approximate GCD by bernstein basis, and its applications
+Normal rank
@@ Property / cites work @@
+Relaxed NewtonSLRA for approximate GCD
@@ Property / cites work: Relaxed NewtonSLRA for approximate GCD / rank @@
+Normal rank
@@ Property / cites work @@
+Toward the best algorithm for approximate GCD of univariate polynomials
+Normal rank
@@ Property / cites work @@
+Extended QRGCD Algorithm
@@ Property / cites work: Extended QRGCD Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+Q3994198
@@ Property / cites work: Q3994198 / rank @@
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+Q3447169
@@ Property / cites work: Q3447169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4008406
@@ Property / cites work: Q4008406 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+A quadratically convergent algorithm for structured low-rank approximation
+Normal rank
@@ Property / cites work @@
+GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients
+Normal rank
@@ Property / cites work @@
+GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
+Normal rank
@@ Property / cites work @@
+GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
+Normal rank
@@ Property / cites work @@
+On the Computation of the GCD of 2-D Polynomials
@@ Property / cites work: On the Computation of the GCD of 2-D Polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Variable projection methods for approximate (greatest) common divisor computations
+Normal rank
@@ Property / cites work @@
+Modern Computer Algebra
@@ Property / cites work: Modern Computer Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Structured total least norm and approximate GCDs of inexact polynomials
+Normal rank
@@ Property / cites work @@
+Q4462008
@@ Property / cites work: Q4462008 / rank @@
+Normal rank
@@ Property / cites work @@
+A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
+Normal rank
@@ Property / cites work @@
+An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
+Normal rank
@@ Property / cites work @@
+Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
+Normal rank
@@ Property / cites work @@
+The numerical greatest common divisor of univariate polynomials
+Normal rank
@@ Property / cites work @@
+The approximate GCD of inexact polynomials
@@ Property / cites work: The approximate GCD of inexact polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q2725944
@@ Property / cites work: Q2725944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851616
@@ Property / cites work: Q3851616 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q131123868
@@ Property / Wikidata QID: Q131123868 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6081970