SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:48, 1 December 2024

scientific article; zbMATH DE number 7760793

Language	Label	Description	Also known as
English	SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials	scientific article; zbMATH DE number 7760793

Statements

scholarly article

0 references

SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (English)

0 references

Kosaku Nagasaka

0 references

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation

0 references

publication date

3 November 2023

0 references

zbMATH Keywords

approximate greatest common divisor

0 references

interpolation

0 references

multidimensional FFT

0 references

sparse polynomials

0 references

structured low rank approximation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1145/3597066.3597116

0 references

A geometrical approach to finding multivariate approximate LCMs and GCDs

0 references

Blind image deconvolution via Hankel based method for computing the GCD of polynomials

0 references

0 references

Structured Matrix Based Methods for Approximate Polynomial GCD

0 references

A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials

0 references

On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

0 references

Signal enhancement-a composite property mapping algorithm

0 references

The GPGCD algorithm with the Bézout matrix

0 references

0 references

The ERES method for computing the approximate GCD of several polynomials

0 references

Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials

0 references

0 references

Approximate GCD in Bernstein basis

0 references

&lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials

0 references

Fast Fourier transforms: A tutorial review and a state of the art

0 references

Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm

0 references

0 references

Certified approximate univariate GCDs

0 references

An ODE-based method for computing the approximate greatest common divisor of polynomials

0 references

Approximate factorization of multivariate polynomials via differential equations

0 references

Symbolic-numeric sparse interpolation of multivariate polynomials

0 references

Symbolic-numeric sparse interpolation of multivariate polynomials

0 references

0 references

An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

0 references

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

0 references

0 references

0 references

Blind image deconvolution via fast approximate GCD

0 references

Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs

0 references

Approximate polynomial GCD by approximate syzygies

0 references

Low-rank approximation. Algorithms, implementation, applications

0 references

Approximate GCD by bernstein basis, and its applications

0 references

Relaxed NewtonSLRA for approximate GCD

0 references

Toward the best algorithm for approximate GCD of univariate polynomials

0 references

Extended QRGCD Algorithm

0 references

Approximate GCD and its application to ill-conditioned algebraic equations

0 references

0 references

Computation of approximate polynomial GCDs and an extension

0 references

0 references

0 references

Quasi-gcd computations

0 references

A quadratically convergent algorithm for structured low-rank approximation

0 references

GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients

0 references

GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

0 references

GPGCD: an iterative method for calculating approximate GCD of univariate polynomials

0 references

On the Computation of the GCD of 2-D Polynomials

0 references

Variable projection methods for approximate (greatest) common divisor computations

0 references

Modern Computer Algebra

0 references

Structured total least norm and approximate GCDs of inexact polynomials

0 references

0 references

A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

0 references

An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix

0 references

Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials

0 references

The numerical greatest common divisor of univariate polynomials

0 references

The approximate GCD of inexact polynomials

0 references

0 references

0 references

Identifiers

10.1145/3597066.3597116

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6081970

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6081970&oldid=38011459"