Relaxed NewtonSLRA for approximate GCD (Q831989): Difference between revisions

@@ Property / describes a project that uses @@
+GPGCD
@@ Property / describes a project that uses: GPGCD / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-85165-1_16
+Normal rank
@@ Property / OpenAlex ID @@
+W3193369282
@@ Property / OpenAlex ID: W3193369282 / rank @@
+Normal rank
@@ Property / cites work @@
+Affine equivalences of trigonometric curves
@@ Property / cites work: Affine equivalences of trigonometric curves / rank @@
+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 @@
+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 @@
+&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 @@
+Best approximation in inner product spaces
@@ Property / cites work: Best approximation in inner product spaces / rank @@
+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 @@
+Computing nearby non-trivial Smith forms
@@ Property / cites work: Computing nearby non-trivial Smith forms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4917542
@@ Property / cites work: Q4917542 / rank @@
+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 @@
+Low-rank approximation. Algorithms, implementation, applications
+Normal rank
@@ Property / cites work @@
+Approximate GCD by bernstein basis, and its applications
+Normal rank
@@ Property / cites work @@
+Toward the best algorithm for approximate GCD of univariate polynomials
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+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
+Normal rank
@@ Property / cites work @@
+Variable projection methods for approximate (greatest) common divisor computations
+Normal rank
@@ Property / cites work @@
+Q4462008
@@ Property / cites work: Q4462008 / rank @@
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:831989