scientific article; zbMATH DE number 3161517

Cited in

(66)

A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic
Root finding with threshold circuits
An efficient simulation algorithm for the generalized von Mises distribution of order two
On using symmetric polynomials for constructing root finding methods
Computing roots of polynomials on vector processing machines
On some methods for the simultaneous determination of polynomial zeros
On the fourth order methods of Weierstrass' type
Stabilizing Bairstow's method
Generalized scalar products in Minkowski metric spaces
On the convergent condition of Durand-Kerner method in parallel circular iteration of multi-step
An iteration formula for the simultaneous determination of the zeros of a polynomial
Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
A new method of increasing the order of convergence step by step
Efficient polynomial root-refiners: a survey and new record efficiency estimates
On some simultaneous methods based on Weierstrass' correction
On the determination of the safe initial approximation for the Durand- Kerner algorithm
Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
Iterative methods for multiple zeros of a polynomial by clustering
On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step
Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
Biplots for matched two-way tables
Computational complexity. On the geometry of polynomials and a theory of cost. I
Polynomial zerofinding iterative matrix algorithms
Optimal and nearly optimal algorithms for approximating polynomial zeros
Computing the measure of a polynomial
Construction of zero-finding methods by Weierstrass functions
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
Point estimation of simultaneous methods for solving polynomial equations: A survey
Global convergence of the Durand-Kerner method applied to the equation \(z^ 3 = 0\)
Application of generalized Padé approximants to the special function evaluation problem
A high-order iterative formula for simultaneous determination of zeros of a polynomial
The Construction of Rational Iterating Functions
A posteriori error bound methods for the inclusion of polynomial zeros
A note on the improved derivative free root-solvers
Overdetermined Weierstrass iteration and the nearest consistent system
Stable spiral orbits of SOR Durand-Kerner's method applied to the equation \(x^ d=0\)
Enclosing clusters of zeros of polynomials
On iteration methods without derivatives for the simultaneous determination of polynomial zeros
A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
The X-ray transform
Relations between roots and coefficients, interpolation and application to system solving
Numerical computation of polynomial zeros by means of Aberth's method
Scaled parallel iterative method for finding real roots of nonlinear equations
Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
Balanced convergence of iterative methods to a multiple zero of a complex polynomial
An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations
The angles between the null spaces of X rays
A one parameter family of locally quartically convergent zero-finding methods
General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
Approximate calculation of sums. II: Gaussian type quadrature
The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem
\texttt{reskit}: a toolkit to determine the poles of an S-matrix
Chebyshev-Halley methods for analytic functions
The Weierstrass–Durand–Kerner root finder is not generally convergent
A one parameter square root family of two-step root-finders
A mathematical approach to detect the Taylor property in TARCH processes
An efficient higher order family of root finders
An Efficient Algorithm for the Classical Least Squares Approximation
On asynchronous iterations
Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Coefficient-free adaptations of polynomial root-finders
Multiple root-finding methods
Iteration Methods for Finding all Zeros of a Polynomial Simultaneously

This page was built for publication:

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