Computation of approximate polynomial GCDs and an extension
From MaRDI portal
Publication:1854432
DOI10.1006/inco.2001.3032zbMath1005.12004OpenAlexW1965692635MaRDI QIDQ1854432
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.2001.3032
Related Items
Affine equivalences of trigonometric curves, A quadratically convergent algorithm for structured low-rank approximation, Relaxed NewtonSLRA for approximate GCD, The amended DSeSC power method for polynomial root-finding, Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL, Bernstein-Bézoutian matrices, Numerical factorization of multivariate complex polynomials, GPGCD: an iterative method for calculating approximate GCD of univariate polynomials, An ODE-based method for computing the approximate greatest common divisor of polynomials, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Structured low-rank approximation for nonlinear matrices, Approximate GCD of several univariate polynomials with small degree perturbations, The computation of multiple roots of a polynomial, A subdivision method for computing nearest gcd with certification, A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials, Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions, Approximate polynomial GCD over integers, Computing the polynomial remainder sequence via Bézout matrices, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Overdetermined Weierstrass iteration and the nearest consistent system, 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, Regularization and Matrix Computation in Numerical Polynomial Algebra, Structured total least norm and approximate GCDs of inexact polynomials, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Approximate polynomial GCD by approximate syzygies, GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials, Approximate polynomial GCD: small degree and small height perturbations, A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix, Method for finding multiple roots of 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, Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors, Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Real polynomial root-finding by means of matrix and polynomial iterations, Variable projection methods for approximate (greatest) common divisor computations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-gcd computations
- Fast projection methods for minimal design problems in linear system theory
- Résolution des systèmes d'équations algébriques
- Approximate GCD and its application to ill-conditioned algebraic equations
- Improved processor bounds for combinatorial problems in RNC
- Certified approximate univariate GCDs
- Detection and validation of clusters of polynomial zeros
- Best linear common divisors for approximate degree reduction
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Invariance properties, and characterization of the greatest common divisor of a set of polynomials
- Signal enhancement-a composite property mapping algorithm
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Complexity of Computations with Matrices and Polynomials
- A matrix pencil based numerical method for the computation of the GCD of polynomials
- Solving a Polynomial Equation: Some History and Recent Progress
- A Schur Method for Low-Rank Matrix Approximation
- The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
- Comparison of algorithms for calculation of g.c.d. of polynomials
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
