Optimal and nearly optimal algorithms for approximating polynomial zeros

From MaRDI portal
Revision as of 14:52, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1921261

DOI10.1016/0898-1221(96)00080-6zbMath0859.65045OpenAlexW2155969572MaRDI QIDQ1921261

Pan, Victor Y.

Publication date: 25 March 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00080-6




Related Items (36)

Polynomial factorization through Toeplitz matrix computationsNear optimal subdivision algorithms for real root isolationThe amended DSeSC power method for polynomial root-findingDeterministic improvement of complex polynomial factorization based on the properties of the associated resultantParallel computation of polynomial GCD and some related parallel computations over abstract fieldsComplexity of path-following methods for the eigenvalue problemRigid continuation paths II. structured polynomial systemsNearly optimal refinement of real roots of a univariate polynomialOn the isotopic meshing of an algebraic implicit surfaceEfficient polynomial root-refiners: a survey and new record efficiency estimatesRigorous uniform approximation of D-finite functions using Chebyshev expansionsInverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systemsSqFreeEVAL: An (almost) optimal real-root isolation algorithmOn the convergence condition of generalized root iterations for the inclusion of polynomial zerosRoot-finding by expansion with independent constraintsRoot refinement for real polynomials using quadratic interval refinementApproximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.Lifting/descending processes for polynomial zeros.A fast and stable algorithm for splitting polynomialsOn new higher order families of simultaneous methods for finding polynomial zerosA family of root-finding methods with accelerated convergenceRoot finding with threshold circuitsComputing a Hurwitz factorization of a polynomialAn efficient higher order family of root findersUnivariate polynomials: Nearly optimal algorithms for numerical factorization and root-findingOn the geometry of Graeffe iterationA higher order family for the simultaneous inclusion of multiple zeros of polynomialsUnnamed ItemUnnamed ItemSigmoid-like functions and root finding methodsFirst-order orbit queriesOn the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyondDecidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)] ⋮ The polynomial pivots as initial values for a new root-finding iterative methodComputation of approximate polynomial GCDs and an extension




Cites Work




This page was built for publication: Optimal and nearly optimal algorithms for approximating polynomial zeros