Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
From MaRDI portal
Publication:1124757
DOI10.1016/S0024-3795(98)10075-7zbMath0937.65031WikidataQ127740442 ScholiaQ127740442MaRDI QIDQ1124757
Luca Gemignani, Dario Andrea Bini
Publication date: 28 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
polynomial matricesSchur complementsdivision-free algorithmGaussian elimination for Bézoutiansinteger LU factorizationroot localization problems
Numerical computation of solutions to single equations (65H05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
An application of fast factorization algorithms in computer aided geometric design, A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial, Algorithms for finding the minimal polynomials and inverses of resultant matrices, 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, Computing the polynomial remainder sequence via Bézout matrices, Blind image deconvolution via Hankel based method for computing the GCD of polynomials, On the complexity of the Lickteig-Roy subresultant algorithm, Behavioral Realizations using Companion Matrices and the Smith Form
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
- Power series remainder sequences and Padé fractions over an integral domain
- Algebraic methods for Toeplitz-like matrices and operators
- On the partial realization problem
- 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 projection methods for minimal design problems in linear system theory
- Fast inversion of Hankel and Toeplitz matrices
- An extended polynomial GCD algorithm using Hankel matrices
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
- Bézoutians
- Solving Hankel systems over the integers
- Fast multiplication of large numbers
- Computationally efficient applications of the Euclidean algorithm to zero location
- Generalized Bezoutians and families of efficient zero-location procedures
- Fast computation of GCDs
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- Subresultants and Reduced Polynomial Remainder Sequences
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Computational Solutions of Matrix Problems Over an Integral Domain
- Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices
- Some Applications of Matrics in the Theory of Equations
