Pages that link to "Item:Q1569736"

The following pages link to Design, analysis, and implementation of a multiprecision polynomial rootfinder (Q1569736):

Displaying 50 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)
• Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems (Q521243) (← 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)
• A Bayesian model for root computation (Q626886) (← 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)
• Iteration functions re-visited (Q730575) (← links)
• Cylinder partition function of the 6-vertex model from algebraic geometry (Q783974) (← links)
• Simultaneous determination of polynomial roots and multiplicities: An algorithm and related problems (Q803730) (← 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)
• Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain (Q1033892) (← links)
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
• A constructive algorithm for finding the exact roots of polynomials with computable real coefficients. (Q1603892) (← links)
• A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros (Q1643868) (← links)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• Bounds on polynomial roots using intercyclic companion matrices (Q1688872) (← links)
• A further analysis of backward error in polynomial deflation (Q1731614) (← links)
• The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis (Q1940317) (← links)
• Real root polynomials and real root preserving transformations (Q2038321) (← links)
• Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
• Runge-Kutta-Gegenbauer explicit methods for advection-diffusion problems (Q2220607) (← links)
• Rational Krylov methods for functions of matrices with applications to fractional partial differential equations (Q2222430) (← links)
• A fast algorithm for computing multiplicative relations between the roots of a generic polynomial (Q2229723) (← 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)
• An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
• Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)