Parallel Laguerre iterations: The complex case
From MaRDI portal
Publication:1222940
DOI10.1007/BF01395948zbMath0319.65036OpenAlexW2038471095MaRDI QIDQ1222940
Publication date: 1976
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132416
Related Items
Laguerre-like inclusion method for polynomial zeros ⋮ ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS ⋮ Family of simultaneous methods of Hansen--Patrick's type ⋮ Improved methods for the simultaneous inclusion of multiple polynomial zeros ⋮ Modified Newton method in circular interval arithmetic ⋮ Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros ⋮ Euler-Like Method for the Simultaneous Inclusion of Polynomial Zeros with Weierstrass’ Correction ⋮ On some simultaneous methods based on Weierstrass' correction ⋮ On initial conditions for the convergence of simultaneous root finding methods ⋮ On Euler-like methods for the simultaneous approximation of polynomial zeros ⋮ A family of simultaneous zero-finding methods ⋮ Parallel square-root iterations for multiple roots ⋮ On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic ⋮ On using symmetric polynomials for constructing root finding methods ⋮ On an iterative method for simultaneous inclusion of polynomial complex zeros ⋮ On the convergence condition of generalized root iterations for the inclusion of polynomial zeros ⋮ A family of root-finding methods with accelerated convergence ⋮ High order Euler-like method for the inclusion of polynomial zeros ⋮ The convergence of a family of parallel zero-finding methods ⋮ A new higher-order family of inclusion zero-finding methods ⋮ A higher order family for the simultaneous inclusion of multiple zeros of polynomials ⋮ On some improvements of square root iteration for polynomial complex zeros ⋮ Comparing parallel Newton's method with parallel Laguerre's method ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ The numerical stability of simultaneous iterations via square-rooting ⋮ Point estimation of a family of simultaneous zero-finding methods ⋮ Schröder-like algorithms for multiple complex zeros of a polynomial ⋮ The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros ⋮ The self-validated method for polynomial zeros of high efficiency ⋮ On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros ⋮ On the convergence order of accelerated root iterations ⋮ The numerical stability of the generalised root iterations for polynomial zeros ⋮ On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic
Cites Work
