An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GPGCD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SLRA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MultRoot / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2810837819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are two numerical polynomials relatively prime? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Matrix Based Methods for Approximate Polynomial GCD / 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: On Smooth Decompositions of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable nonlinear least squares: the variable projection method and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility / 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: Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for solving the Sylvester structured total least squares problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate gcds of polynomials and sparse SOS relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured low-rank approximation and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software for weighted structured low-rank approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the generalized Sylvester matrix / 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: A subspace method for the computation of the GCD of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent algorithm for structured low-rank approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: GPGCD: an iterative method for calculating approximate GCD of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable projection methods for approximate (greatest) common divisor computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Resultant Theorem / 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: The approximate GCD of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical greatest common divisor of univariate polynomials / rank
 
Normal rank

Latest revision as of 10:43, 19 July 2024

scientific article
Language Label Description Also known as
English
An ODE-based method for computing the approximate greatest common divisor of polynomials
scientific article

    Statements

    An ODE-based method for computing the approximate greatest common divisor of polynomials (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2019
    0 references
    Sylvester matrix
    0 references
    iterative methods
    0 references
    approximate GCD
    0 references
    polynomials
    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