Pages that link to "Item:Q1398713"
From MaRDI portal
The following pages link to Enclosing clusters of zeros of polynomials (Q1398713):
Displaying 21 items.
- Constraint propagation on quadratic constraints (Q606897) (← links)
- A verified method for bounding clusters of zeros of analytic functions (Q861883) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- Error-bounds for zeroes of polynomials using complex circular arithmetic (Q1094096) (← links)
- Detection and validation of clusters of polynomial zeros (Q1382032) (← links)
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- Some coefficient sequences related to the descent polynomial (Q1979432) (← links)
- Descent polynomials (Q1999732) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- Enclosure of the zero set of multivariate exponential interval polynomials (Q2387740) (← links)
- A family of root-finding methods with accelerated convergence (Q2475888) (← links)
- An efficient higher order family of root finders (Q2483336) (← links)
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials (Q2501236) (← links)
- Sigmoid-like functions and root finding methods (Q2518658) (← links)
- Generalizations of Gershgorin disks and polynomial zeros (Q3574809) (← links)
- An Existence Test for Root Clusters and Multiple Roots (Q3809133) (← links)
- (Q4227333) (← links)
- (Q4648391) (← links)
- A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial (Q4652860) (← links)
- Computing Enclosures for the Matrix Exponential (Q5146627) (← links)
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
