scientific article; zbMATH DE number 3161517
From MaRDI portal
Publication:3279563
zbMATH Open0099.10801MaRDI QIDQ3279563FDOQ3279563
Authors: Emile Durand 
Publication date: 1960
Title of this publication is not available (Why is that?)
Cited In (66)
- An efficient simulation algorithm for the generalized von Mises distribution of order two
- Root finding with threshold circuits
- On some methods for the simultaneous determination of polynomial zeros
- Computing roots of polynomials on vector processing machines
- Stabilizing Bairstow's method
- Generalized scalar products in Minkowski metric spaces
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- 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
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Polynomial zerofinding iterative matrix algorithms
- Computing the measure of a polynomial
- Construction of zero-finding methods by Weierstrass functions
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
- 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
- The Construction of Rational Iterating Functions
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- A posteriori error bound methods for the inclusion of polynomial zeros
- Stable spiral orbits of SOR Durand-Kerner's method applied to the equation \(x^ d=0\)
- On iteration methods without derivatives for the simultaneous determination of polynomial zeros
- Enclosing clusters of zeros of polynomials
- Overdetermined Weierstrass iteration and the nearest consistent system
- 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
- Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations
- A one parameter family of locally quartically convergent zero-finding methods
- Balanced convergence of iterative methods to a multiple zero of a complex polynomial
- The angles between the null spaces of X rays
- The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem
- Chebyshev-Halley methods for analytic functions
- A one parameter square root family of two-step root-finders
- A mathematical approach to detect the Taylor property in TARCH processes
- An Efficient Algorithm for the Classical Least Squares Approximation
- An efficient higher order family of root finders
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- On asynchronous iterations
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Coefficient-free adaptations of polynomial root-finders
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A new simultaneous method of fourth order for finding complex zeros in circular interval arithmetic
- Multiple root-finding methods
- On using symmetric polynomials for constructing root finding methods
- On the fourth order methods of Weierstrass' type
- On the convergent condition of Durand-Kerner method in parallel circular iteration of multi-step
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- A note on the improved derivative free root-solvers
- Scaled parallel iterative method for finding real roots of nonlinear equations
- Approximate calculation of sums. II: Gaussian type quadrature
- \texttt{reskit}: a toolkit to determine the poles of an S-matrix
- The Weierstrass–Durand–Kerner root finder is not generally convergent
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)
