Pages that link to "Item:Q1313191"
From MaRDI portal
The following pages link to A bibliography on roots of polynomials (Q1313191):
Displaying 42 items.
- An efficient method to find solutions for transcendental equations with several roots (Q277596) (← links)
- Finding all real roots of a polynomial by matrix algebra and the Adomian decomposition method (Q467101) (← links)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros (Q548297) (← links)
- Fast approach for computing roots of polynomials using cubic clipping (Q625270) (← links)
- Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems (Q639990) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- A supplementary bibliography: on roots of polynomials (Q675983) (← links)
- Numerical computation of polynomial zeros by means of Aberth's method (Q676928) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Removing multiplicities in \(\mathbb C\) by double Newtonization (Q732391) (← links)
- Computing roots of polynomials by quadratic clipping (Q733402) (← links)
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413) (← links)
- Enclosing clusters of zeros of polynomials (Q1398713) (← links)
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Containment regions for zeros of polynomials from numerical ranges of companion matrices (Q1611879) (← links)
- A 2002 update of the supplementary bibliography on roots of polynomials (Q1612321) (← links)
- Comments on some recent methods for the simultaneous determination of polynomial zeros (Q1612422) (← links)
- A rational cubic clipping method for computing real roots of a polynomial (Q1632370) (← links)
- Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- An updated supplementary bibliography on roots of polynomials (Q1807812) (← links)
- An algorithm for locating all zeros of a real polynomial (Q1893153) (← links)
- An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros (Q1917920) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- The polynomial pivots as initial values for a new root-finding iterative method (Q2336929) (← links)
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)
- Scaled generalized Bernstein polynomials and containment regions for the zeros of polynomials (Q2370579) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
- An efficient higher order family of root finders (Q2483336) (← links)
- On truncated Taylor series and the position of their spurious zeros (Q2581573) (← links)
- Algorithm 954: An accurate and efficient cubic and quartic equation solver for physical applications (Q2828160) (← links)
- Chebyshev-like root-finding methods with accelerated convergence (Q3011656) (← links)
- (Q3768840) (← links)
- Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil (Q4584920) (← links)
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros (Q4831432) (← links)
- On a cubically convergent derivative-free root finding method (Q5297941) (← links)
- RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS (Q5314399) (← links)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications (Q5928297) (← links)
- A computational comparison of the first nine members of a determinantal family of root-finding methods (Q5937186) (← links)
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis (Q6572622) (← links)
