Computers and the Multiplicity of Polynomial Roots
From MaRDI portal
Recommendations
- The computation of multiple roots of a polynomial
- Computing multiple roots of inexact polynomials
- Computing roots of polynomials on vector processing machines
- Finding the roots of a polynomial on an MIMD multicomputer
- scientific article; zbMATH DE number 579389
- Computing the multiplicity structure in solving polynomial systems
- On the cost of computing roots of polynomials
- Numerical impluimentation of a new algorithm for polynomials with multiple roots
Cited in
(15)- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
- Locating multiple zeros interactively
- Algorithms related to the decomposition of polynomials
- Horner versus Holdred: An episode in the history of root computation
- Computing values of a polynomial with only few multiplications
- scientific article; zbMATH DE number 4132419 (Why is no real title available?)
- scientific article; zbMATH DE number 440795 (Why is no real title available?)
- scientific article; zbMATH DE number 4175092 (Why is no real title available?)
- Computing Rational Zeros of Integral Polynomials by p-Adic Expansion
- scientific article; zbMATH DE number 4111909 (Why is no real title available?)
- scientific article; zbMATH DE number 4128302 (Why is no real title available?)
- The computation of multiple roots of a polynomial
- Testing degenerate polynomials
- Computer Discovery and Analysis of Large Poisson Polynomials
- Computer algebra procedures for separating the roots of algebraic equations
This page was built for publication: Computers and the Multiplicity of Polynomial Roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3327625)
