Computing the polynomial remainder sequence via Bézout matrices (Q2448361): Difference between revisions

@@ Property / cites work @@
+Subresultants and Reduced Polynomial Remainder Sequences
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Theory of Subresultants
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate GCD and its application to ill-conditioned algebraic equations
+Normal rank
@@ Property / cites work @@
+Q4314299
@@ Property / cites work: Q4314299 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
+Normal rank
@@ Property / cites work @@
+Q4226974
@@ Property / cites work: Q4226974 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
+Normal rank
@@ Property / cites work @@
+On the partial realization problem
@@ Property / cites work: On the partial realization problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic methods for Toeplitz-like matrices and operators
+Normal rank
@@ Property / cites work @@
+Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
+Normal rank
@@ Property / cites work @@
+Block diagonalization and LU-equivalence of Hankel matrices
+Normal rank
@@ Property / cites work @@
+Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
+Normal rank
@@ Property / cites work @@
+Q4227320
@@ Property / cites work: Q4227320 / 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 @@
+QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
+Normal rank
@@ Property / cites work @@
+Computation of approximate polynomial GCDs and an extension
+Normal rank
@@ Property / cites work @@
+A structured rank-revealing method for Sylvester matrix
+Normal rank
@@ Property / cites work @@
+Structured total least norm and approximate GCDs of inexact polynomials
+Normal rank
@@ Property / cites work @@
+The calculation of the degree of an approximate greatest common divisor of two polynomials
+Normal rank
@@ Property / cites work @@
+A fast method to block-diagonalize a Hankel matrix
+Normal rank
@@ Property / cites work @@
+Computing the block factorization of complex Hankel matrices
+Normal rank
@@ Property / cites work @@
+Inertia characteristics of self-adjoint matrix polynomials
+Normal rank
@@ Property / cites work @@
+Fast inversion of triangular Toeplitz matrices
@@ Property / cites work: Fast inversion of triangular Toeplitz matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Detection and validation of clusters of polynomial zeros
+Normal rank