Pages that link to "Item:Q676928"

The following pages link to Numerical computation of polynomial zeros by means of Aberth's method (Q676928):

Displaying 44 items.

• na10 (Q23452) (← links)
• A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue (Q274838) (← links)
• On the local convergence of Ehrlich method for numerical computation of polynomial zeros (Q331804) (← links)
• Orbit determination with the two-body integrals. II (Q362683) (← links)
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method (Q389577) (← links)
• Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
• A fitting algorithm for real coefficient polynomial rooting (Q421833) (← links)
• New progress in real and complex polynomial root-finding (Q552308) (← links)
• Orbit determination with the two-body integrals (Q642351) (← links)
• Computing curve intersection by homotopy methods (Q651931) (← links)
• Root-finding by expansion with independent constraints (Q662237) (← links)
• Relations between roots and coefficients, interpolation and application to system solving (Q697492) (← links)
• Computing zeros of analytic functions in the complex plane without using derivatives (Q710001) (← links)
• An algebraic method to compute the critical points of the distance function between two Keplerian orbits (Q816904) (← links)
• Computing curve intersection by means of simultaneous iterations (Q861738) (← links)
• Innovative methods of correlation and orbit determination for space debris (Q990359) (← links)
• A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials (Q1124738) (← links)
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
• Improved algorithms for computing determinants and resultants (Q1763424) (← links)
• Log-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical roots (Q1789406) (← links)
• The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis (Q1940317) (← links)
• On scale functions for Lévy processes with negative phase-type jumps (Q2052939) (← links)
• Characterization of local optima of polynomial modulus over a disc (Q2138407) (← links)
• Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods (Q2191569) (← links)
• Finding polynomial roots by dynamical systems -- a case study (Q2211136) (← links)
• How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
• Implementation of Pellet's theorem (Q2248964) (← links)
• Solving secular and polynomial equations: a multiprecision algorithm (Q2253077) (← links)
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros (Q2291994) (← links)
• An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
• Real polynomial root-finding by means of matrix and polynomial iterations (Q2357365) (← links)
• Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
• Eigenvalue condition numbers and pseudospectra of Fiedler matrices (Q2363685) (← links)
• New bounds for roots of polynomials based on Fiedler companion matrices (Q2451209) (← links)
• On the complexity of real root isolation using continued fractions (Q2476019) (← links)
• Determining the number of real roots of polynomials through neural networks (Q2507014) (← links)
• Generalization and variations of Pellet's theorem for matrix polynomials (Q2637141) (← links)
• On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (Q2672185) (← links)
• On the stability of computing polynomial roots via confederate linearizations (Q2814445) (← links)
• On using symmetric polynomials for constructing root finding methods (Q5113669) (← links)
• Fast and Backward Stable Computation of Roots of Polynomials (Q5265003) (← links)
• Computer tools for the construction and analysis of some efficient root-finding simultaneous methods (Q5865291) (← links)
• Finite spatial-grid effects in energy-conserving particle-in-cell algorithms (Q6041005) (← links)
• Revisiting the computation of the critical points of the Keplerian distance (Q6076466) (← links)