Computing the polynomial remainder sequence via Bézout matrices

DOI10.1016/j.cam.2013.02.029zbMath1285.65022OpenAlexW2064113086MaRDI QIDQ2448361

Skander Belhaj

Publication date: 30 April 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.02.029

zbMATH Keywords

Hankel matrixblock diagonalizationEuclidean algorithmBézout matrixpolynomial remainder sequenceSchur complementation

Mathematics Subject Classification ID

Related Items

A note on computing the inverse of a triangular Toeplitz matrix ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials

Uses Software

• Matlab
• MultRoot

Cites Work

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

This page was built for publication: Computing the polynomial remainder sequence via Bézout matrices