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.
- Comments on some recent methods for the simultaneous determination of polynomial zeros (Q1612422) (← links)
- Annular bounds for the zeros of a polynomial (Q1751320) (← links)
- The convergence of a family of parallel zero-finding methods (Q1767950) (← links)
- Multiplicity estimating algorithm for zeros of a complex polynomial and its applications (Q1801851) (← links)
- Iterative methods for multiple zeros of a polynomial by clustering (Q1824355) (← links)
- Family of simultaneous methods of Hansen--Patrick's type (Q1878394) (← links)
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomials (Q1900755) (← links)
- Simultaneous factorization of a polynomial by rational approximation (Q1903657) (← links)
- Finding roots of a real polynomial simultaneously by means of Bairstow's method (Q1914869) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- On some methods for the simultaneous determination of polynomial zeros (Q1922231) (← links)
- On some simultaneous methods based on Weierstrass' correction (Q1923458) (← links)
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis (Q1940317) (← links)
- Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications (Q1983392) (← links)
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions (Q2002783) (← links)
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros (Q2008912) (← links)
- The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem (Q2068644) (← links)
- A topology optimisation of acoustic devices based on the frequency response estimation with the Padé approximation (Q2110070) (← links)
- On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously (Q2167239) (← links)
- On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation (Q2167257) (← links)
- Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation (Q2167274) (← links)
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
- Study of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineering (Q2193332) (← links)
- How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
- Computer visualization and dynamic study of new families of root-solvers (Q2231295) (← links)
- Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
- On the simultaneous refinement of the zeros of H-palindromic polynomials (Q2253078) (← links)
- On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros (Q2279594) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
- On an efficient simultaneous method for finding polynomial zeros (Q2345285) (← links)
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously (Q2357433) (← links)
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros (Q2366429) (← links)
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials (Q2366652) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II. (Q2372910) (← links)
- Complexity of real root isolation using continued fractions (Q2378508) (← links)
- A highly efficient root-solver of very fast convergence (Q2378767) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- On efficient two-parameter methods for solving nonlinear equations (Q2391884) (← links)
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials (Q2402410) (← links)
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously (Q2407926) (← links)
- A new family of adaptive methods with memory for solving nonlinear equations (Q2418468) (← links)
- Torus partition function of the six-vertex model from algebraic geometry (Q2421149) (← links)
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros (Q2424923) (← links)
- On region containing all the zeros of a polynomial (Q2453362) (← links)
- Stability of IMEX Runge-Kutta methods for delay differential equations (Q2475389) (← links)
- A family of root-finding methods with accelerated convergence (Q2475888) (← links)
- An efficient higher order family of root finders (Q2483336) (← links)
- Computational efficiency of some combined methods for polynomial equations (Q2518679) (← links)
