na20

swMATH11505MaRDI QIDQ23446FDOQ23446

Author name not available (Why is that?)

Described by source

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

Cited In (78)

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

This page was built for software: na20