Pages that link to "Item:Q1569736"
From MaRDI portal
The following pages link to Design, analysis, and implementation of a multiprecision polynomial rootfinder (Q1569736):
Displayed 42 items.
- na20 (Q23446) (← links)
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method (Q389577) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- The computation of multiple roots of a polynomial (Q425345) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- Transformations of matrix structures work again (Q471925) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false (Q598476) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Computing curve intersection by homotopy methods (Q651931) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials (Q695611) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Computing curve intersection by means of simultaneous iterations (Q861738) (← links)
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros (Q929751) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- Effective bounds for P-recursive sequences (Q992808) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis (Q1940317) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
- Structured matrix methods for the computation of multiple roots of a polynomial (Q2253088) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← links)
- Complexity of real root isolation using continued fractions (Q2378508) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial (Q2391044) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- New bounds for roots of polynomials based on Fiedler companion matrices (Q2451209) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← 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)
- Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\) (Q2574168) (← links)
- An experimental investigation of the normality of irrational algebraic numbers (Q2840634) (← links)
- Fast and Backward Stable Computation of Roots of Polynomials (Q5265003) (← links)
- Tracing index of rational curve parametrizations (Q5958642) (← links)