SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
From MaRDI portal
Publication:6081970
DOI10.1145/3597066.3597116OpenAlexW4383213615MaRDI QIDQ6081970
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3597066.3597116
interpolationapproximate greatest common divisorstructured low rank approximationsparse polynomialsmultidimensional FFT
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
- A quadratically convergent algorithm for structured low-rank approximation
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- Relaxed NewtonSLRA for approximate GCD
- Fast Fourier transforms: A tutorial review and a state of the art
- The ERES method for computing the approximate GCD of several polynomials
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Quasi-gcd computations
- Approximate GCD and its application to ill-conditioned algebraic equations
- Certified approximate univariate GCDs
- Low-rank approximation. Algorithms, implementation, applications
- Computation of approximate polynomial GCDs and an extension
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
- Toward the best algorithm for approximate GCD of univariate polynomials
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Approximate polynomial GCD by approximate syzygies
- The GPGCD algorithm with the Bézout matrix
- Variable projection methods for approximate (greatest) common divisor computations
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- An ODE-based method for computing the approximate greatest common divisor of 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
- Modern Computer Algebra
- Blind image deconvolution via fast approximate GCD
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Structured Matrix Based Methods for Approximate Polynomial GCD
- On the Computation of the GCD of 2-D Polynomials
- The numerical greatest common divisor of univariate polynomials
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
- Signal enhancement-a composite property mapping algorithm
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
- Approximate factorization of multivariate polynomials via differential equations
- The approximate GCD of inexact polynomials
- Approximate GCD in Bernstein basis
- Approximate GCD by bernstein basis, and its applications
- Extended QRGCD Algorithm
- GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Symbolic-numeric sparse interpolation of multivariate polynomials
This page was built for publication: SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
