The following pages link to na20 (Q23446):
Displaying 50 items.
- 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)
- Computing curve intersection by homotopy methods (Q651931) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- On the zeros of plane partition polynomials (Q665765) (← 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)
- Cylinder partition function of the 6-vertex model from algebraic geometry (Q783974) (← 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)
- Point estimation of root finding methods (Q930436) (← links)
- Planar triangulations with real chromatic roots arbitrarily close to 4 (Q941623) (← 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)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial (Q1405573) (← links)
- On the evaluation of polynomial coefficients (Q1410460) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← 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)
- 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)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← 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)
- Complexity of real root isolation using continued fractions (Q2378508) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials (Q2402410) (← links)
- Efficient Halley-like methods for the inclusion of multiple zeros of polynomials (Q2442047) (← 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)
