MultRoot

swMATH604MaRDI QIDQ13359FDOQ13359

Author name not available (Why is that?)

Described by source

• Algorithm 835

Cited In (98)

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

This page was built for software: MultRoot