Pages that link to "Item:Q4654026"

The following pages link to Computing multiple roots of inexact polynomials (Q4654026):

Displaying 47 items.

• Computing the nearest singular univariate polynomials with given root multiplicities (Q385010) (← links)
• Polynomial GCD derived through monic polynomial subtractions (Q420250) (← links)
• The computation of multiple roots of a polynomial (Q425345) (← links)
• Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
• The numerical factorization of polynomials (Q525605) (← links)
• Numerical computation of the genus of an irreducible curve within an algebraic set (Q534004) (← links)
• Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (Q540325) (← links)
• The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
• RankRev: a Matlab package for computing the numerical rank and updating/downdating (Q684191) (← links)
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
• A unified approach to resultant matrices for Bernstein basis polynomials (Q735500) (← links)
• Efficient computation of the branching structure of an algebraic curve (Q766029) (← links)
• Duality of multiple root loci (Q891671) (← links)
• A study of accelerated Newton methods for multiple polynomial roots (Q973853) (← links)
• An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243) (← links)
• Nearest multivariate system with given root multiplicities (Q1015156) (← links)
• Computing values of a polynomial with only few multiplications (Q1313709) (← links)
• A heuristic method for certifying isolated zeros of polynomial systems (Q1634514) (← links)
• Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence (Q1760574) (← links)
• A new deflation method for verifying the isolated singular zeros of polynomial systems (Q1987424) (← links)
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
• Computational approach to hyperelliptic Riemann surfaces (Q2017868) (← links)
• A new higher-order optimal derivative free scheme for multiple roots (Q2059622) (← links)
• The numerical Jordan form (Q2074949) (← links)
• Structured matrix methods for the computation of multiple roots of a polynomial (Q2253088) (← links)
• An adaptive homotopy method for computing bifurcations of nonlinear parametric systems (Q2302401) (← links)
• Computing singular points of projective plane algebraic curves by homotopy continuation methods (Q2320699) (← links)
• A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
• Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations (Q2383772) (← links)
• A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set (Q2507587) (← links)
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
• On deflation and multiplicity structure (Q2628321) (← links)
• A certified iterative method for isolated singular roots (Q2674007) (← links)
• Computational approach to compact Riemann surfaces (Q2958636) (← links)
• Multiple zeros of nonlinear systems (Q3094284) (← links)
• Computers and the Multiplicity of Polynomial Roots (Q3327625) (← links)
• Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
• An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial (Q3627691) (← links)
• (Q4890087) (← links)
• Multiple roots of estimating functions (Q4944647) (← links)
• The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
• Algebraic Curves and Riemann Surfaces in Matlab (Q5390264) (← links)
• Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations (Q5758193) (← links)
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
• Determining the multiplicity of a root of a nonlinear algebraic equation (Q6191501) (← links)
• A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension (Q6548958) (← links)
• A robust iterative family for multiple roots of nonlinear equations: enhancing accuracy and handling critical points (Q6556731) (← links)