Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- The self-validated method for polynomial zeros of high efficiency
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- A note on some improvements of the simultaneous methods for determination of polynomial zeros
- Computing roots of polynomials on vector processing machines
- Practical problems arising for finding roots of nonlinear equations
- Some parallel methods for polynomial root-finding
- The Durand-Kerner method for trigonometric and exponential polynomials
- Solving systems of algebraic equations by a general elimination method
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- A family of simultaneous zero-finding methods
- On an iterative method for simultaneous inclusion of polynomial complex zeros
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- Balanced convergence of iterative methods to a multiple zero of a complex polynomial
- A hybrid approach for the integration of a rational function
- On the R-order of some accelerated methods for the simultaneous finding of polynomial zeros
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Solving multivariate algebraic equation by Hensel construction
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
- Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
- Solving certain queueing problems modelled by Toeplitz matrices
- A note on the convergence of the Weierstrass SOR method for polynomial roots
- Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation
- Polynomial root finding by means of continuation
- Point estimation and some applications to iterative methods
- A method for finding the zeros of polynomials using a companion matrix.
- Comments on some recent methods for the simultaneous determination of polynomial zeros
- Annular bounds for the zeros of a polynomial
- The convergence of a family of parallel zero-finding methods
- Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
- Iterative methods for multiple zeros of a polynomial by clustering
- Family of simultaneous methods of Hansen--Patrick's type
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
- Simultaneous factorization of a polynomial by rational approximation
- Finding roots of a real polynomial simultaneously by means of Bairstow's method
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- On some methods for the simultaneous determination of polynomial zeros
- On some simultaneous methods based on Weierstrass' correction
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
- The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem
- A topology optimisation of acoustic devices based on the frequency response estimation with the Padé approximation
- On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously
- On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation
- Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- Study of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineering
- How to count the number of zeros that a polynomial has on the unit circle?
- Computer visualization and dynamic study of new families of root-solvers
- Solving secular and polynomial equations: a multiprecision algorithm
- On the simultaneous refinement of the zeros of H-palindromic polynomials
- On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- On an efficient simultaneous method for finding polynomial zeros
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Complexity of real root isolation using continued fractions
- A highly efficient root-solver of very fast convergence
- A posteriori error bound methods for the inclusion of polynomial zeros
- On efficient two-parameter methods for solving nonlinear equations
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- A new family of adaptive methods with memory for solving nonlinear equations
- Torus partition function of the six-vertex model from algebraic geometry
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
- On region containing all the zeros of a polynomial
- Stability of IMEX Runge-Kutta methods for delay differential equations
- A family of root-finding methods with accelerated convergence
- An efficient higher order family of root finders
- Computational efficiency of some combined methods for polynomial equations
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Generalization and variations of Pellet's theorem for matrix polynomials
- The Durand-Kerner polynomials roots-finding method in case of multiple roots
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- Characterizations of the maximum likelihood estimator of the Cauchy distribution
- On geometry of the zeros of a polynomial
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- Real arithmetic versions of simultaneous iteration methods for polynomial root finding
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- A method for computing all the zeros of a polynomial with real coefficients
- An algorithm for the total, or partial, factorization of a polynomial
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- A fitting algorithm for real coefficient polynomial rooting
- The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros
- Geometry of polynomials and root-finding via path-lifting
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- On comparison of annuli containing all the zeros of a polynomial
- Scaled parallel iterative method for finding real roots of nonlinear equations
- On using symmetric polynomials for constructing root finding methods
- An Algorithm for Quadratic Eigenproblems with Low Rank Damping
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
This page was built for publication: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768561)
