Computing multiple roots of inexact polynomials
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2151210
- The computation of multiple roots of a polynomial
- The computation of multiple roots of a Bernstein basis polynomial
- Simultaneous determination of polynomial roots and multiplicities: An algorithm and related problems
- Method for finding multiple roots of polynomials
Cites work
- A Fortran 90-based multiprecision system
- A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
- A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part II: A Stratification-Enhanced Staircase Algorithm
- Algorithm 835
- An algorithm for computing certified approximate GCD of n univariate polynomials
- An algorithm for the total, or partial, factorization of a polynomial
- An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Certified approximate univariate GCDs
- Computing the zeros of analytic functions
- Condition numbers of a nearly singular simple root of a polynomial
- Detection and validation of clusters of polynomial zeros
- Finding a Multiple Zero by Transformations and Newton-Like Methods
- General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
- scientific article; zbMATH DE number 1574491 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1329145 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 2151210 (Why is no real title available?)
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
- Iterative methods for multiple zeros of a polynomial by clustering
- Locating multiple zeros interactively
- Newton's method for overdetermined systems of equations
- Numerical impluimentation of a new algorithm for polynomials with multiple roots
- On approximate GCDs of univariate polynomials
- On condition numbers and the distance to the nearest ill-posed problem
- Polynomial roots: The ultimate answer?
- Principles for Testing Polynomial Zerofinding Programs
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
- Solving a Polynomial Equation: Some History and Recent Progress
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
Cited in
(53)- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Nearest multivariate system with given root multiplicities
- Computing values of a polynomial with only few multiplications
- A heuristic method for certifying isolated zeros of polynomial systems
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- Computational approach to hyperelliptic Riemann surfaces
- A new higher-order optimal derivative free scheme for multiple roots
- The numerical Jordan form
- A condition for multiplicity structure of univariate polynomials
- Structured matrix methods for the computation of multiple roots of a polynomial
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
- A numerical realization of the conditions of Max Nöther's residual intersection theorem
- Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations
- Method for finding multiple roots of polynomials
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- On deflation and multiplicity structure
- A certified iterative method for isolated singular roots
- Computational approach to compact Riemann surfaces
- Multiple zeros of nonlinear systems
- Computers and the Multiplicity of Polynomial Roots
- Regularization and matrix computation in numerical polynomial algebra
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
- Computing the nearest singular univariate polynomials with given root multiplicities
- Polynomial GCD derived through monic polynomial subtractions
- The computation of multiple roots of a polynomial
- scientific article; zbMATH DE number 2151210 (Why is no real title available?)
- Overdetermined Weierstrass iteration and the nearest consistent system
- scientific article; zbMATH DE number 915209 (Why is no real title available?)
- Multiple roots of estimating functions
- The computation of multiple roots of a Bernstein basis polynomial
- The numerical factorization of polynomials
- Numerical computation of the genus of an irreducible curve within an algebraic set
- Algebraic curves and Riemann surfaces in Matlab
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Algorithm 835
- Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Determining the multiplicity of a root of a nonlinear algebraic equation
- A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension
- A robust iterative family for multiple roots of nonlinear equations: enhancing accuracy and handling critical points
- RankRev: a Matlab package for computing the numerical rank and updating/downdating
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- An optimized Chebyshev-Halley type family of multiple solvers: extensive analysis and applications
- A unified approach to resultant matrices for Bernstein basis polynomials
- Efficient computation of the branching structure of an algebraic curve
- Duality of multiple root loci
- A study of accelerated Newton methods for multiple polynomial roots
This page was built for publication: Computing multiple roots of inexact polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654026)
