On the complexity of the Lickteig-Roy subresultant algorithm
From MaRDI portal
Publication:1757020
DOI10.1016/j.jsc.2018.04.017zbMath1409.13051OpenAlexW2625628003WikidataQ130002428 ScholiaQ130002428MaRDI QIDQ1757020
Publication date: 28 December 2018
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2018.04.017
Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Solving polynomial systems; resultants (13P15)
Related Items
Computational schemes for subresultant chains, Efficient sampling in spectrahedra and volume approximation, On the complexity exponent of polynomial system solving, Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity, Elimination ideal and bivariate resultant over finite fields, Directed evaluation, High-order lifting for polynomial Sylvester matrices, Fast computation of generic bivariate resultants, Fast multivariate multi-point evaluation revisited, Accelerated tower arithmetic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic root finding over finite fields using Graeffe transforms
- On computing the determinant in small parallel time using a small number of processors
- Bezout matrices, subresultant polynomials and parameters
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- Cauchy index computation
- On fast multiplication of polynomials over arbitrary algebras
- An elementary approach to subresultants theory.
- Subresultants revisited.
- New structure theorem for subresultants
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
- Matrix computation of subresultant polynomial remainder sequences in integral domains
- Optimizations of the subresultant algorithm
- Fast separable factorization and applications
- Fast computation of continued fraction expansions.
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
- On the factorization of polynomials in a finite number of steps
- Modern Computer Algebra
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Algorithme de Bareiss, algorithme des sous-résultants
- Modular SIMD arithmetic in M <scp>athemagix</scp>
- Effective procedures in field theory
- The Computational Complexity of Continued Fractions
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Fast computation of GCDs
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Euclid's Algorithm for Large Numbers
- Division-free computation of subresultants using Bezout matrices
- Sylvester-Habicht sequences and fast Cauchy index computation
