Pages that link to "Item:Q2541096"
From MaRDI portal
The following pages link to Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen (Q2541096):
Displaying 50 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros (Q548297) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
- Two observations on Durand-Kerner's root-finding method (Q800688) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- On the convergence of the sequences of Gerschgorin-like disks (Q857652) (← links)
- Construction of zero-finding methods by Weierstrass functions (Q879490) (← links)
- An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations (Q910158) (← links)
- On the efficiency of some combined methods for polynomial complex zeros (Q911229) (← links)
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413) (← links)
- A note on some improvements of the simultaneous methods for determination of polynomial zeros (Q1050090) (← links)
- Computing roots of polynomials on vector processing machines (Q1089743) (← links)
- Practical problems arising for finding roots of nonlinear equations (Q1089744) (← links)
- The Durand-Kerner method for trigonometric and exponential polynomials (Q1094823) (← links)
- A unified approach to method for the simultaneous computation of all zeros of generalized polynomials (Q1098235) (← links)
- Solving systems of algebraic equations by a general elimination method (Q1104981) (← links)
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros (Q1112563) (← links)
- On Euler-like methods for the simultaneous approximation of polynomial zeros (Q1128293) (← links)
- A family of simultaneous zero-finding methods (Q1130393) (← links)
- On an iterative method for simultaneous inclusion of polynomial complex zeros (Q1163339) (← links)
- On the determination of the safe initial approximation for the Durand- Kerner algorithm (Q1184142) (← links)
- Balanced convergence of iterative methods to a multiple zero of a complex polynomial (Q1186910) (← links)
- A hybrid approach for the integration of a rational function (Q1196865) (← links)
- An iteration formula for the simultaneous determination of the zeros of a polynomial (Q1221475) (← links)
- An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm) (Q1241014) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Some simultaneous iterations for finding all zeros of a polynomial with high order convergence (Q1294297) (← links)
- Solving multivariate algebraic equation by Hensel construction (Q1301578) (← links)
- Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems (Q1319864) (← links)
- On a class of higher order methods for simultaneous rootfinding of generalized polynomials (Q1326426) (← links)
- Polynomial zerofinding iterative matrix algorithms (Q1343560) (← links)
- Determination of locations of point-like masses in an inverse source problem of the Poisson equation (Q1347153) (← links)
- Stable spiral orbits of SOR Durand-Kerner's method applied to the equation \(x^ d=0\) (Q1372080) (← links)
- A general method to generate parallel iterations for finding all zeros of polynomial simultaneously (Q1387450) (← links)
- The globalization of Durand-Kerner algorithm (Q1387545) (← links)
- Enclosing clusters of zeros of polynomials (Q1398713) (← links)
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- A new method of increasing the order of convergence step by step (Q1406051) (← links)
- Comments on some recent methods for the simultaneous determination of polynomial zeros (Q1612422) (← links)
- Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration (Q1681770) (← links)
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods (Q1733448) (← links)
- Multiplicity estimating algorithm for zeros of a complex polynomial and its applications (Q1801851) (← links)
- Iterative methods for multiple zeros of a polynomial by clustering (Q1824355) (← links)
- On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step (Q1888238) (← links)
- Polynomial roots: The ultimate answer? (Q1899387) (← links)
- The theory of Smale's point estimation and its applications (Q1900765) (← links)
- Global convergence of the Durand-Kerner method applied to the equation \(z^ 3 = 0\) (Q1919499) (← links)
