Parallel Laguerre iterations: The complex case

Cited in

(33)

On using symmetric polynomials for constructing root finding methods
A new higher-order family of inclusion zero-finding methods
On the convergence order of accelerated root iterations
On some simultaneous methods based on Weierstrass' correction
Improved methods for the simultaneous inclusion of multiple polynomial zeros
On Euler-like methods for the simultaneous approximation of polynomial zeros
On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
On initial conditions for the convergence of simultaneous root finding methods
On some improvements of square root iteration for polynomial complex zeros
ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
A family of root-finding methods with accelerated convergence
A family of simultaneous zero-finding methods
The convergence of a family of parallel zero-finding methods
The numerical stability of simultaneous iterations via square-rooting
Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic
The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
Point estimation of a family of simultaneous zero-finding methods
High order Euler-like method for the inclusion of polynomial zeros
Family of simultaneous methods of Hansen--Patrick's type
On an iterative method for simultaneous inclusion of polynomial complex zeros
Laguerre-like inclusion method for polynomial zeros
A higher order family for the simultaneous inclusion of multiple zeros of polynomials
The self-validated method for polynomial zeros of high efficiency
Modified Newton method in circular interval arithmetic
On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
The numerical stability of the generalised root iterations for polynomial zeros
Comparing parallel Newton's method with parallel Laguerre's method
Parallel square-root iterations for multiple roots
Schröder-like algorithms for multiple complex zeros of a polynomial
On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros
Euler-like method for the simultaneous inclusion of polynomial zeros with Weierstrass' correction

This page was built for publication: Parallel Laguerre iterations: The complex case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1222940)