MultRoot
From MaRDI portal
Software:13359
No author found.
Related Items (only showing first 100 items - show all)
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ An iterative method for calculating approximate GCD of univariate polynomials ⋮ The approximate irreducible factorization of a univariate polynomial ⋮ Unnamed Item ⋮ Polynomial computations for blind image deconvolution ⋮ A quadratically convergent algorithm for structured low-rank approximation ⋮ An algorithm for solving singular perturbation problems with mechanization ⋮ On deflation and multiplicity structure ⋮ A heuristic method for certifying isolated zeros of polynomial systems ⋮ A numerical elimination method for polynomial computations ⋮ A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros ⋮ Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations ⋮ A Symbolic-Numeric Algorithm for Genus Computation ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Multivariate subresultants in roots ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials ⋮ A Graduate Introduction to Numerical Methods ⋮ Pseudospectra of exponential matrix polynomials ⋮ A regularization approach for estimating the type of a plane curve singularity ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ Computing the nearest singular univariate polynomials with given root multiplicities ⋮ The calculation of the degree of an approximate greatest common divisor of two polynomials ⋮ Duality of multiple root loci ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ Twin-float arithmetic ⋮ Computational approach to compact Riemann surfaces ⋮ Polynomial GCD derived through monic polynomial subtractions ⋮ The computation of multiple roots of a polynomial ⋮ Computing nearby non-trivial Smith forms ⋮ A subdivision method for computing nearest gcd with certification ⋮ Guessing singular dependencies ⋮ The numerical greatest common divisor of univariate polynomials ⋮ Approximate polynomial GCD over integers ⋮ Numerical proper reparametrization of parametric plane curves ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Algebraic Curves and Riemann Surfaces in Matlab ⋮ Root-finding by expansion with independent constraints ⋮ On Smale's 17th problem: a probabilistic positive solution ⋮ Approximate radical for clusters: A global approach using Gaussian elimination or SVD ⋮ Structured low rank approximation of a Bezout matrix ⋮ A Rank-Revealing Method with Updating, Downdating, and Applications. Part II ⋮ A new deflation method for verifying the isolated singular zeros of polynomial systems ⋮ A structured rank-revealing method for Sylvester matrix ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ RankRev: a Matlab package for computing the numerical rank and updating/downdating ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Computing multiple roots of inexact polynomials ⋮ The numerical factorization of polynomials ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis ⋮ Approximate factorization of multivariate polynomials via differential equations ⋮ The approximate GCD of inexact polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Structured total least norm and approximate GCDs of inexact polynomials ⋮ Numerical computation of the genus of an irreducible curve within an algebraic set ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials ⋮ Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients ⋮ Improved algorithms for computing determinants and resultants ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ A fast algorithm for solving the Sylvester structured total least squares problem ⋮ A study of accelerated Newton methods for multiple polynomial roots ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ Computational approach to hyperelliptic Riemann surfaces ⋮ Newton's method with deflation for isolated singularities of polynomial systems ⋮ On location and approximation of clusters of zeros of analytic functions ⋮ A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ Unnamed Item ⋮ A unified approach to resultant matrices for Bernstein basis polynomials ⋮ An improved Toeplitz algorithm for polynomial matrix null-space computation ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ A computational study of ruled surfaces ⋮ An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Nearest multivariate system with given root multiplicities ⋮ An adaptive homotopy method for computing bifurcations of nonlinear parametric systems ⋮ Structured Matrix Based Methods for Approximate Polynomial GCD ⋮ GCD of multivariate approximate polynomials using beautification with the subtractive algorithm ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ Multiple zeros of nonlinear systems ⋮ Fast Condition Estimation for a Class of Structured Eigenvalue Problems ⋮ Moment inversion problem for piecewise D -finite functions ⋮ Efficient computation of the branching structure of an algebraic curve ⋮ Computing singular points of projective plane algebraic curves by homotopy continuation methods ⋮ The numerical Jordan form ⋮ Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases ⋮ Unnamed Item ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients ⋮ A numerical realization of the conditions of Max Nöther's residual intersection theorem ⋮ An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility ⋮ A unified approach to computing the nearest complex polynomial with a given zero
This page was built for software: MultRoot
