Pages that link to "Item:Q1184132"

The following pages link to Approximate GCD and its application to ill-conditioned algebraic equations (Q1184132):

Displaying 28 items.

• Pseudospectra of exponential matrix polynomials (Q384997) (← links)
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
• A subdivision method for computing nearest gcd with certification (Q638509) (← links)
• Affine equivalences of trigonometric curves (Q829601) (← links)
• Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
• The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
• Certified approximate univariate GCDs (Q1358910) (← links)
• Normal factorisation of polynomials and computational issues. (Q1416384) (← links)
• Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
• Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
• A companion matrix resultant for Bernstein polynomials (Q1863577) (← links)
• A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
• Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
• Approximate polynomial GCD by approximate syzygies (Q2009224) (← links)
• The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain (Q2029179) (← links)
• Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
• Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
• A new Gröbner basis conversion method based on stabilization techniques (Q2378509) (← links)
• Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
• Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
• On the Computation of the GCD of 2-D Polynomials (Q3089756) (← links)
• Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials (Q4610021) (← links)
• Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors (Q5002188) (← links)
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)