Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
From MaRDI portal
Publication:1824354
DOI10.1016/0898-1221(89)90080-1zbMath0682.65023OpenAlexW2050074872MaRDI QIDQ1824354
Publication date: 1989
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(89)90080-1
Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05) Real polynomials: location of zeros (26C10)
Related Items
Parallel computation of polynomial GCD and some related parallel computations over abstract fields, New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set, Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Parametrization of Newton's iteration for computations with structured matrices and applications, Efficient parallel factorization and solution of structured and unstructured linear systems
Cites Work
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Displacement ranks of matrices and linear equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- An inequality for the discriminant of a polynomial
- Parallel Algorithms for Algebraic Problems
- The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
- Fast Parallel Algorithms for QR and Triangular Factorization
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Evaluating Polynomials at Fixed Sets of Points
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Fast parallel matrix and GCD computations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
