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