na10
From MaRDI portal
Software:23452
swMATH11511MaRDI QIDQ23452FDOQ23452
Author name not available (Why is that?)
Cited In (52)
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- Finding polynomial roots by dynamical systems -- a case study
- 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
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Numerical Methods for the Tridiagonal Hyperbolic Quadratic Eigenvalue Problem
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- How to count the number of zeros that a polynomial has on the unit circle?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Locating the Eigenvalues of Matrix Polynomials
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Solving a Polynomial Equation: Some History and Recent Progress
- New progress in real and complex polynomial root-finding
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Root-finding by expansion with independent constraints
- Log-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical roots
- A fitting algorithm for real coefficient polynomial rooting
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- 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
- Characterization of local optima of polynomial modulus over a disc
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Computing a Factor of a Polynomial by Means of Multishift LR Algorithms
- Determining the number of real roots of polynomials through neural networks
- On the complexity of real root isolation using continued fractions
- On the stability of computing polynomial roots via confederate linearizations
- Polynomial root computation by means of the LR algorithm
- Real polynomial root-finding by means of matrix and polynomial iterations
- On scale functions for Lévy processes with negative phase-type jumps
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- Title not available (Why is that?)
- Parallel Iterative Algorithms
- Improved algorithms for computing determinants and resultants
- Solving secular and polynomial equations: a multiprecision algorithm
- On the Stationary Points of the Squared Distance between Two Ellipses with a Common Focus
- Relations between roots and coefficients, interpolation and application to system solving
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- On the parallel evaluation of a sparse polynomial at a point
- Computing curve intersection by means of simultaneous iterations
- Implementation of Pellet's theorem
- Generalization and variations of Pellet's theorem for matrix polynomials
- Orbit determination with the two-body integrals. II
- An algebraic method to compute the critical points of the distance function between two Keplerian orbits
- Computing curve intersection by homotopy methods
- Orbit determination with the two-body integrals
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Innovative methods of correlation and orbit determination for space debris
- New bounds for roots of polynomials based on Fiedler companion matrices
- Title not available (Why is that?)
- On using symmetric polynomials for constructing root finding methods
This page was built for software: na10
