Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen

DOI10.1007/BF02162564zbMath0202.43605MaRDI QIDQ2541096

Publication date: 1966

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131704

Related Items

On a class of higher order methods for simultaneous rootfinding of generalized polynomials, Scaled parallel iterative method for finding real roots of nonlinear equations, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, A one parameter square root family of two-step root-finders, Computing roots of polynomials on vector processing machines, Practical problems arising for finding roots of nonlinear equations, On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step, Polynomial zerofinding iterative matrix algorithms, The Durand-Kerner method for trigonometric and exponential polynomials, Determination of locations of point-like masses in an inverse source problem of the Poisson equation, On a cubically convergent derivative-free root finding method, A note on the improved derivative free root-solvers, The Weierstrass–Durand–Kerner root finder is not generally convergent, A unified approach to method for the simultaneous computation of all zeros of generalized polynomials, A posteriori error bound methods for the inclusion of polynomial zeros, Polynomial roots: The ultimate answer?, The Durand-Kerner polynomials roots-finding method in case of multiple roots, The theory of Smale's point estimation and its applications, The simultaneous determination of all zeros of a polynomial, Solving systems of algebraic equations by a general elimination method, On the convergence of the sequences of Gerschgorin-like disks, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, 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, A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial, Construction of zero-finding methods by Weierstrass functions, On some simultaneous methods based on Weierstrass' correction, Solvable models of layered neural networks based on their differential structure, On Euler-like methods for the simultaneous approximation of polynomial zeros, A family of simultaneous zero-finding methods, A general method to generate parallel iterations for finding all zeros of polynomial simultaneously, The globalization of Durand-Kerner algorithm, Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration, Iteration Methods for Finding all Zeros of a Polynomial Simultaneously, Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods, Enclosing clusters of zeros of polynomials, Ten methods to bound multiple roots 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, On the efficiency of some combined methods for polynomial complex zeros, On an iterative method for simultaneous inclusion of polynomial complex zeros, A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously, A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial, An Efficient Algorithm for the Classical Least Squares Approximation, Numerical Calabi–Yau metrics, Overdetermined Weierstrass iteration and the nearest consistent system, A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., 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, A hybrid approach for the integration of a rational function, A family of root-finding methods with accelerated convergence, Real arithmetic versions of simultaneous iteration methods for polynomial root finding, Root finding with threshold circuits, High order Euler-like method for the inclusion of polynomial zeros, 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, On the new fourth-order methods for the simultaneous approximation of polynomial zeros, An iteration formula for the simultaneous determination of the zeros of a polynomial, Point estimation of simultaneous methods for solving polynomial equations: A survey, An algorithm for the total, or partial, factorization of a polynomial, An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm), Durand-Kerner method for the real roots, AMAP/G/1 Queue with an Underlying Birth–Death Process, General convergence theorems for iterative processes and applications to the Weierstrass root-finding method, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Multiplicity estimating algorithm for zeros of a complex polynomial and its applications, A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE, On the stability of computing polynomial roots via confederate linearizations, Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation, A method for computing all the zeros of a polynomial with real coefficients, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem, Iterative methods for multiple zeros of a polynomial by clustering, Über die Nullstellenbestimmung bei näherungsweise berechneten Funktionen, Simultaneous inclusion of the zeros of a polynomial, On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial, Some simultaneous iterations for finding all zeros of a polynomial with high order convergence, A note on some improvements of the simultaneous methods for determination of polynomial zeros, On the convergent condition of Durand-Kerner method in parallel circular iteration of multi-step, Solving multivariate algebraic equation by Hensel construction, A family of simultaneous methods for the determination of polynomial complex zeros, Two observations on Durand-Kerner's root-finding method, Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems, Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders, Coefficient-free adaptations of polynomial root-finders, Comments on some recent methods for the simultaneous determination of polynomial zeros

Cites Work