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