Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207170600725701 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140382237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Version of the Euclidean Algorith / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rang revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resultant properties of gcd of many polynomials and a factorization representation of gcd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance properties, and characterization of the greatest common divisor of a set of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix pencil based numerical method for the computation of the GCD of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rank-Revealing Method with Updating, Downdating, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the GCD of polynomials using gaussian transformations and shifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3897591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate GCD and its application to ill-conditioned algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms for calculation of g.c.d. of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace method for the computation of the GCD of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Resultant Theorem / rank
 
Normal rank

Latest revision as of 11:17, 27 June 2024

scientific article; zbMATH DE number 5207425
Language Label Description Also known as
English
Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
scientific article; zbMATH DE number 5207425

    Statements

    Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (English)
    0 references
    0 references
    0 references
    31 October 2007
    0 references
    numerical examples
    0 references
    greatest common divisor
    0 references
    polynomials
    0 references
    matrix pencil methods
    0 references
    error analysis
    0 references
    algorithms
    0 references
    symbolical programming
    0 references
    stability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references