Cited in
(33)- Root-finding by expansion with independent constraints
- Computing real roots of real polynomials
- A note on generalized companion pencils in the monomial basis
- Computing multiple roots of inexact polynomials
- Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Additive preconditioning, eigenspaces, and the inverse iteration
- Analyticity of the Ising susceptibility: an interpretation
- New progress in real and complex polynomial root-finding
- Global optimality conditions and optimization methods for polynomial programming problems
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- MultRoot
- MPSolve
- logcf
- SqFreeEVAL
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- na20
- na10
- A bound on the spectral radius of graphs in terms of their Zagreb indices
- ANewDsc
- SLV
- Ccluster
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- An adaptive subdivision method for root finding of univariate polynomials
- Additive preconditioning and aggregation in matrix computations
- Efficient isolation of polynomial's real roots.
- Root-squaring with DPR1 matrices
- Real polynomial root-finding by means of matrix and polynomial iterations
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- An experimental investigation of the normality of irrational algebraic numbers
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- Solving secular and polynomial equations: a multiprecision algorithm
This page was built for software: Eigensolve
