Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261): Difference between revisions

Latest revision as of 13:03, 24 May 2024

scientific article

Language	Label	Description	Also known as
English	Optimal and nearly optimal algorithms for approximating polynomial zeros	scientific article

Statements

instance of

scholarly article

0 references

title

Optimal and nearly optimal algorithms for approximating polynomial zeros (English)

0 references

published in

Computers \& Mathematics with Applications

0 references

publication date

25 March 1997

0 references

review text

The author presents a new algorithm for approximating all complex zeros of a polynomial. The new algorithm is shown to be superior to the previous best algorithms -- in fact it is shown to be asymptotically optimal. Parallel aspects are also addressed and, even though no results on a parallel implementation are reported, the algorithm is expected to parallelize well.

@@ Property / author @@
-Pan, Victor Y.
@@ Property / author: Pan, Victor Y. / rank @@
-Normal rank
@@ Property / reviewed by @@
-Claus Bendtsen
@@ Property / reviewed by: Claus Bendtsen / rank @@
-Normal rank
@@ Property / author @@
+Pan, Victor Y.
@@ Property / author: Pan, Victor Y. / rank @@
+Normal rank
@@ Property / reviewed by @@
+Claus Bendtsen
@@ Property / reviewed by: Claus Bendtsen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(96)00080-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2155969572
@@ Property / OpenAlex ID: W2155969572 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential and parallel complexity of approximate evaluation of polynomial zeros
+Normal rank
@@ Property / cites work @@
+Specified precision polynomial root isolation is in NC
+Normal rank
@@ Property / cites work @@
+On the Complexity of Polynomial Zeros
@@ Property / cites work: On the Complexity of Polynomial Zeros / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234125
@@ Property / cites work: Q4234125 / rank @@
+Normal rank
@@ Property / cites work @@
+A quadtree algorithm for template matching on a pyramid computer
+Normal rank
@@ Property / cites work @@
+Weyl's quadtree algorithm for the unsymmetric eigenvalue problem
+Normal rank
@@ Property / cites work @@
+Q5779155
@@ Property / cites work: Q5779155 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572275
@@ Property / cites work: Q5572275 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5563347
@@ Property / cites work: Q5563347 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5653524
@@ Property / cites work: Q5653524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4072022
@@ Property / cites work: Q4072022 / rank @@
+Normal rank
@@ Property / cites work @@
+The fundamental theorem of algebra and complexity theory
+Normal rank
@@ Property / cites work @@
+Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590393
@@ Property / cites work: Q5590393 / rank @@
+Normal rank
@@ Property / cites work @@
+On the worst-case arithmetic complexity of approximating zeros of polynomials
+Normal rank
@@ Property / cites work @@
+Q3128886
@@ Property / cites work: Q3128886 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128885
@@ Property / cites work: Q3128885 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
+Normal rank
@@ Property / cites work @@
+Simple algorithms for approximating all roots of a polynomial with real roots
+Normal rank
@@ Property / cites work @@
+Q3138975
@@ Property / cites work: Q3138975 / rank @@
+Normal rank
@@ Property / cites work @@
+New Resultant Inequalities and Complex Polynomial Factorization
+Normal rank
@@ Property / cites work @@
+A Generalization of a Theorem of Bôcher
@@ Property / cites work: A Generalization of a Theorem of Bôcher / rank @@
+Normal rank
@@ Property / cites work @@
+Q5341755
@@ Property / cites work: Q5341755 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138141
@@ Property / cites work: Q4138141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3935355
@@ Property / cites work: Q3935355 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4314299
@@ Property / cites work: Q4314299 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3279563
@@ Property / cites work: Q3279563 / rank @@
+Normal rank
@@ Property / cites work @@
+Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
+Normal rank
@@ Property / cites work @@
+Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
+Normal rank
@@ Property / cites work @@
+A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
+Normal rank
@@ Property / cites work @@
+Q3816922
@@ Property / cites work: Q3816922 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Root-Finding Algorithms and Branched Covers
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's Theorem I: Geometric Aspects
+Normal rank
@@ Property / cites work @@
+Q3135179
@@ Property / cites work: Q3135179 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. III: Condition number and packing
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. V: Polynomial time
+Normal rank
@@ Property / cites work @@
+Upperbounds for roots of polynomials
@@ Property / cites work: Upperbounds for roots of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Power Sum Method and the Approximative Solution of Algebraic Equations
+Normal rank
@@ Property / cites work @@
+Q5835072
@@ Property / cites work: Q5835072 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-gcd computations
@@ Property / cites work: Quasi-gcd computations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4055156
@@ Property / cites work: Q4055156 / rank @@
+Normal rank
@@ Property / cites work @@
+How to multiply matrices faster
@@ Property / cites work: How to multiply matrices faster / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial division and its computational complexity
+Normal rank
@@ Property / cites work @@
+A Numerical Method for Locating the Zeros of an Analytic Function
+Normal rank
@@ Property / cites work @@
+Über das Newtonsche Verfahren
@@ Property / cites work: Über das Newtonsche Verfahren / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Size Integer Division Circuits
@@ Property / cites work: Optimal Size Integer Division Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
+Normal rank
@@ Property / cites work @@
+Parametrization of Newton's iteration for computations with structured matrices and applications
+Normal rank
@@ Property / cites work @@
+Q3732964
@@ Property / cites work: Q3732964 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of parallel matrix computations
@@ Property / cites work: Complexity of parallel matrix computations / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel solution of Toeplitzlike linear systems
@@ Property / cites work: Parallel solution of Toeplitzlike linear systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234216
@@ Property / cites work: Q4234216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4177796
@@ Property / cites work: Q4177796 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3359644
@@ Property / cites work: Q3359644 / rank @@
+Normal rank

Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261): Difference between revisions

Latest revision as of 13:03, 24 May 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)