na20

swMATH11505MaRDI QIDQ23446

No author found.

Described by source

• Design, analysis, and implementation of a multiprecision polynomial rootfinder

Related Items (78)

Isolating real roots of real polynomials ⋮ Eigenvalue condition numbers and pseudospectra of Fiedler matrices ⋮ Complexity of real root isolation using continued fractions ⋮ The Geometry of Multivariate Polynomial Division and Elimination ⋮ A posteriori error bound methods for the inclusion of polynomial zeros ⋮ Spectral Analysis of Nonsymmetric Quasi-Toeplitz matrices with Applications to Preconditioned Multistep Formulas ⋮ Real Algebraic Numbers: Complexity Analysis and Experimentation ⋮ Computing curve intersection by means of simultaneous iterations ⋮ Unnamed Item ⋮ SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ A Fractal Eigenvector ⋮ The Brown-Colbourn conjecture on zeros of reliability polynomials is false ⋮ A deterministic algorithm for isolating real roots of a real polynomial ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ On properties of the Ising model for complex energy/temperature and magnetic field ⋮ Bounds on polynomial roots using intercyclic companion matrices ⋮ Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods ⋮ Matrix computations and polynomial root-finding with preprocessing ⋮ Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial ⋮ The computation of multiple roots of a polynomial ⋮ On the evaluation of polynomial coefficients ⋮ Geometry of polynomials and root-finding via path-lifting ⋮ Analyticity of the Ising susceptibility: an interpretation ⋮ Efficient Halley-like methods for the inclusion of multiple zeros of polynomials ⋮ Computing curve intersection by homotopy methods ⋮ Is the five-flow conjecture almost false? ⋮ On the complexity of the Descartes method when using approximate arithmetic ⋮ Runge-Kutta-Gegenbauer explicit methods for advection-diffusion problems ⋮ Rational Krylov methods for functions of matrices with applications to fractional partial differential equations ⋮ New bounds for roots of polynomials based on Fiedler companion matrices ⋮ Transformations of matrix structures work again ⋮ On the convergence condition of generalized root iterations for the inclusion of polynomial zeros ⋮ Point estimation of root finding methods ⋮ Inverse power and Durand-Kerner iterations for univariate polynomial root-finding ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Root-finding by expansion with independent constraints ⋮ A further analysis of backward error in polynomial deflation ⋮ Root refinement for real polynomials using quadratic interval refinement ⋮ On the zeros of plane partition polynomials ⋮ Computing real roots of real polynomials ⋮ Planar triangulations with real chromatic roots arbitrarily close to 4 ⋮ Computer Algebra in Scientific Computing ⋮ Unnamed Item ⋮ On new higher order families of simultaneous methods for finding polynomial zeros ⋮ Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems ⋮ On the complexity of real root isolation using continued fractions ⋮ Locating the Eigenvalues of Matrix Polynomials ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ Solving secular and polynomial equations: a multiprecision algorithm ⋮ Polynomial Evaluation and Interpolation and Transformations of Matrix Structures ⋮ On the complexity of computing with planar algebraic curves ⋮ Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials ⋮ An iterated eigenvalue algorithm for approximating roots of univariate polynomials ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ New progress in real and complex polynomial root-finding ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial. ⋮ A higher order family for the simultaneous inclusion of multiple zeros of polynomials ⋮ On location and approximation of clusters of zeros of analytic functions ⋮ Effective bounds for P-recursive sequences ⋮ Tracing index of rational curve parametrizations ⋮ Univariate Polynomial Real Root Isolation: Continued Fractions Revisited ⋮ Real root polynomials and real root preserving transformations ⋮ Sigmoid-like functions and root finding methods ⋮ On the stability of computing polynomial roots via confederate linearizations ⋮ Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions ⋮ An experimental investigation of the normality of irrational algebraic numbers ⋮ Cylinder partition function of the 6-vertex model from algebraic geometry ⋮ New Practical Advances in Polynomial Root Clustering ⋮ Fast and Backward Stable Computation of Roots of Polynomials ⋮ Unnamed Item ⋮ Fast approximate computations with Cauchy matrices and polynomials ⋮ Real polynomial root-finding by means of matrix and polynomial iterations ⋮ Accelerated approximation of the complex roots and factors of a univariate polynomial

This page was built for software: na20