swMATH604MaRDI QIDQ13359FDOQ13359
Author name not available (Why is that?)
Official website: http://www.neiu.edu/~zzeng/
Cited In (only showing first 100 items - show all)
- 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
- 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
- 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 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
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Nearest multivariate system with given root multiplicities
- 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
- TrIm
- Numerical proper reparametrization of parametric plane curves
- A numerical elimination method for polynomial computations
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- BPOLY
- CASA
- Title not available (Why is that?)
- SNAP
- PoSSo
- RRQR
- Aspic
- GPGCD
- Axel
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- GENOM3CK
- Algorithm 882
- 2D-WFMM
- FMM-Yukawa
- SLRA
- na25
- na20
- na10
- Eigensolve
- ERES
- Algorithm 931
- CARS
- NACLab
- MR
- The numerical greatest common divisor of univariate polynomials
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- DESCRIPTOR SYSTEMS Toolbox
- RankRev
- SOS.m2
- IDENT
- 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
- 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
- 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 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
- Fast Condition Estimation for a Class of Structured Eigenvalue Problems
- 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
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Computational approach to compact Riemann surfaces
- Amoeba Generator
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD
- Multivariate subresultants in roots
- 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
- A fast algorithm for solving the Sylvester structured total least squares problem
This page was built for software: MultRoot
