Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
type: Item
instance of: scholarly article
title: Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
zbMATH Open document ID: 0682.65023
DOI: 10.1016/0898-1221(89)90080-1
publication date: 1989-01-01T00:00:00Z
review text: The author discusses the numerical efficiency of a variant of a recent method for parallel computation of polynomial zeros.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 26C10
zbMATH DE Number: 4117748
zbMATH Keywords: numerical efficiency
zbMATH Keywords: parallel computation
zbMATH Keywords: polynomial zeros
author: Victor Y. Pan
reviewed by: Gerhard Merz
MaRDI profile type: Publication
full work available at URL: 0898-1221(89)90080-1
OpenAlex ID: W2050074872
cites work: Fast parallel matrix and GCD computations
cites work: Q4725742
cites work: Sequential and parallel complexity of approximate evaluation of polynomial zeros
cites work: Q4773298
cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants
cites work: Evaluating Polynomials at Fixed Sets of Points
cites work: Q5653524
cites work: Q3935355
cites work: Q3933736
cites work: An inequality for the discriminant of a polynomial
cites work: Parallel Algorithms for Algebraic Problems
cites work: Asymptotically fast solution of Toeplitz and related systems of linear equations
cites work: Displacement ranks of matrices and linear equations
cites work: Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
cites work: Fast Parallel Algorithms for QR and Triangular Factorization
cites work: Q5185900
cites work: Q3772828
cites work: Q3992847
cites work: The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions
published in: Computers & Mathematics with Applications
Recommended article: Q4004920
Recommended article: Q4004921
Recommended article: A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
Recommended article: Q5260800
Recommended article: Q4374448
Recommended article: Parallel computation of real solving bivariate polynomial systems by zero-matching method
Recommended article: Q3611053
Recommended article: Sequential and parallel complexity of approximate evaluation of polynomial zeros
Recommended article: Q4226999
Recommended article: A general method to generate parallel iterations for finding all zeros of polynomial simultaneously
description: scientific article; zbMATH DE number 4117748