Pages that link to "Item:Q697493"
From MaRDI portal
The following pages link to Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493):
Displaying 50 items.
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Improved bounds for the CF algorithm (Q385006) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- A fitting algorithm for real coefficient polynomial rooting (Q421833) (← links)
- Splitting full matrix algebras over algebraic number fields. (Q448406) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
- Numerical computation of the genus of an irreducible curve within an algebraic set (Q534004) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- A randomized approximation algorithm for the minimal-norm static-output-feedback problem (Q901202) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Infinitely many quasi-coincidence point solutions of multivariate polynomial problems (Q2015347) (← links)
- Real root polynomials and real root preserving transformations (Q2038321) (← links)
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← links)
- The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369) (← links)
- Schur aggregation for linear systems and determinants (Q2378504) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
- Finding Hamming weights without looking at truth tables (Q2392677) (← links)
- Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
- Symmetry detection of rational space curves from their curvature and torsion (Q2409701) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- Root-squaring with DPR1 matrices (Q2452939) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- On application of the ray-shooting method for LQR via static-output-feedback (Q2633243) (← links)
- Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
