Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
DOI10.1016/S0024-3795(98)10075-7zbMATH Open0937.65031WikidataQ127740442 ScholiaQ127740442MaRDI QIDQ1124757FDOQ1124757
Authors: L. Gemignani, Dario A. Bini 
Publication date: 28 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
polynomial matricesSchur complementsdivision-free algorithminteger LU factorizationroot localization problemsGaussian elimination for Bézoutians
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of solutions to single equations (65H05)
Cites Work
- Fast projection methods for minimal design problems in linear system theory
- Title not available (Why is that?)
- Fast multiplication of large numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic methods for Toeplitz-like matrices and operators
- Title not available (Why is that?)
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- On the partial realization problem
- Subresultants and Reduced Polynomial Remainder Sequences
- Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
- Fast computation of GCDs
- Title not available (Why is that?)
- Generalized Bezoutians and families of efficient zero-location procedures
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- Computational Solutions of Matrix Problems Over an Integral Domain
- Fast inversion of Hankel and Toeplitz matrices
- Power series remainder sequences and Padé fractions over an integral domain
- Bézoutians
- Some Applications of Matrics in the Theory of Equations
- 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
- An extended polynomial GCD algorithm using Hankel matrices
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
- Solving Hankel systems over the integers
- Computationally efficient applications of the Euclidean algorithm to zero location
- Title not available (Why is that?)
- Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices
Cited In (10)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Division-free computation of subresultants using Bezout matrices
- Algorithms for finding the minimal polynomials and inverses of resultant matrices
- On the complexity of the Lickteig-Roy subresultant algorithm
- A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial
- 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
- Computing the polynomial remainder sequence via Bézout matrices
- An application of fast factorization algorithms in computer aided geometric design
- Bernstein-Bézoutian matrices
- Behavioral realizations using companion matrices and the Smith form
This page was built for publication: Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124757)
