scientific article; zbMATH DE number 1859224
From MaRDI portal
Publication:4789207
zbMATH Open1018.65064MaRDI QIDQ4789207FDOQ4789207
Authors: Jean-Claude Yakoubsohn 
Publication date: 23 April 2003
Title of this publication is not available (Why is that?)
Recommendations
- Finding a cluster of zeros of univariate polynomials
- Newton Iteration Towards a Cluster of Polynomial Zeros
- On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- Weierstrass formula and zero-finding methods
convergenceeigenvaluesnumerical experimentscharacteristic polynomialunivariate polynomialWeierstrass methodzero-clusters
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)
Cited In (12)
- Zero-clusters of polynomials: best approach in supercomputing era
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD
- Near optimal subdivision algorithms for real root isolation
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- Title not available (Why is that?)
- A certified iterative method for isolated singular roots
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Title not available (Why is that?)
- Globally convergent, iterative path-following for algebraic equations
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- Finding a cluster of zeros of univariate polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789207)
