On new higher order families of simultaneous methods for finding polynomial zeros
type: Item
instance of: scholarly article
title: On new higher order families of simultaneous methods for finding polynomial zeros
zbMATH Open document ID: 1157.65026
author: M. S. Petković
published in: Linear Algebra and its Applications
publication date: 2008-11-06T00:00:00Z
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 13P05
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 5362063
zbMATH Keywords: root finding methods
zbMATH Keywords: polynomial zeros
zbMATH Keywords: simultaneous methods
zbMATH Keywords: convergence
zbMATH Keywords: nonlinear equation
zbMATH Keywords: numerical results
describes a project that uses: na20
MaRDI profile type: Publication
full work available at URL: j.laa.2007.10.028
OpenAlex ID: W2052920529
cites work: A family of Chebyshev-Halley type methods in Banach spaces
cites work: On the convergence order of a modified method for simultaneous finding polynomial zeros
cites work: Convergence conditions of some methods for the simultaneous computation of polynomial zero
cites work: Construction of zero-finding methods by Weierstrass functions
cites work: On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
cites work: On some simultaneous methods based on Weierstrass' correction
cites work: A high-order iterative formula for simultaneous determination of zeros of a polynomial
cites work: On Euler-like methods for the simultaneous approximation of polynomial zeros
cites work: A parallel algorithm for simple roots of polynomials
cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
cites work: A modified Newton method for polynomials
cites work: Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
cites work: Q4072022
cites work: Q4254885
cites work: Q4002529
cites work: The Root Separation of Polynomials and Some Applications
cites work: An Existence Test for Root Clusters and Multiple Roots
cites work: Enclosing clusters of zeros of polynomials
cites work: A method for finding the zeros of polynomials using a companion matrix.
cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros
cites work: Ten methods to bound multiple roots of polynomials
cites work: Iterative methods for simultaneous inclusion of polynomial zeros
cites work: A higher order family for the simultaneous inclusion of multiple zeros of polynomials
cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder
cites work: On some methods for the simultaneous determination of polynomial zeros
cites work: Q4874571
cites work: On some applications of circular complex functions
cites work: Improving the Van de Vel root-finding method
cites work: A modification of Newton's method for analytic mappings having multiple zeros
cites work: A family of root finding methods
DOI: 10.1016/J.LAA.2007.10.028
description: scientific article; zbMATH DE number 5362063