Pages that link to "Item:Q5532045"
From MaRDI portal
The following pages link to Subresultants and Reduced Polynomial Remainder Sequences (Q5532045):
Displaying 50 items.
- Algebraic phase unwrapping along the real axis: extensions and stabilizations (Q336021) (← links)
- Sylvester's double sums: an inductive proof of the general case (Q414627) (← links)
- Subresultants, Sylvester sums and the rational interpolation problem (Q480645) (← links)
- Bernstein-Bézoutian matrices (Q598205) (← links)
- Computing high precision matrix Padé approximants (Q695617) (← links)
- Power series remainder sequences and Padé fractions over an integral domain (Q749215) (← links)
- Simple algorithms for approximating all roots of a polynomial with real roots (Q757494) (← links)
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- Decomposition of algebraic sets and applications to weak centers of cubic systems (Q843164) (← links)
- Bounds for resultants of univariate and bivariate polynomials (Q848582) (← links)
- Multivariate subresultants in roots (Q852659) (← links)
- A new approach for constructing subresultants (Q864796) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Recursive polynomial remainder sequence and its subresultants (Q947487) (← links)
- An algorithm for the complete symmetry classification of differential equations based on Wu's method (Q976807) (← links)
- Theory of multiple polynomial remainder sequence (Q1076728) (← links)
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time (Q1078247) (← links)
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations (Q1078248) (← links)
- Solving systems of linear equations over polynomials (Q1082773) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- A simple proof of the validity of the reduced prs algorithm (Q1099223) (← links)
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (Q1185458) (← links)
- Three new algorithms for multivariate polynomial GCD (Q1194336) (← links)
- Solving a congruence on a graded algebra by a subresultant sequence and its application (Q1209629) (← links)
- Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130) (← links)
- On the location of the zeros of a generalized polynomial (Q1260484) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- Primitive polynomial remainder sequences in elimination theory (Q1343108) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Double Sylvester sums for subresultants and multi-Schur functions. (Q1394943) (← links)
- An elementary approach to subresultants theory. (Q1401153) (← links)
- Subresultants revisited. (Q1401299) (← links)
- Subresultants and locally nilpotent derivations. (Q1428626) (← links)
- An efficient method for analyzing the topology of plane real algebraic curves. (Q1565839) (← links)
- New structure theorem for subresultants (Q1569836) (← links)
- Fast computation of the Bézout and Dixon resultant matrices (Q1599530) (← links)
- Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Various new expressions for subresultants and their applications (Q1762553) (← links)
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238) (← links)
- Computation of the dual of a plane projective curve (Q1864879) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial (Q1874670) (← links)
- A cubic Kolmogorov system with six limit cycles (Q1886481) (← links)
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (Q1894579) (← links)
