MultRoot
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An improved Toeplitz algorithm for polynomial matrix null-space computation
- A computational study of ruled surfaces
- Nearest multivariate system with given root multiplicities
- BPOLY
- CASA
- JNF
- SNAP
- SYNAPS
- POLSYS_PLP
- ApaTools
- 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
- PoSSo
- RRQR
- Aspic
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
- Improved algorithms for computing determinants and resultants
- The Sylvester and Bézout resultant matrices for blind image deconvolution
- GPGCD
- Axel
- GENOM3CK
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Computational approach to hyperelliptic Riemann surfaces
- The numerical Jordan form
- Algorithm 882
- 2D-WFMM
- FMM-Yukawa
- Structured matrix methods for the computation of multiple roots of a polynomial
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- Computing approximate greatest common right divisors of differential polynomials
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
- SLRA
- na25
- na20
- na10
- 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
- An algorithm for solving singular perturbation problems with mechanization
- A numerical elimination method for polynomial computations
- Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations
- Eigensolve
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Guessing singular dependencies
- Computing the polynomial remainder sequence via Bézout matrices
- ERES
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD
- Structured low rank approximation of a Bezout matrix
- A structured rank-revealing method for Sylvester matrix
- A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
- Structured total least norm and approximate GCDs of inexact polynomials
- Algorithm 931
- Approximate factorization of multivariate polynomials using singular value decomposition
- 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
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- CARS
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- On deflation and multiplicity structure
- NACLab
- MR
- Polynomial computations for blind image deconvolution
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
- A quadratically convergent algorithm for structured low-rank approximation
- An iterative method for calculating approximate GCD of univariate polynomials
- The approximate irreducible factorization of a univariate polynomial. Revisited
- A Symbolic-Numeric Algorithm for Genus Computation
- Numerical and symbolical methods for the GCD of several polynomials
- Computational approach to compact Riemann surfaces
- Structured matrix based methods for approximate polynomial GCD
- Multiple zeros of nonlinear systems
- The numerical greatest common divisor of univariate polynomials
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- Polynomial division by convolution
- DESCRIPTOR SYSTEMS Toolbox
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- Computing approximate GCD of multivariate polynomials
- An algebraic method for separating close-root clusters and the minimum root separation
- RankRev
- scientific article; zbMATH DE number 5302686 (Why is no real title available?)
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- A rank-revealing method with updating, downdating, and applications. II
- Regularization and matrix computation in numerical polynomial algebra
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
- Fast Condition Estimation for a Class of Structured Eigenvalue Problems
- Moment inversion problem for piecewise D -finite functions
- 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
- SOS.m2
- Twin-float arithmetic
- Polynomial GCD derived through monic polynomial subtractions
- IDENT
- The computation of multiple roots of a polynomial
- Numerical proper reparametrization of parametric plane curves
- Computing multiple roots of inexact polynomials
This page was built for software: MultRoot
