Computation of approximate polynomial GCDs and an extension
type: Item
instance of: scholarly article
title: Computation of approximate polynomial GCDs and an extension
zbMATH Open document ID: 1005.12004
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1853178
author: Victor Y. Pan
MaRDI profile type: Publication
full work available at URL: inco.2001.3032
OpenAlex ID: W1965692635
cites work: Q4187223
cites work: Q3657835
cites work: Q3138975
cites work: Q4314299
cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants
cites work: Signal enhancement-a composite property mapping algorithm
cites work: Q4232503
cites work: Q4227296
cites work: Q3619797
cites work: Q4717942
cites work: Certified approximate univariate GCDs
cites work: Q4226961
cites work: Improved processor bounds for combinatorial problems in RNC
cites work: Q5689624
cites work: The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
cites work: Q4875217
cites work: Q4232504
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Detection and validation of clusters of polynomial zeros
cites work: Q4023519
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: Invariance properties, and characterization of the greatest common divisor of a set of polynomials
cites work: A matrix pencil based numerical method for the computation of the GCD of polynomials
cites work: Q4227320
cites work: Résolution des systèmes d'équations algébriques
cites work: Approximate GCD and its application to ill-conditioned algebraic equations
cites work: Q5627593
cites work: Complexity of Computations with Matrices and Polynomials
cites work: Q4234125
cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Q2760974
cites work: Q3868672
cites work: Comparison of algorithms for calculation of g.c.d. of polynomials
cites work: Quasi-gcd computations
cites work: Best linear common divisors for approximate degree reduction
cites work: A Schur Method for Low-Rank Matrix Approximation
DOI: 10.1006/INCO.2001.3032
description: scientific article; zbMATH DE number 1853178