MultRoot
Algorithm 835: MultRoot - -a Matlab package for computing polynomial roots and multiplicities MultRoot is a collection of Matlab modules for accurate computation of polynomial roots, especially roots with non-trivial multiplicities. As a blackbox-type software, MultRoot requires the polynomial coefficients as the only input, and outputs the computed roots, multiplicities, backward error, estimated forward error, and the structure-preserving condition number. The most significant features of MultRoot are the multiplicity identification capability and high accuracy on multiple roots without using multiprecision arithmetic, even if the polynomial coefficients are inexact. A comprehensive test suite of polynomials that are collected from the literature is included for numerical experiments and performance comparison.
Keywords for this software
References in zbMATH (referenced in 92 articles , 1 standard article )
Showing results 1 to 20 of 92.
Sorted by year (- Fazzi, Antonio; Guglielmi, Nicola; Markovsky, Ivan: An ODE-based method for computing the approximate greatest common divisor of polynomials (2019)
- Dou , Xiaojie; Cheng , Jin-San: A heuristic method for certifying isolated zeros of polynomial systems (2018)
- Lee, Tsung-Lin; Li, Tien-Yien; Zeng, Zhonggang: RankRev: a Matlab package for computing the numerical rank and updating/downdating (2018)
- Petković, M. S.; Petković, L. D.: A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros (2018)
- Winkler, Joab R.; Halawani, Hanan: The Sylvester and Bézout resultant matrices for blind image deconvolution (2018)
- Bourne, Martin; Winkler, Joab R.; Su, Yi: A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials (2017)
- Bourne, Martin; Winkler, Joab R.; Yi, Su: The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (2017)
- Frauendiener, Jörg; Klein, Christian: Computational approach to compact Riemann surfaces (2017)
- Guglielmi, Nicola; Markovsky, Ivan: An ODE-based method for computing the distance of coprime polynomials to common divisibility (2017)
- Hauenstein, Jonathan D.; Mourrain, Bernard; Szanto, Agnes: On deflation and multiplicity structure (2017)
- Wu, Wenyuan; Zeng, Zhonggang: The numerical factorization of polynomials (2017)
- Lee, Hwangrae; Sturmfels, Bernd: Duality of multiple root loci (2016)
- Schost, Éric; Spaenlehauer, Pierre-Jean: A quadratically convergent algorithm for structured low-rank approximation (2016)
- Winkler, Joab R.: Polynomial computations for blind image deconvolution (2016)
- Frauendiener, Jörg; Klein, Christian: Computational approach to hyperelliptic Riemann surfaces (2015)
- Hu, Wenyu; Luo, Xingjun; Luo, Zhongxuan: A unified approach to computing the nearest complex polynomial with a given zero (2015)
- Ruatta, Olivier; Sciabica, Mark; Szanto, Agnes: Overdetermined Weierstrass iteration and the nearest consistent system (2015)
- Shen, Li-Yong; Pérez-Díaz, Sonia: Numerical proper reparametrization of parametric plane curves (2015)
- Christou, D.; Karcanias, N.; Mitrouli, M.: Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (2014)
- Li, Zhe; Liu, Qi: A heuristic verification of the degree of the approximate GCD of two univariate polynomials (2014)