Approximate polynomial GCD over integers (Q651873)

From MaRDI portal

Revision as of 18:56, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximate polynomial GCD over integers	scientific article

Statements

scholarly article

0 references

Approximate polynomial GCD over integers (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.jsc.2011.08.011

0 references

Kosaku Nagasaka

0 references

Journal of Symbolic Computation

0 references

publication date

19 December 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

approximate polynomial GCD

0 references

numerical polynomial GCD

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jsc.2011.08.011

0 references

0 references

Heuristics on lattice basis reduction in practice

0 references

Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method

0 references

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

0 references

Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases

0 references

0 references

Certified approximate univariate GCDs

0 references

Approximate factorization of multivariate polynomials via differential equations

0 references

0 references

0 references

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

0 references

Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation

0 references

On approximate GCDs of univariate polynomials

0 references

0 references

Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor

0 references

Factoring polynomials with rational coefficients

0 references

A Rank-Revealing Method with Updating, Downdating, and Applications

0 references

An Inequality About Factors of Polynomials

0 references

Computation of the GCD of polynomials using gaussian transformations and shifting

0 references

0 references

0 references

Computation of approximate polynomial GCDs and an extension

0 references

0 references

An algorithm for computing certified approximate GCD of \(n\) univariate polynomials

0 references

0 references

0 references

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

0 references

Quasi-gcd computations

0 references

Approximate polynomial GCD: small degree and small height perturbations

0 references

Approximate Polynomial gcd: Small Degree and Small Height Perturbations

0 references

QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients

0 references

The approximate GCD of inexact polynomials

0 references

DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:651873

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