Pages that link to "Item:Q805233"
From MaRDI portal
The following pages link to A parallel algorithm for finding roots of a complex polynomial (Q805233):
Displaying 11 items.
- A parallel algorithm for simple roots of polynomials (Q762886) (← links)
- Finding the roots of a polynomial on an MIMD multicomputer (Q811090) (← 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)
- A parallel complex zero finder (Q1904319) (← links)
- The properties of a new subclass of harmonic univalent mappings (Q2319113) (← links)
- (Q3200481) (← links)
- Finding polynomial roots: A fast algorithm convergent on the complex plane (Q3729924) (← links)
- (Q3798149) (← links)
- Efficient parallel rooting of complex polynomials on the unit circle (Q3987283) (← links)
- (Q5708168) (← links)
- Finding the roots of polynomial equations: An algorithm with linear command (Q5933889) (← links)