Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation

DOI10.1016/S0024-3795(98)10075-7MaRDI QIDQ1124757zbMATH OpenWikidataFDO

Authors L. Gemignani, Dario A. Bini

Publication date 28 November 1999

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

polynomial matricesSchur complementsdivision-free algorithminteger LU factorizationroot localization problemsGaussian elimination for Bézoutians

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of solutions to single equations (65H05)

Recommendations

• Division-free computation of subresultants using Bezout matrices
• Subresultant chains using Bézout matrices
• Computing the polynomial remainder sequence via Bézout matrices
• scientific article; zbMATH DE number 1574467

Cites work

• scientific article; zbMATH DE number 3889718 (Why is no real title available?)
• scientific article; zbMATH DE number 3922806 (Why is no real title available?)
• scientific article; zbMATH DE number 3775748 (Why is no real title available?)
• scientific article; zbMATH DE number 1253994 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 921465 (Why is no real title available?)
• 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
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences
• Algebraic methods for Toeplitz-like matrices and operators
• An extended polynomial GCD algorithm using Hankel matrices
• Bézoutians
• Computational Solutions of Matrix Problems Over an Integral Domain
• Computationally efficient applications of the Euclidean algorithm to zero location
• Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
• Fast computation of GCDs
• Fast inversion of Hankel and Toeplitz matrices
• Fast multiplication of large numbers
• Fast projection methods for minimal design problems in linear system theory
• Generalized Bezoutians and families of efficient zero-location procedures
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On the partial realization problem
• Power series remainder sequences and Padé fractions over an integral domain
• Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
• Solving Hankel systems over the integers
• Some Applications of Matrics in the Theory of Equations
• Subresultants and Reduced Polynomial Remainder Sequences
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

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)