GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2012.10.023 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MultRoot / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GPGCD / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167303512 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1207.0630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subdivision method for computing nearest gcd with certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computations with Dense Structured Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of approximate polynomial GCDs and an extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4008406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric method in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative method for calculating approximate GCD of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical greatest common divisor of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2012.10.023 / rank
 
Normal rank

Latest revision as of 16:00, 9 December 2024

scientific article
Language Label Description Also known as
English
GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
scientific article

    Statements

    GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (English)
    0 references
    0 references
    29 November 2013
    0 references
    approximate polynomial GCD
    0 references
    gradient-projection method
    0 references
    ill-conditioned problem
    0 references
    optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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