scientific article; zbMATH DE number 3161517

Cited in

(66)

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

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)