Pages that link to "Item:Q4340817"

The following pages link to Solving a Polynomial Equation: Some History and Recent Progress (Q4340817):

Displaying 50 items.

• Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
• Finding the number of roots of a polynomial in a plane region using the winding number (Q316523) (← links)
• Electromagnetic field generated by a modulated moving point source in a planarly layered waveguide (Q327081) (← 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)
• A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
• The computation of multiple roots of a polynomial (Q425345) (← links)
• Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method (Q467101) (← links)
• Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
• Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
• Computing real roots of real polynomials (Q491245) (← links)
• Routh-type table test for zero distribution of polynomials with commensurate fractional and integer degrees (Q509471) (← links)
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
• New progress in real and complex polynomial root-finding (Q552308) (← links)
• A property of the nearly optimal root-bound (Q596173) (← links)
• Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271) (← links)
• Numerical factorization of multivariate complex polynomials (Q598228) (← links)
• A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
• Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
• Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems (Q639990) (← links)
• A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
• Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
• SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
• Root-finding by expansion with independent constraints (Q662237) (← links)
• Root finding with threshold circuits (Q690451) (← links)
• Rational inversion of the Laplace transform (Q692811) (← links)
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
• Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
• Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
• Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
• Enclosing all zeros of an analytic function - a rigorous approach (Q1019813) (← links)
• Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431) (← links)
• Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
• Computations with infinite Toeplitz matrices and polynomials (Q1348083) (← links)
• On solvents of matrix polynomials. (Q1412341) (← links)
• A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
• Finding a cluster of zeros of univariate polynomials (Q1594831) (← links)
• Real computations with fake numbers (Q1599196) (← links)
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
• On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity (Q1697274) (← links)
• An adaptive subdivision method for root finding of univariate polynomials (Q1736361) (← links)
• Improved algorithms for computing determinants and resultants (Q1763424) (← links)
• Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications (Q1765801) (← links)
• Symmetric functions and root-finding algorithms (Q1775732) (← links)
• Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
• On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem (Q1861969) (← links)
• Polynomial factorization through Toeplitz matrix computations (Q1874656) (← links)