The following pages link to MultRoot (Q13359):
Displayed 50 items.
- A unified approach to computing the nearest complex polynomial with a given zero (Q2354766) (← links)
- An algorithm for solving singular perturbation problems with mechanization (Q2371434) (← links)
- A numerical elimination method for polynomial computations (Q2378510) (← links)
- Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations (Q2383772) (← links)
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials (Q2400326) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD (Q2468363) (← links)
- Structured low rank approximation of a Bezout matrix (Q2468365) (← links)
- A structured rank-revealing method for Sylvester matrix (Q2469622) (← links)
- A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis (Q2479468) (← links)
- Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- Newton's method with deflation for isolated singularities of polynomial systems (Q2503291) (← links)
- On location and approximation of clusters of zeros of analytic functions (Q2505645) (← 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)
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
- On deflation and multiplicity structure (Q2628321) (← links)
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm (Q2819632) (← links)
- An iterative method for calculating approximate GCD of univariate polynomials (Q2883839) (← links)
- The approximate irreducible factorization of a univariate polynomial (Q2883841) (← links)
- A Symbolic-Numeric Algorithm for Genus Computation (Q2912115) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- Computational approach to compact Riemann surfaces (Q2958636) (← links)
- Structured Matrix Based Methods for Approximate Polynomial GCD (Q3087160) (← links)
- Multiple zeros of nonlinear systems (Q3094284) (← links)
- The numerical greatest common divisor of univariate polynomials (Q3105519) (← links)
- (Q3162294) (← links)
- (Q3164993) (← links)
- (Q3447169) (← links)
- (Q3447177) (← links)
- (Q3514380) (← links)
- A Rank-Revealing Method with Updating, Downdating, and Applications. Part II (Q3561169) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial (Q3627691) (← links)
- Fast Condition Estimation for a Class of Structured Eigenvalue Problems (Q3642852) (← links)
- Moment inversion problem for piecewise <i>D</i> -finite functions (Q3643517) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- Approximate factorization of multivariate polynomials via differential equations (Q4657319) (← links)
- The approximate GCD of inexact polynomials (Q4657342) (← links)
- (Q4660677) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients (Q5188250) (← links)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- A Graduate Introduction to Numerical Methods (Q5326812) (← links)
- Algebraic Curves and Riemann Surfaces in Matlab (Q5390264) (← links)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)