Pages that link to "Item:Q1801245"
From MaRDI portal
The following pages link to Iterative methods for simultaneous inclusion of polynomial zeros (Q1801245):
Displaying 50 items.
- An efficient derivative free family of fourth order methods for solving systems of nonlinear equations (Q272459) (← links)
- Improved methods for the simultaneous inclusion of multiple polynomial zeros (Q279305) (← links)
- Efficient derivative-free numerical methods for solving systems of nonlinear equations (Q291390) (← links)
- Multi-step root solvers of Traub's type in real interval arithmetic (Q298478) (← links)
- Some families of two-step simultaneous methods for determining zeros of nonlinear equations (Q420266) (← links)
- On an efficient inclusion method for finding polynomial zeros (Q492088) (← links)
- On the decidability of the theory of modules over the ring of algebraic integers (Q529159) (← links)
- Efficient methods for the inclusion of polynomial zeros (Q544062) (← links)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros (Q548297) (← links)
- A new higher-order family of inclusion zero-finding methods (Q557779) (← links)
- New higher-order methods for the simultaneous inclusion of polynomial zeros (Q639989) (← links)
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic (Q640522) (← links)
- Generalized Ostrowski root-finding method (Q687029) (← links)
- Iteration functions re-visited (Q730575) (← links)
- Schröder-like algorithms for multiple complex zeros of a polynomial (Q756374) (← links)
- Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic (Q758126) (← links)
- A hybrid method for polynomial complex zero (Q758127) (← links)
- A high order iteration formula for the simultaneous inclusion of polynomial zeros (Q849758) (← links)
- On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← links)
- On the efficiency of some combined methods for polynomial complex zeros (Q911229) (← links)
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros (Q929751) (← 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)
- Enclosing all zeros of an analytic function - a rigorous approach (Q1019813) (← 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 family of simultaneous zero-finding methods (Q1130393) (← links)
- Higher-order iterative methods for approximating zeros of analytic functions (Q1186915) (← links)
- A class of simultaneous methods for the zeros of analytic functions (Q1192171) (← links)
- On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros (Q1207050) (← links)
- Some simultaneous iterations for finding all zeros of a polynomial with high order convergence (Q1294297) (← links)
- On the convergence of Wang-Zheng's method (Q1298532) (← links)
- An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction (Q1319612) (← links)
- A note on simultaneous rootfinding for algebraic, exponential, and trigonometric polynomials (Q1324400) (← links)
- On a class of higher order methods for simultaneous rootfinding of generalized polynomials (Q1326426) (← links)
- On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane (Q1334754) (← links)
- The behaviour of approximations of the SOR Weierstrass method (Q1352773) (← links)
- Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices (Q1379083) (← links)
- A general method to generate parallel iterations for finding all zeros of polynomial simultaneously (Q1387450) (← links)
- Enclosing clusters of zeros of polynomials (Q1398713) (← links)
- A new method of increasing the order of convergence step by step (Q1406051) (← links)
- Floating point Gröbner bases. (Q1565834) (← links)
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros (Q1568729) (← links)
- Finding a cluster of zeros of univariate polynomials (Q1594831) (← links)
- Containment regions for zeros of polynomials from numerical ranges of companion matrices (Q1611879) (← links)
- A new fourth-order family of simultaneous methods for finding polynomial zeros (Q1774854) (← links)
- Laguerre-like inclusion method for polynomial zeros (Q1872969) (← links)
- Family of simultaneous methods of Hansen--Patrick's type (Q1878394) (← links)
- On a modification of the Koenig theorem (Q1893456) (← links)
- Initial approximations in Euler-Chebyshev's method (Q1899955) (← links)