Pages that link to "Item:Q762886"
From MaRDI portal
The following pages link to A parallel algorithm for simple roots of polynomials (Q762886):
Displaying 26 items.
- A parallel algorithm for finding roots of a complex polynomial (Q805233) (← links)
- Finding the roots of a polynomial on an MIMD multicomputer (Q811090) (← links)
- Construction of zero-finding methods by Weierstrass functions (Q879490) (← links)
- Parallel algorithms for some algebraic operations on polynomial equations (Q921855) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413) (← links)
- Computing roots of polynomials on vector processing machines (Q1089743) (← links)
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems (Q1091081) (← links)
- Fast parallel algorithms for Graeffe's root squaring technique (Q1129507) (← links)
- A family of simultaneous zero-finding methods (Q1130393) (← links)
- Polynomial root computation by means of the LR algorithm (Q1359970) (← links)
- Point estimation of a family of simultaneous zero-finding methods (Q1806445) (← links)
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros (Q1883562) (← links)
- Finding roots of a real polynomial simultaneously by means of Bairstow's method (Q1914869) (← links)
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
- A posteriori error bound methods for the inclusion of polynomial zeros (Q2381619) (← links)
- (Q3200481) (← links)
- A globally convergent parallel algorithm for zeros of polynomial systems (Q3484271) (← links)
- (Q3798149) (← links)
- Efficient parallel rooting of complex polynomials on the unit circle (Q3987283) (← links)
- (Q4209118) (← links)
- On the fourth order methods of Weierstrass' type (Q4378438) (← links)
- The granularity of parallel homotopy algorithms for polynomial systems of equations (Q4733310) (← links)
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros (Q4831432) (← links)
- On a cubically convergent derivative-free root finding method (Q5297941) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey (Q5948584) (← links)
