Pages that link to "Item:Q4326853"
From MaRDI portal
The following pages link to Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices (Q4326853):
Displaying 14 items.
- Bernstein-Bézoutian matrices (Q598205) (← links)
- Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices (Q677121) (← links)
- Blind image deconvolution through Bezoutians (Q729853) (← links)
- 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 (Q1124738) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- Computations with infinite Toeplitz matrices and polynomials (Q1348083) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- A fast algorithm for generalized Hankel matrices arising in finite-moment problems (Q1373307) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- Computationally efficient applications of the Euclidean algorithm to zero location (Q2564899) (← links)
- Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm (Q3603591) (← links)
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials (Q4610021) (← links)
- A fast iterative method for determining the stability of a polynomial (Q5961644) (← links)
