Pages that link to "Item:Q1921261"
From MaRDI portal
The following pages link to Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261):
Displayed 36 items.
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- On the isotopic meshing of an algebraic implicit surface (Q414623) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems (Q639990) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros (Q929751) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Polynomial factorization through Toeplitz matrix computations (Q1874656) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
- First-order orbit queries (Q2048201) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
- A family of root-finding methods with accelerated convergence (Q2475888) (← links)
- An efficient higher order family of root finders (Q2483336) (← links)
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials (Q2501236) (← links)
- Sigmoid-like functions and root finding methods (Q2518658) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions (Q2967967) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- (Q5090452) (← links)
- (Q5094125) (← links)
- Computing a Hurwitz factorization of a polynomial (Q5928301) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)