Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices

DOI10.1137/S0097539791201903zbMath0818.68092OpenAlexW1970789242MaRDI QIDQ4326853

Luca Gemignani, Dario Andrea Bini

Publication date: 27 March 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539791201903

zbMATH Keywords

fast Fourier transformHankel matricesBezout matrixEuclidean scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05)

Related Items (14)

Computations with infinite Toeplitz matrices and polynomials ⋮ Parallel computation of polynomial GCD and some related parallel computations over abstract fields ⋮ A fast algorithm for generalized Hankel matrices arising in finite-moment problems ⋮ Bernstein-Bézoutian matrices ⋮ A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials ⋮ Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm ⋮ A fast iterative method for determining the stability of a polynomial ⋮ Blind image deconvolution through Bezoutians ⋮ Computationally efficient applications of the Euclidean algorithm to zero location

This page was built for publication: Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices