Pages that link to "Item:Q4768561"
From MaRDI portal
The following pages link to Iteration Methods for Finding all Zeros of a Polynomial Simultaneously (Q4768561):
Displaying 50 items.
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously (Q262691) (← links)
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros (Q331804) (← 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)
- A fitting algorithm for real coefficient polynomial rooting (Q421833) (← links)
- The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros (Q443044) (← links)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros (Q548297) (← links)
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271) (← links)
- On a family of Weierstrass-type root-finding methods with accelerated convergence (Q668566) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros (Q742856) (← links)
- A parallel algorithm for simple roots of polynomials (Q762886) (← links)
- On dynamics of iterative techniques for nonlinear equation with applications in engineering (Q779549) (← links)
- Cylinder partition function of the 6-vertex model from algebraic geometry (Q783974) (← links)
- Two observations on Durand-Kerner's root-finding method (Q800688) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- Computing curve intersection by means of simultaneous iterations (Q861738) (← links)
- Construction of zero-finding methods by Weierstrass functions (Q879490) (← links)
- An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations (Q910158) (← links)
- Suboptimal Kronrod extension formulae for numerical quadrature (Q913443) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations (Q988247) (← links)
- The self-validated method for polynomial zeros of high efficiency (Q1034672) (← links)
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413) (← links)
- A note on some improvements of the simultaneous methods for determination of polynomial zeros (Q1050090) (← links)
- Computing roots of polynomials on vector processing machines (Q1089743) (← links)
- Practical problems arising for finding roots of nonlinear equations (Q1089744) (← links)
- Some parallel methods for polynomial root-finding (Q1091080) (← links)
- The Durand-Kerner method for trigonometric and exponential polynomials (Q1094823) (← links)
- Solving systems of algebraic equations by a general elimination method (Q1104981) (← links)
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros (Q1112563) (← links)
- A family of simultaneous zero-finding methods (Q1130393) (← links)
- On an iterative method for simultaneous inclusion of polynomial complex zeros (Q1163339) (← links)
- A high-order iterative formula for simultaneous determination of zeros of a polynomial (Q1184136) (← links)
- Balanced convergence of iterative methods to a multiple zero of a complex polynomial (Q1186910) (← links)
- A hybrid approach for the integration of a rational function (Q1196865) (← links)
- On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros (Q1207050) (← links)
- An iteration formula for the simultaneous determination of the zeros of a polynomial (Q1221475) (← links)
- Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains (Q1272877) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Solving multivariate algebraic equation by Hensel construction (Q1301578) (← links)
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction (Q1319612) (← links)
- Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems (Q1319864) (← links)
- Solving certain queueing problems modelled by Toeplitz matrices (Q1346993) (← links)
- A note on the convergence of the Weierstrass SOR method for polynomial roots (Q1360163) (← links)
- Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation (Q1372037) (← links)
- Polynomial root finding by means of continuation (Q1377268) (← links)
- Point estimation and some applications to iterative methods (Q1387244) (← links)
- A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
