Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation

DOI10.1016/J.JSC.2024.102368MaRDI QIDQ6615409zbMATH OpenFDO

Authors Kosaku Nagasaka

Publication date 8 October 2024

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JSC.2024.102368

zbMATH Keywords

approximate greatest common divisorinterpolationmultidimensional FFTsparse polynomialsstructured low-rank approximation

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Nonlinear algebraic or transcendental equations (65Hxx)

Recommendations

• Approximate GCD of multivariate polynomials
• Computing approximate GCD of multivariate polynomials
• The approximate GCD of inexact polynomials
• Approximate GCD by relaxed NewtonSLRA algorithm
• A fast parallel sparse polynomial GCD algorithm

Cites work

• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• A geometrical approach to finding multivariate approximate LCMs and GCDs
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• A quadratically convergent algorithm for structured low-rank approximation
• A Rank-Revealing Method with Updating, Downdating, and Applications
• An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
• An ODE-based method for computing the approximate greatest common divisor of polynomials
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
• Approximate factorization of multivariate polynomials via differential equations
• Approximate GCD and its application to ill-conditioned algebraic equations
• Approximate GCD by bernstein basis, and its applications
• Approximate GCD of multivariate polynomials
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
• Approximate polynomial GCD by approximate syzygies
• Blind image deconvolution via fast approximate GCD
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials
• Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
• Certified approximate univariate GCDs
• Computation of approximate polynomial GCDs and an extension
• Computing approximate GCD of multivariate polynomials
• Extended QRGCD algorithm
• Fast Fourier transforms: A tutorial review and a state of the art
• GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• scientific article; zbMATH DE number 5168246 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 40793 (Why is no real title available?)
• scientific article; zbMATH DE number 62668 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 1262453 (Why is no real title available?)
• scientific article; zbMATH DE number 2064527 (Why is no real title available?)
• scientific article; zbMATH DE number 953021 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Low-rank approximation. Algorithms, implementation, applications
• 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
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On the computation of the GCD of 2-D polynomials
• Quasi-gcd computations
• Relaxed NewtonSLRA for approximate GCD
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
• Signal enhancement-a composite property mapping algorithm
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
• Structured matrix based methods for approximate polynomial GCD
• Structured matrix-based methods for polynomial -gcd: analysis and comparisons
• Structured total least norm and approximate GCDs of inexact polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials
• The approximate GCD of inexact polynomials
• The ERES method for computing the approximate GCD of several polynomials
• The GPGCD algorithm with the Bézout matrix
• The numerical greatest common divisor of univariate polynomials
• Toward the best algorithm for approximate GCD of univariate polynomials
• Variable projection methods for approximate (greatest) common divisor computations

Cited in

(1)

• Approximate affine equivalences of polynomial and trigonometric curves

This page was built for publication: Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615409)