Pages that link to "Item:Q1382032"
From MaRDI portal
The following pages link to Detection and validation of clusters of polynomial zeros (Q1382032):
Displaying 25 items.
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Hybrid method for computing the nearest singular polynomials (Q701907) (← links)
- Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
- A verified method for bounding clusters of zeros of analytic functions (Q861883) (← links)
- On location and approximation of clusters of zeros: Case of embedding dimension one (Q870481) (← links)
- Zero-clusters of polynomials: best approach in supercomputing era (Q961599) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- Enclosing clusters of zeros of polynomials (Q1398713) (← links)
- Finding a cluster of zeros of univariate polynomials (Q1594831) (← links)
- Improvement of convergence of an iterative method for finding polynomial factors of analytic functions (Q1602809) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- An algorithm for locating all zeros of a real polynomial (Q1893153) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials (Q2501236) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- An Existence Test for Root Clusters and Multiple Roots (Q3809133) (← links)
- (Q4227333) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
