The following pages link to MultRoot (Q13359):
Displaying 50 items.
- Polynomial computations for blind image deconvolution (Q281962) (← links)
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← links)
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- Pseudospectra of exponential matrix polynomials (Q384997) (← links)
- A regularization approach for estimating the type of a plane curve singularity (Q385004) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- Computing the nearest singular univariate polynomials with given root multiplicities (Q385010) (← links)
- Twin-float arithmetic (Q412221) (← links)
- Polynomial GCD derived through monic polynomial subtractions (Q420250) (← links)
- The computation of multiple roots of a polynomial (Q425345) (← links)
- Numerical proper reparametrization of parametric plane curves (Q464649) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- The numerical factorization of polynomials (Q525605) (← links)
- Numerical computation of the genus of an irreducible curve within an algebraic set (Q534004) (← links)
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (Q540325) (← links)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- RankRev: a Matlab package for computing the numerical rank and updating/downdating (Q684191) (← links)
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
- A unified approach to resultant matrices for Bernstein basis polynomials (Q735500) (← links)
- Efficient computation of the branching structure of an algebraic curve (Q766029) (← links)
- Multivariate subresultants in roots (Q852659) (← links)
- Duality of multiple root loci (Q891671) (← links)
- On Smale's 17th problem: a probabilistic positive solution (Q937276) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- A fast algorithm for solving the Sylvester structured total least squares problem (Q971002) (← links)
- A study of accelerated Newton methods for multiple polynomial roots (Q973853) (← links)
- An improved Toeplitz algorithm for polynomial matrix null-space computation (Q1004243) (← links)
- A computational study of ruled surfaces (Q1006652) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- A heuristic method for certifying isolated zeros of polynomial systems (Q1634514) (← links)
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros (Q1643868) (← links)
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence (Q1760574) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- The Sylvester and Bézout resultant matrices for blind image deconvolution (Q1799667) (← links)
- A new deflation method for verifying the isolated singular zeros of polynomial systems (Q1987424) (← links)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- Computational approach to hyperelliptic Riemann surfaces (Q2017868) (← links)
- The numerical Jordan form (Q2074949) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Structured matrix methods for the computation of multiple roots of a polynomial (Q2253088) (← links)
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems (Q2302401) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- Computing singular points of projective plane algebraic curves by homotopy continuation methods (Q2320699) (← links)
- A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
