Computing approximate greatest common right divisors of differential polynomials (Q2309522): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2963117492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore polynomial rings in one variable in computer algebra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On noncommutative finite factorization domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to pseudo-linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing GCRDs of approximate differential polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Hermite form of a matrix of Ore polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring linear partial differential operators in \(n\) variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of factoring and calculating the GCD of linear ordinary differential operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Factorization Algorithm for G-Algebras and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447170 / 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: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of non-commutative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GFUN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / 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: Modern Computer Algebra / 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: The approximate GCD of inexact polynomials / rank
 
Normal rank

Latest revision as of 04:40, 22 July 2024

scientific article
Language Label Description Also known as
English
Computing approximate greatest common right divisors of differential polynomials
scientific article

    Statements

    Computing approximate greatest common right divisors of differential polynomials (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2020
    0 references
    symbolic-numeric computation
    0 references
    approximate polynomial computation
    0 references
    approximate GCD
    0 references
    differential polynomials
    0 references
    linear differential operators
    0 references
    0 references
    0 references

    Identifiers

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