Polynomial Scaling
From MaRDI portal
Recommendations
Cited in
(13)- The computation of multiple roots of a polynomial
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Solving cubics by polynomial fitting
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Calculation of zeros of a real polynomial using scaling of its coefficients
- An implementation detail about the scaling of monomial bases in polytopal finite element methods
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- Scaling by binormalization
- Structured matrix methods for the computation of multiple roots of a polynomial
- Max-plus singular values
- Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
- A scaling algorithm for polynomial constraint satisfaction problems
This page was built for publication: Polynomial Scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034740)